Available question text
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.
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 956. Tallest Billboard
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source