widest-possible-fence

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>planks</code>, where <code>planks[i]</code> represents the height of the <code>ith</code> wooden plank. Each plank has a width of 1 unit.

You want to build a fence consisting of planks that all have the same height.

You may either use a plank as is, or combine exactly two distinct original planks into a single plank whose height equals the sum of their heights. Each original plank can be used at most once, and not all original planks need to be used.

Return the maximum possible width of the fence that can be built.

&nbsp;
Example 1:

<div class="example-block">
Input: planks = [1,3,2,5,7,5,4,2,1]

Output: 4

Explanation:

We can have four planks of height 5.

<ul>
	<li><code>planks[3] = 5</code></li>
	<li><code>planks[5] = 5</code></li>
	<li><code>planks[0] + planks[6] = 1 + 4 = 5</code></li>
	<li><code>planks[1] + planks[2] = 3 + 2 = 5</code></li>
</ul>

Hence, the maximum width is 4.
</div>

Example 2:

<div class="example-block">
Input: planks = [2,3,7]

Output: 1

Explanation:

<ul>
	<li>It is impossible to form two planks of the same height, even after combining two distinct original planks.</li>
	<li>Since not all original planks need to be used, we can choose any one plank as the fence.</li>
	<li>Therefore, the maximum possible width is 1.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= planks.length &lt;= 1000</code></li>
	<li><code>1 &lt;= planks[i] &lt;= 109</code></li>
</ul>