🔒 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 distances from node 0 for n=4, edges=[(0,1,1),(0,2,4),(1,2,2),(1,3,5),(2,3,1)]. Print result. Expected: [0, 1, 3, 4]
📋 Edit the starter code. 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.