🪢 Rope Joining Ritual

📖 Min Cost Rope Joining

Problem: Join n ropes; cost = sum of lengths being joined

Greedy: Always join two shortest ropes first

• Use min-heap to efficiently get smallest ropes

• Insert combined rope back into heap

Time: O(n log n)