Search
⌘K
Get Premium
Leetcode 956. Tallest Billboard
Given a list of rod lengths, choose two disjoint subsets whose sums are equal and as large as possible (welding rods allowed); return that maximum equal height or 0 if none exists. This is a partition/knapsack-style problem typically solved with dynamic programming over sum differences due to small n and bounded total sum.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.