Dsa
Graphs Dfs
Easy
Path in Maze
You are given a maze represented as a grid of '0's (path) and '1's (wall). Starting from the top-left corner, determine if there is a path to the bottom-right corner. Return True if a path exists, otherwise False.
Example:
Input:
0001
0110
0000
1000
Output:
True
Key concepts
graphsdfspath-finding
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now