Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing

preview_player
Показать описание


We have solved the problem, and we have gone from brute force and ended with the most optimal solution. Every approach's code has been written in the video itself. Also, we have covered the algorithm with intuition.

You can follow me across social media, all my handles are below:

Time Stamp

0:00 - Introduction to course
0:41 - Problem Statement
2:13 - Brute Force Solution
6:12 - Better Solution
7:40 - Optimal (Kadane's Algorithm)
13:18 - Code
15:29 - Time Complexity
15:40 - Follow up question
19:37 - Outro
Рекомендации по теме
Комментарии
Автор

13:56 "Do not carry any negatives into your future" - Striver

Even thought the context was different, it can be applied in our real life❤

lavanya_m
Автор

Let's march ahead, and create an unmatchable DSA course! ❤
Use the problem links in the description.

takeUforward
Автор

Couple of years back, I had watched the best video on YouTube(in terms of views) on Kadanes and still it was not very clear to me. And this video is so so better than the other video. Top level walkthrough.
P.S: I am not comparing. Else I would have told which video was that which I watched earlier :)

chethanprabhu
Автор

weird how this explanation of kadans algo is so simple compared to other yt videos. short algo short code. superb

rpanda_old
Автор

I did it by myself ..😅i found the logic after 10min I started..it feels so good . I don't know this problem is hard or not

harigs
Автор

Time Stamp
0:00 - Introduction to course
0:41 - Problem Statement
2:13 - Brute Force Solution
6:12 - Better Solution
7:40 - Optimal (Kadane's Algorithm)
13:18 - Code
15:29 - Time Complexity
15:40 - Follow up question
19:37 - Outro

There's always something new to learn from striver's videos . Thank You bhai for posting videos without any long gap!!!.

manipandit
Автор

Printing the subarrays part is something i learn this time tysm understood:)

Raj
Автор

#Free Education For All.. # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this...."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India....

shubhamagarwal
Автор

BEST Kadane's algo video on the internet!

vaishnaviganseh
Автор

Complete concept clarity in 20 mins. Amazing ✅✅✅✅

arnavjain
Автор

Nothing can describe how thankful we're to you for such amazing content.. . God Bless you Striver.. Hope you achieve everything you want ❤️❤️

rd_Eye_Gang
Автор

at 15:22 you have to add this code in for loop . if(maxi<0){maxi=0}; rest all the code is same as 14:17

tarunsingh
Автор

"Understood " superb intuition of algorithm !! awsome explanation i request everyone whoever watching strivers vedeos do like and comment!!!

bendivanitha
Автор

Kadame's Algorithm is now clear. Thankyou Striver ❤
From brute(TC -> O(N^3), SC -> O(1)) to better(TC -> O(N^2), SC -> O(1)) to Optimal(TC -> O(N), SC -> O(1))

Manishgupta
Автор

Really amazed by the effort you put into making us understand. Thank you, Striver!

chaithrac
Автор

Understood....Thank You So Much for this wonderful

stith_pragya
Автор

Thank you for this video, great explanation! I will need it for my exam in an hour haha!

AleksandrStrizhevskiy
Автор

Bro its 2pm night in India, You are doing great Job, consistency 💥

yugamsaini
Автор

Thank You so much for made this crystal clear understanding about this problem.

manjamalaimm
Автор

i saw many videos but not able to understad.... this video gave me complete understading..Thanks bro

yelururao
join shbcf.ru