← Google questions
CodingReported in a candidate post, Oct 2023

Dijkstra-based grid problem plus a modified variant

Filed under Google

You are given a 2D grid of integers heights, where heights[r][c] is the height of cell (r, c). You start at the top-left cell (0, 0) and want to reach the bottom-right cell (rows-1, cols-1). You may…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.