🔒 Preview mode. The first 15 Foundations lessons are free; this one is Pro. Start a 7-day trial to unlock the editor, AI hints and the rest of the curriculum. Card required, cancel any time in Dashboard.Start 7-day trial →
📝 **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.
✏️ Write your code here
🐍
Loading Python...
One-time download (~1 MB). Then it runs instantly.