Find Paths Across a Weighted Binary Grid
Company: Google
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Solve three top-to-bottom path tasks on a blocked grid: reachability, deterministic enumeration of simple paths, and a minimum-cost weighted path. Address multiple starting cells, positive entry costs, lexicographic tie-breaking, single-row grids, exponential output, and unreachable cases.
Read the full Google Software Engineer interview experience this question came from