Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3341. Find Minimum Time to Reach Last Room I
Given an n×m grid where each cell has the earliest time it can be entered and moving to an adjacent cell takes exactly 1 second (you may need to wait in a cell until the neighbor opens), compute the minimum time to reach the bottom-right cell from (0,0). This is a time-dependent shortest-path problem on a grid (solveable with Dijkstra/BFS using a priority queue, accounting for required wait times at neighbors).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.