I'm afraid of this problem because of it's name "Kadane's Algorithm" ... After ur video I went to GeeksForGeeks and solve this also solved it in Leetcode... Thankyou so much!!... I thought DSA is very hard for me..But ur explanations made it very easyy!!
Hey, Your awesome, Please do more videos on frequently asked questions .Please do more content you will get million subscriber's because your content and white board, practical code walk is awesome. Once content grows more you will start to see many subscribers because we like your explanation. I just told my whats app group friends and they will subscribe soon.
Thanks for all the support. To add more and more questions I do take requests. You can dm me or just tell me the question in comments. I too wish I could make more frequent videos…but don’t want to do any compromises on the quality. Thanks for sharing the video to your friends. This really motivates me.
Thanks brother. The explanation is great and your dynamic programming playlist is awesome. One question: What if we are asked to find that subarray start and end indexes as well ? How we will find ?
I didn't get which are step 3 and step 4 you are referring to in code comments. Also how those steps are equivalent to the code statement. If possible, could you please relate and elaborate?
Why is your channel still less than 500k subs, honestly cabt believe it 🎉🎉Good content out herr hust saw your channel today
Thank you so much. Your videos are really helpful for me in understanding how to approach these problems.
You're very welcome!
I'm afraid of this problem because of it's name "Kadane's Algorithm" ... After ur video I went to GeeksForGeeks and solve this also solved it in Leetcode...
Thankyou so much!!... I thought DSA is very hard for me..But ur explanations made it very easyy!!
Hey, Your awesome, Please do more videos on frequently asked questions .Please do more content you will get million subscriber's because your content and white board, practical code walk is awesome. Once content grows more you will start to see many subscribers because we like your explanation. I just told my whats app group friends and they will subscribe soon.
Thanks for all the support. To add more and more questions I do take requests. You can dm me or just tell me the question in comments.
I too wish I could make more frequent videos…but don’t want to do any compromises on the quality. Thanks for sharing the video to your friends.
This really motivates me.
The explanation is so good!
Thanks brother
why are we taking values from 3 (4th index) on wards (right to left) why not we start with 2nd and 3rd indices is there any reason for that
Thanks
Thank you so much sir
why is the sum of the lone element -2, 2? at 3.27
I misspoke over there. The sum of the alone element would be just '-2'
awesome brother❤️
Thank you😃
Thanks brother.
The explanation is great and your dynamic programming playlist is awesome.
One question:
What if we are asked to find that subarray start and end indexes as well ?
How we will find ?
you will need to keep a track of those indexes. try to write a pseudocode for it
I didn't get which are step 3 and step 4 you are referring to in code comments. Also how those steps are equivalent to the code statement. If possible, could you please relate and elaborate?
Hello sir, where i can find this problem in leet code
The link is always available in the description.
6+5+1 also would be a max sub array na? I am not getting how 7? Please can you explain
contiguous sub array! all elements taken in sub array should be next to each other only
did not get it pls explain
Which part are you having trouble in understanding? I can help you out.
hey sir why i=1 we get a -7
please point me to the timestamp you are having a problem with