Compute earliest arrival in time-grid
DoorDashSoftware Engineer · Technical Screen
Last updated
This question evaluates algorithmic problem-solving and pathfinding skills on grid-based graphs, focusing on modeling time-dependent traversal constraints and reasoning about efficient search and supporting data structures.
Question
LeetCode 778. Swim in Rising Water – Given an n x n integer grid where grid[i][j] is the earliest time you can enter the cell, starting from (0, 0) move 4-directionally only when the current time is ≥ the target cell's value; find the minimum time to reach (n-1,n- 1).
https://leetcode.com/problems/swim-in-rising-water/description/
Solution walkthrough is for members
Get the full walkthrough with reference code and complexity analysis, plus Kitty Coach at 300 messages a day. Hints, the code runner and community answers stay free.