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