Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1391. Check if There is a Valid Path in a Grid
Determine whether there's a path from the top-left to bottom-right of an m×n grid where each cell type specifies which neighboring directions it connects to, and you may move only between adjacent cells whose street types mutually connect; essentially check reachability in a grid-graph with constrained edge compatibility (e.g., via BFS/DFS).
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.