Graph BFS: shortest path in grid

← Courses›Interview PrepModule 2 · Arrays, Strings, Two-Pointer›Graph BFS: shortest path in gridwrite21 / 100

Task

📝 **Task:** Find shortest path in `[[0,0,0],[1,1,0],[0,0,0]]` from (0,0) to (2,2). 0=walkable, 1=wall. Print the result. Expected: 4

📋 Implement the function above. Tests run automatically.

💡 **Hint:** Re-read the theory if stuck.

Keep going

🎯write

Graph DFS: number of islands

🎯writeFREE

Two pointers: pair sum

🎯write

Two pointers: palindrome check

🤖predictFREE

Prerequisites — what you should know before this track

⚡predictFREE

Prerequisites — what you should know before this track

✏️ Write your code here

🐍

Loading Python...

First visit only — ~5-10s. Stays cached afterward.

📊 Result

Press Run to see result...

Keep going

💬 Discussion