Container With Most Water

🧠 Problem

Container With Most Water

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the container contains the most water. Return the maximum amount of water a container can store. Notice that you may not slant the container.

---

🏷️ Tags

array, two pointers, greedy

---

📊 Difficulty

Medium

✅ Success Rate: 53.9%
📥 Submissions: 2,673,605
📈 Accepted: 1,441,824

---

❤️ Reactions

👍 Likes: 16437
👎 Dislikes: 930

---

💡 Hints

The aim is to maximize the area formed between the vertical lines. The area of any container is calculated using the shorter line as length and the distance between the lines as the width of the rectangle.

Area = length of shorter vertical line * distance between lines

We can definitely get the maximum width container as the outermost lines have the maximum distance between them. However, this container might not be the maximum in size as one of the vertical lines of this container could be really short. Start with the maximum width container and go to a shorter width container if there is a vertical line longer than the current containers shorter line. This way we are compromising on the width but we are looking forward to a longer length container.

---

🔁 Similar Questions

• Trapping Rain Water

Leetcode Link : Container With Most Water