Check if There is a Valid Path in a Grid - LeetCode
You will initially start at the street of the upper-left cell (0, 0). A valid path in the grid is a path that starts from the upper left cell (0, 0) and ends at the bottom-right cell (m - 1, n - 1). The path should only follow the streets. Notice that you are not allowed to change any street. Return true if there is a valid path in the grid or false otherwise. Example 1: Example 2: Example 3: Constraints: 1. Please don't post any solutions in this discussion. 2. The problem discussion is for asking questions about the problem or for sharing tips - anything except for solutions. 3. If you'd like to share your solution for feedback and ideas, please head to the solutions tab and post it there. You can check your keyboard quality by doing this question. wtf is this this question has no learning value, it's just very implementation-based. I'll leave the directions and valid map here for folks who will stumble upon this problem after. Knowledge Complexity: O(easy) Time Complexity: O(hard) O