Available question text
Find the minimum time to reach the bottom-right cell in an n×m grid from (0,0) when each cell has a minimum allowed time you can start moving into it and each move alternates in duration between 1 and 2 seconds (first move = 1s). This is a shortest-path problem with time-dependent edge costs and a parity state (move index mod 2) that determines move length.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3342. Find Minimum Time to Reach Last Room II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source