September 21, 2024
wp-header-logo-21.png
https://www.youtube.com/watch?v=EbkMABpP52U


Lecture 14 of DSA Series – Container with Most Water Problem | Leetcode 11 Share your progress on Twitter …

20 thoughts on “Container with Most Water Problem | Brute & Optimal Solution | Two Pointer Approach – Leetcode 11

  1. why don’t we use max height method ….so my approach is the max water will be stored btw max(hight.j) and max(height.i) but if max height is stored in j we will take the next max height present in array and store it in i after this we will directly find width and min of (i,j) and solve acc to mam shown at the begining.??

  2. I have a Request:-
    Please make a video on Push Notifications means
    How to Send Push Notifications to Users For web [HTML,JS] using FCM or OneSignal, Amazon SNS ect.

    Please make a Video on it.
    ❀😊❀

Leave a Reply

Your email address will not be published. Required fields are marked *