Max Consecutive Ones | Leetcode

Find DSA, LLD, OOPs, Core Subjects, 1000+ Premium Questions company wise, Aptitude, SQL, AI doubt support and many other features that will help you to stay focussed inside one platform under one affordable subscription. Have a hassle free one stop solution for up-skilling and preparing.

[takeUforward]

Do leave a comment if you get the solution :) helps me a lot


Instagram: striver_79

[willturner]

I solved 400+ problems on leetcode but still watching this easy one problem because of you striver.. ✌

[NiranjanKumar-yjmn]

i thought of same logic, but was scared to code it. watched ur video till 2min 53s and got confidence to try coding it myself and i can tell i feel good. Still beginner in dsa! Thank you TUF!

[ishanshah]

I had solved this question already in leetcode but still saw your video because I just like to watch your videos even if I know the video content already.

[roushanraj]

Your explanation is way smoother that any one can imagine 💥💥🙏💯💥

[mikedelta]

A wonderful and simple explanation. Thanks man!

[jatingarg]

Bhai. You are a Farishta for a Tier 3 Student. I started loving DSA just because of you.

[roushanraj]

Thank you bhya, for making videos for us, we all love you 💓💓💯💯💯

[gauravtripathi]

This problem is pretty easy as compared to other problems of this day and even before this day, and it doesn't even use 2 pointer approach, so why categorize this in this category.

[HarshGupta-gr]

I copied line by line the code you wrote .! Still its showing runtime error .. Can you please explain why this is happening

[razvanpetrisor]

ok so, shouldn t you put another maxi = max (maxi, cnt); before cnt = 0;? or otherwise you will lose the count at the first number that s not 1?

[upendrabandi]

The gfg link in DSA sheet is not the exact problem. Please have a look sir and please upload a solution for that problem

[paragroy]

Nice explanation your videos are really good...please keep on making such videos.

[palakmittal]

I have performed the exactly same code on leetcode without even watching solution. Runtime: 84 ms, faster than 36.73% of C++ online submissions for Max Consecutive Ones. But why 36.73 ? I don't think this could be optimized to O(1) or O(log n)

[ranasauravsingh]

UNDERSTOOD...!!!
Thanks striver for the video... :)

[quervy]

Great tutorial, helped a lot! Thank You!

[shreyasingh]

I did it by two pointer, same thing however

[adityamahimkar]

The problem is very similar to max subarray... actually as I started watching I remembered there's a question similar to kadane's algo

[pranav]

I am able to figure out the logic of such questions but unable to write the code structure being a beginnner. anyone else facing this problem

[devprakash]

I thought he'd use bit manipulation