Recursive Maze Escape
Recursive Maze Escape
MediumRecursion17% accepted
Explore a blocked maze and decide whether a route exists from the top-left corner to the bottom-right corner.
Approach
Read a grid of 0s and 1s. A value of 1 is blocked. Print YES if a path exists using four-direction movement, else NO.
Input
3 3
0 0 0
0 0 0
0 0 0
Output
YES
More Recursion problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards