Container With Most Water

medium

Acceptance: 47%

ArraysTwo Pointers

Consider a set of vertical barriers plotted on a number line, where the height of the barrier at position i is given by the array entry at index i. Pick any two barriers to form a container. The container's water capacity equals the shorter barrier's height multiplied by the horizontal distance between them. Find the pair that yields the maximum capacity.

Examples

Example 1:

Input:heights = [3,9,2,5,8,4,7]

Output:35

Explanation: Barriers at index 1 (height 9) and index 6 (height 7) form the largest container: min(9,7) * (6-1) = 35.

Example 2:

Input:heights = [4,4]

Output:4

Explanation: The only pair of barriers forms a container of area min(4,4) * 1 = 4.

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Container With Most Water

Examples

Hints

Related Problems