Max Consecutive Ones III | Leetcode June Challenge | Leetcode 1004 | Approach + Code | C++ | Python

C++ Code Link : github.com/Ayu-99/Data-Struct...
Python Code Link: github.com/Ayu-99/Data-Struct...
Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)
#leetcode
#leetcodeJuneChallenge
#interviewpreparation
Max Consecutive Ones III solution
Max Consecutive Ones III Leetcode
Max Consecutive Ones III C++
Max Consecutive Ones III C++ Hindi
Max Consecutive Ones III Hindi
Checkout the series: 🔥🔥🔥
👉 Recursion : • Recursion
👉 Stack and Queue : • Stack And Queue
👉 Greedy : • Greedy
👉 Leetcode contests : • Leetcode contests
👉 Leetcode June Challenge : • Leetcode June Challenge
LIKE | SHARE | SUBSCRIBE 🔥🔥😊

[@devanshdixitmusicallyyours3885]

pls make more such videos , u have literally explained this problem so amazingly... thank u

[@phantom3612]

Understood! thanks.
C++ implementation ---
//ALGORITHM: Basically we see arr, we see k. Voila!\
//Sliding window problem. Now to tackle this.
//We take i=j=0. ans=0 and zerocount=0
//Basically, j will keep on moving till
//we our zerocount > k. At that point.
//we first do ans = max(ans, j-i+1)
//next obv, we need to move i (that is,
//sliding the fucking window.)
//Now till when? Glad you asked!
//We do it until we get a pass! (i.e. our
//zerocount becomes equal to k
//at that point we simply go back to moving j
//untill we see another 0 focring us to incrment
//zerocount. Thus the steps repeat)
int longestSubSeg(vector &arr , int n, int k){
int i=0, j=0, ans=0, zerocount=0;
while(j

[@ninadkheratkar6716]

Thank you for the detailed explanation!

[@vivekswami2182]

Really amazing explanation, loved it !!

[@robinofautumn99]

was half way through your video, but completely understood the concept... thanks Di😄😄😄😄

[@AyushiSharmaDSA]

welcome 😄 glad it was helpful :)

[@mayank_singh_43]

Awsm explaination, best on utube

[@RahulVerma-fz2jf]

Great job. Explanation is really clear. After this, I hope I don't mess the implementation again in the interview.

[@AyushiSharmaDSA]

Thanks Rahul 🤗

[@sanskarsinghh]

Thank you for the crystal clear explanation didi :)

[@tot7997]

thanks a lot.. amazing explanation ❤

[@anupkhismatrao9280]

Amazing explanation ❤

[@krishnavamsichinnapareddy]

Very good explanation 👍

[@VijayPatel-ez4lp]

thanku mam
nice explanation

[@suruchikumari8371]

Today i visit your channel first time while facing difficulties solving this problem.... really you explained very well dii...now my all doubts are cleared about two pointer approach.....

[@AyushiSharmaDSA]

glad to hear that :)

[@abhaythakur2597]

very well explained

[@AkashYadav-po5kb]

Phli ladki dekho hai jiski coding itni acchi h , very good explanation, keep it up and subscribed👍

[@GhostRider....]

nice explanation

[@nomore_alive9262]

Koi chakkar ni🤘🤘

[@Akash-Bisariya]

Thanks for explaining so nicely!!

[@AyushiSharmaDSA]

Glad it was helpful!😊

[@shripadkhandare]

Thanks For Nice explanation.

[@AyushiSharmaDSA]

welcome :)

[@nandiniverma5273]

Very Good Dry run , thanks

[@AyushiSharmaDSA]

thank you Nandini :)

[@RohitGupta-xf3zp]

Thanks dii very easy and clear explanation.

[@AyushiSharmaDSA]

welcome, glad it was helpful :)

[@ankitnishad7831]

I tried this question by myself but couldn't make through some cases nice explanation got to know what I was mistaking.

[@AyushiSharmaDSA]

Glad it was helpful Ankit 🤗🤩

[@beastcracker117]

Shukria ❤

[@harshexploring4922]

The explaination was really great

[@AyushiSharmaDSA]

Thanks Harsh 🤗

[@rushikeshubale3478]

Nice explanation. Thanks!

[@AyushiSharmaDSA]

thank you, glad it was helpful :)

[@tusharjeena7081]

mam your voice is so sweet

[@ashutoshbajpai3133]

great explaination

[@AyushiSharmaDSA]

Thank you 😊

[@user-ze3mk9wk5c]

useful

[@AyushiSharmaDSA]

Glad you think so!

[@rahulsati5819]

thnks amazing explanation

[@AyushiSharmaDSA]

Welcome Rahul, glad u liked it 🤗

[@amanranjan2684]

thx

[@divyansh1391]

thanks di❤

[@AyushiSharmaDSA]

Welcome Divyansh :)

[@davinder95]

dusre while ki jagah if b chl jata no need to used two whiles

[@vishalsrivastavavishalsri92]

For input "111000" and k=1 the answer should be 3 but your code will give 4 since there is no information about the number of 1s.

[@Ramneet04]

I think it should be 4 only . Why do you think its going to be 3???

[@chandlerbing8164]

to draw do you use mouse only or graphics tablet or you have touch screen ?

[@AyushiSharmaDSA]

I use external mouse :)

[@AdityaSingh-li4km]

Hello ,
can u ecplain why this works ?
zeros, l = 0, 0
for r, n in enumerate(nums):
zeros += n == 0
if zeros > k:
zeros -= nums[l] == 0
l += 1
print(r,l,len(nums))
return r - l + 1

[@adj5951]

I think you should explain more clearly, it was a bit complex to understand, i understood the concept, but then how to play with i and j was a bit difficult to comprehend

[@exploringworld6817]

Time complexity kya rahegi?

[@AyushiSharmaDSA]

Time : O(n)
Space : O(1)

[@shivajibanoth306]

Atmost we lookup each element twice so
O (2*n)..which is nothing but O(n).

[@AyushiSharmaDSA]

@@shivajibanoth306 yes

[@aishwaryarathod5421]

oyy dii,, its not sliding window
its two pointer method

[@AyushiSharmaDSA]

Oyy geeks, we are maintaing a window having at most k zeros everytime. It's sliding window🙂

[@exploringworld6817]

@@AyushiSharmaDSA epic reply😂

[@AyushiSharmaDSA]

@@exploringworld6817 😂😂😅

[@aishwaryarathod5421]

🥸🥸,, your ans is like
I'm justifying my ans with the reason you use 2 pointers🙂.

[@AyushiSharmaDSA]

@@aishwaryarathod5421 Bro, there are different approaches. You can try whichever you like. 😃

[@sahilverma4142]

Phir Level add ni kiye😔

[@AyushiSharmaDSA]

I added in thumbnail. Do you want me to add in title?

[@exploringworld6817]

@@AyushiSharmaDSA okk chlega

[@AyushiSharmaDSA]

@@exploringworld6817 I'll add in title from next time👍🏻

[@user-gv9wm2oi3h]

nice explanation

[@AyushiSharmaDSA]

thank you, glad it was helpful :)