Available question text
Find the minimum total cost to reach (m-1,n-1) on an m×n grid where you alternate between moving (only right or down on odd-numbered seconds) — paying each entered cell’s entry cost (i+1)*(j+1) — and mandatory 1-second waits on even-numbered seconds that incur waitCost[i][j]; treat time-parity as part of state and compute a shortest-path/DP over (i,j,parity).
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 3603. Minimum Cost Path with Alternating Directions II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source