Available question text
Given a grid where each cell points to a neighbor and flipping a cell's arrow costs 1, find the minimum number of flips needed to create any path from the top-left to the bottom-right. This is a shortest-path problem on a directed grid where moves that follow a cell's arrow cost 0 and other moves cost 1 (solvable with 0-1 BFS or Dijkstra).
Related questions
Continue with questions that share topics or the same question type.
- Minimum Path Cost in a Grid
Coding
- Minimum Path Cost in a Hidden Grid
Coding
- Check if There is a Valid Path in a Grid
Coding
- Minimum Add to Make Parentheses Valid
Coding · Bracket Sequences · Greedy · Stack
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 1368. Minimum Cost to Make at Least One Valid Path in a Grid
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source