Maximize area between vertical lines

Q: Maximize area between vertical lines

This question evaluates algorithmic reasoning with arrays and the ability to optimize pairwise measurements, specifically assessing understanding of how positional distance and element values combine to maximize an area metric.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Problem

You are given an integer array h where h[i] represents the height of a vertical line drawn at x-coordinate i.

Choose two different indices i < j. Together with the x-axis, these two lines form a container that can hold water.

The amount of water the container can hold is:

$\text{area}(i, j) = (j - i) \times \min(h[i], h[j])$

Return the maximum possible area over all pairs (i, j).

Input

h : array of non-negative integers

Output

An integer: the maximum area

Constraints (typical interview constraints)

2 <= len(h) <= 10^5
0 <= h[i] <= 10^4

Maximize area between vertical lines

Quick Overview

Problem

Input

Output

Constraints (typical interview constraints)

Comments (0)