LeetCode 11. Container With Most Water | Solution Explained

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. LeetCode Reference: https://leetcode.com/problems/container-with-most-water/ 00:00 Problem Statement 00:58 Brute Force Approach 03:24 Optimized Solution 06:36 Coding Session #LeetCode11 #LeetCode #LeetCodeSolutions