#11 Container with most water | LeetCode Problem Solving | DSA | Algorithm | Hindi

In this video, we will solve problem #11 of leetcode. I will show you the best approach to solve this problem in O(N) time complexity. We will see two different approaches to the problem to optimize time complexity from O(N^2) to O(N) You can watch the whole leetcode series in the playlist: https://www.youtube.com/playlist?list=PLyTI7CpFS6wVIc-wBUdvj92V2holCXPUI Content of Video: 0:00 - Intro 0:05 - Problem Explanation 1:35 - Solution in O(N^2) 2:48 - Code for O(N^2) 5:34 - Time Complexity for O(N^2) 6:26- Solution for O(N) 9:25 - Code for O(N) 11:35 - Time Complexity for O(N) #leetcode #datastructures #algorithm #problemsolving #coding #competitiveprogramming