Maximum Sum Circular Subarray | Leetcode 918

[ojaswibhardwaj]

It's just perfect way to teach anyone... you are such a savior man... thank you

[sauryakumargupta]

Your ability to explain a complex issue in a concise and comprehensive manner is truly impressive, sir.

[amitazadi]

This was the best explanation. I understood the code, but I was finding like how we came up with this approach. It's really nice, that's why I am doing comment.

[soumyajitdey]

What software are you using to write and explain the Algos?

[akankshasaini]

You saved me here! After wasting a lot of time, I was thinking to copy paste the solution.

[AA-rgmv]

sir, if we are doing y+z, what is the need of comparing it with the result of normal kadane algo i.e x ?

[codeishard]

14:52 how does kadanes algo give -1 in a array with all negative number?

[tejasdonadkar]

ap itna badia kyse soch lete ho sir
Thank You So much sir

[amanjaiswal]

your way of doing dry run is awesome sir
thanku very much

[samyakjain]

bhai i lovee ur reverse engineering...i just paused by ad blocker for you video so you get ad revenue...i love ur videos man...make more such

[vaidehimahyavanshi]

Your explanation is just up to mark! Thankyou

[PRERITAGRAWALBLC]

is there also a video kadane's algorithm ??

[DivyaPrakash-bjzk]

Bhai outro music htale kaan phhat gye.
Btw great explanation.

[akashpoonia]

Video mast tha bhai... Aise he recursion pay bhi koi series bana do pleaseee...

[rohand]

tum bada mast kaam karte ho Maqsood bhai

[abhinavverma]

It was tough question for me. Thought a lot, but couldn't come up with negating all array elements approach

[iamkdblue]

Great Explanation Buddy :), Upper Upper se Gaya hahahah .... But tune mst bataya keep it up

[Satishkumar-rxoy]

thanks sir. It helped lot to understand

[sagarhande]

Well explained 👏Thanks a lot got it now🙌

[piyushjain]

You missed one case when all the elements of the array are negative, in this case, your code will give the wrong answer, so add an extra condition: if all elements are negative then return max(arr).