Dsa
Graphs Dfs
Easy
Maze Path Finder
You are tasked with finding a path from the top-left corner to the bottom-right corner of a maze represented as a grid. The maze consists of '0's (paths) and '1's (walls). You can move up, down, left, or right. Return 'Yes' if a path exists and 'No' otherwise.
Input:
3
000
010
000
Output:
Yes
Key concepts
graphsdfspathfinding
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