Скачать или смотреть Container With Most Water - Leetcode 11 - C#

Problem link - https://leetcode.com/problems/contain...

leetcode 11
#Coding #Programming #CodingInterview #leetcode #SlidingWindow #Blind75

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.

Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example 2:

Input: height = [1,1]
Output: 1

▬ Contents of this video ▬▬▬▬▬▬▬▬▬▬

00:00 - Problem Description
04:10 - Bruteforce solution
12:53 - Implementation of Bruteforce solution
16:01 - Sliding Window solution
21:57 - C# code for sliding window solution