Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1167. Minimum Cost to Connect Sticks
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source