Check if There is a Valid Path in a Grid: coding question

Available question text

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).

Continue with questions that share topics or the same question type.

Check if There Is a Valid Parentheses String Path
Coding
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
Coding
Check if There is a Path With Equal Number of 0's And 1's
Coding
Check if There is a Valid Partition For The Array
Coding

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 1391. Check if There is a Valid Path in a Grid
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Check if There is a Valid Path in a Grid

Available question text

Related questions

Check if There is a Valid Path in a Grid

Available question text

Related questions