Quick Overview

These two problems evaluate algorithmic skills in array optimization and graph pathfinding: the first focuses on selecting three ordered, non-overlapping variable-length subarrays to maximize the total sum with lexicographic tie-breaking, and the second targets shortest-path computation and optional path reconstruction in a directed weighted graph.

Solve Two Algorithm Challenges

Company: Visa

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Take-home Project

Quick Answer: These two problems evaluate algorithmic skills in array optimization and graph pathfinding: the first focuses on selecting three ordered, non-overlapping variable-length subarrays to maximize the total sum with lexicographic tie-breaking, and the second targets shortest-path computation and optional path reconstruction in a directed weighted graph.

Loading…