Graphs: Kruskal MST

← Courses›Interview PrepModule 4 · Dynamic Programming & Heap›Graphs: Kruskal MSTwrite50 / 100

Task

📝 **Question:** Compute MST total weight via Kruskal. n=4, edges=[(0,1,1),(1,2,2),(0,2,4),(2,3,3),(0,3,5)]. Print total.

📋 Pick the right answer.

💡 **Hint:** Re-read the theory above if unsure.

Keep going

🎯write

Segment tree: range sum + point update

🎯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