Skip to content

Practice Tallest Billboard

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#956
LeetCode Problem

Tallest Billboard

Problem Statement

You are installing a billboard and want it to have the largest height. The billboard will have two steel supports, one on each side. Each steel support must be an equal height. You are given a collection of rods that can be welded together. For example, if you have rods of lengths 1, 2, and 3, you can weld them together to make a support of length 6. Return the largest possible height of your billboard installation. If you cannot support the billboard, return 0.

Source: Tallest Billboard on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
rods = [1,2,3,6]
Output
6

# Example 2

Input
rods = [1,2,3,4,5,6]
Output
10

# Example 3

Input
rods = [1,2]
Output
0

Constraints

1 <= rods.length <= 20
1 <= rods[i] <= 1000
sum(rods[i]) <= 5000

Related LeetCode Problems

Practice more problems similar to Tallest Billboard.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.