Available question text
Given a grid with movement costs, find the minimum total cost to go from a start to a target cell while your moves must alternate between horizontal and vertical directions; treat the last move direction as part of state and use graph search / DP (BFS or Dijkstra) over (row, col, last-direction) to compute the optimal path.
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 3596. Minimum Cost Path with Alternating Directions I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source