Leetcode 1167. Minimum Cost to Connect Sticks

Given a list of stick lengths where merging any two sticks costs the sum of their lengths, compute the minimum total cost to combine all sticks into one. This is a greedy/Huffman-like problem: repeatedly choose the two smallest sticks (min-heap) to minimize accumulated merge cost.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1167. Minimum Cost to Connect Sticks

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact