Maximum Sum SubArray (Kadane's algorithm) (Largest Sum Contigous SubArray)

[@avinashkumar3643]

Best Explanation of Kadane's Algo I have ever seen. The most important thing that you explained the algo into two parts - 1. Find the greatest sum 2. Find the starting and ending indices of subarray containing the max sum

[@tanmayagarwal8513]

I love the way how innocently he teaches.

[@DAVISBENNYMIS]

(2 Line solution ) :- int Kadane(int[] arr){ int localmax=arr[0]; int globalmax=arr[0]; for(int i=1;i

[@ajayshukla7238]

nice one

[@premkumareaswaran6875]

What's n here? If it is the length of the array, I get 22 for the above array that Vivekanand has used for the tutorial. Did you try using it before posting the 2-line answer?

[@sandip_kanzariya8476]

Superb solution ☺️😃 enjoy 🤠 Can you explain this solution ?

[@armanmanukyan1970]

After wandering in a lot of youtube channels, eventually I've found the best explanation here. Thanks.

[@gautamtyagi8846]

brilliant explanation! the big thing is he makes it much easier to understand. thanks a lot.

[@jitendarsahani11]

Bahut dino se struggle kr rha tha...lekin aaj samaj mei aa gaya. Thanx...

[@mahesh_kndpl]

The way you explain is so clear. Thanks man.

[@dascalucosmin6137]

Thank you for explaining the Maximum Sum Subarray algorithm in such an easy way. You are really good teacher! Keep up the good work!!!

[@vaishnavia.n.312]

the way u explain is crystal clear, thank nu so much @vivek.

[@singarajusureshkumar2330]

one n only one best explaination of kadane's algo

[@SunilKumar18]

Great work man. Brilliant explanation. Please keep doing more videos. hope your channel grows.

[@LarryRuane]

Great explanation, I love it. One small simplification may be that max_so_far can be initialized to zero, rather than a[0]. Another advantage of making that change is that if the array is zero-length (size==0) you won't be accessing invalid memory.

[@michaele5757]

you can handle an empty array with a base case that checks for an empty array and simply returns (i.e. if (arr.length === 0) return). If you initialize max_so_far to 0, a test case of [-2] (or any negative number) will fail. I used [-2] as an example because that's the test case I failed on Leetcode lol

[@princekumarmaurya1763]

Best vedio I have ever seen for this solution 👍👍👍👍👍👍

[@christmas_fox-marychristma2801]

Thank you so much for posting this videos! You have such clear explanations!

[@AbhishekJain-pm2jn]

Thank you sir for explaining in such a easy way 🙏

[@b.saisrinivas1636]

Best explanation that i have seen for this algo

[@chetanshrivastava3762]

Nice explanation sir...You have great patience which is must for a programmer. Regarding this example,we can take a lesser size array to save time.

[@nikhilbhatt9823]

I think for efficient subarray it should be **if(max_ending_here

[@meherkhan933]

You are great Sir! You make so simple with your extraordinary explanation! Thank you very much!!!

[@Piggybacking]

Thank you so much ! your explanation is so helpful.

[@Dragondavid]

What if all elements are negative value? How do you dandle max_ending_here < 0 ? How would you track indices?

[@komuravellyvenky]

Above algorithm will not work if all the elements are negative. Please refer : www.techiedelight.com/maximum-subarray-problem-kadanes-algorithm/

[@tejeswarsahu2498]

This info is very helpful...

[@edwardcerverizzo7363]

Solution is trivial. Return an empty array. Sum of all elements is zero (since there are no elements). 0 is strictly greater than any combination of negative numbers. You could create a subroutine to scan the array and return this result if this is the case. Total running time should be O(2n) which is still O(n).

[@jogeswararaonynala1591]

Then just take the element with with highest value in all negative numbers

[@sharidass1408]

@@komuravellyvenky this code also fails if array is [-1]

[@rhimanshu6288]

You made things understand easier

[@PramodKumar-rc9zy]

Nice explain sir before watching this video i was confused that what the meaning of this algo but now cleared thanks a lot sir

[@LarryRuane]

One more observation ... What if the array consists entirely of negative values? This algorithm will report start and end both zero, which is a subarray of length 1. It seems like it may be better, in general, for the result to be reported as a start index and a length (rather than end index). Then the correct answer in this case (all elements negative) is start = zero (or really anything), length = zero. I implemented this here: codepad.org/irM2hs1b

[@Mohitsingh-mk8vr]

best explanation of kadane algo

[@sanketkumar1576]

best explanation among all videos on this topic on youtube. thank you !

[@vivekanandkhyade]

Thanks Sanket..!

[@Dyslexic_Neuron]

your understanding of the problem is Bad..... The way I see the problem is 3 cases : Life Hope and Death. We'll take 2 sum variables' : prev_sum and current_sum. Life is when we encounter only positive number: we will update prev_sum in this case Hope is when we encountered a negative number but that negative number has not made my current sum less than zero so there is still hope that some next number may repair the damage done by the negative number. : we will update prev_sum when current_sum > prev_sum Death is when the current sum becomes negative .....so now in this case we have re-initialize the starting point for calculating current sum Below is my smart : : code public static int findLargestSum(int a[]) { int end = 0; int current_sum = 0; int prev_sum = 0; while (end < a.length) { current_sum += a[end]; if (current_sum < 0) { // death case current_sum = 0; } if (current_sum > prev_sum) { prev_sum = current_sum; } end++; } return prev_sum;

[@manojbgm]

Nice Video. Well structured. Liked the way you simplified the solution in 2 parts. 1) find the max sum 2) look for index Nice work thank you.....

[@vivekanandkhyade]

Thanks Manoj..!

[@rahul-patil]

The second if condition is the core of this algo.

[@prudhviprasad6386]

Thnks sir it was very detailed explanation

[@anindita2816]

Very good explanation. You're that favorite teacher kind of person! :)

[@koreancaptain2955]

han rat lo ise

[@bharatprakashparakh9601]

kzbin.info/www/bejne/o6DXfnt_jbKgsM0

[@naveensharma5060]

finally i got the video by which i have understood this concept very easily.

[@sailkargutkar1980]

Best way to explain max sub array prob thanks

[@mani8110]

thank you best explanation❤❤

[@brijbhushanawasthi7679]

Set the speed to 1.5, Thank me later:)

[@RahulGuptarrg]

Thank u bro :)

[@shobitshobit]

Thank u bro :)

[@LV-ei1ce]

Lol ! Thank you bro :)

[@stndwlf5862]

Thank U Bro :)

[@Rahulsingh-bu6jh]

i suggest 2.0x

[@dorararo]

can we print the largest sub-array that was found , using Kadane algo?..we can get the end point of that sub-array but how do we get its starting point.

[@rajporu9]

Vivek, the way you explain is crystal clear by giving examples. Keep up the good work. God Bless.

[@Ankit13555]

you are simple and great....plzz provide some good and tuff DP problems ...:)

[@tapanjeetroy8266]

Thanks a lot lot sir..you explain us so well

[@harshtulsyan9894]

Nice Explanation sir... Please upload more videos on Dynamic Programming..!!

[@SmartProgramming]

awesome explanation sir, very very helpful, thanks a lot for this tutorial 👍👍👍👍🙂🙂🙂🙂

[@ravikishoretottaramudi1263]

Very good explanation sir

[@shivam_0002]

Great Explanation, make some more videos. Thanks

[@somesbhowmick2082]

Great , Great simply you explain I understand, keep doing it , I want learn more algorithm topic probmel

[@prakashkumaran9767]

Good work. Easy to learn. Thank you..

[@rushi901]

Any idea about how to convert the finding the start index and end index into 2 D array ?

[@edwardcerverizzo7363]

I've seen this problem posted as a dynamic programming problem on Leetcode. I like this way better though. Is there any argument to do DP over this way?

[@shobhitmittal77]

Hi Vivekanan sirji, you are doing a great job.. I have watched some of your other videos too and must say they are simply awesome and to the point.. It will be even better if you could organize your uploaded videos into a playlist, it will direct the users to your other videos.... just a suggestion :)

[@srinidhiii]

well said.it ll be great if a playlist is created topicwise.Your tutorial is awesome sir

[@vivekanandkhyade]

Yes shobhit i will make it...! Thanks ....!

[@vivekanandkhyade]

Yes srinidhi ...will make it..!

[@abhishekbisherwal6856]

NO need to check whether the sum is less than zero or not else do check whether calculated sum is greater than added element or not ? and rest will be same .

[@karthikd7460]

After seeing this video, I feel your one of the LC problems god!!!

[@swapnil814]

Thank you. You made tough problem, easy. :)

[@dharnisingh11]

What if we do not have any negative number present in the array?

[@ASHISHSINGH-nj6es]

Algorithm tracing != Explaining

[@TanujMishra077]

Great work Sir. Nice explanation.

[@vivekanandkhyade]

Thanks Tanuj.

[@beholdpain]

Nice, Very Detailed!

[@tirnasircar2938]

What will happen if there are no negative numbers in the array?

[@sagarsalunkhe6429]

Thanks for explanation very well done

[@vivekanandkhyade]

Thanks Sagar Bhau...!

[@MyLifeMyWorld08]

Hello Sir, Can you please post video for solution of "maximum/minimum element from each sub-array of size 'k'" in O(n) ? Thanks in advance.

[@aryangarg9072]

Good explanation

[@ghughal]

Will this algorithm work for an input array {5, -2, -1, 3, -4}. Just a second set of eyes to verify we get the result as maximum length of the subarray is 4. Please help!

[@niharikaepuri3305]

Can you please make a video on Largest subarray with equal number of 0s and 1s with O(N) time complexity and also please make a video on Maximum Product Subarray?

[@jakusam4564]

sir thank you very much.i am from bangladesh.

[@yunuskocatas3879]

why we equalise the max ending here to zero on second if

[@rajatmishra3572]

nice explanation!!

[@hirakmondal6174]

faulty explanation.. will fail for sample case like [-2 5 -1] where the output of the maxsum with his logic is 3 but it should be 5 actually. *max_so_far* at the starting should be the maximum element of the array.

[@manishgurawalia7625]

No it will not fail here, will give 5 as the the max sum

[@YogeshKumar-ye8nd]

if I will take only all elements negative except first then this code will not give the index of maximum subarray you can check it

[@shankysays]

If my array is -5 -4 -3-1 -2 will this algo work?

[@anshubansal2008]

Great Explanation.

[@shivamvyas8899]

Hello sir, can u make a video on Z algorithm for String search.

[@baibhavghimire3827]

Nice one..Yes need to do like 1.5x or 2x..lol...But great presentation!!

[@arbindsharma1423]

sir how to approach the algo please teach that not as ratta mar study

[@DurgaShiva7574]

will this algo works if we have the max sum in -ve itself....i.e if all the elements of the array are -ve, then what to do ?

[@yashwanthjonnagaddala9944]

No this works for everything

[@mohit0001ish]

Very Well Explained :)

[@mordiabukarat3985]

very helpful , thank you

[@Hampirathna]

Sir plz explain dijkstras algorithm with snippet like this sir

[@DhananjayTyagi24]

Explained well!

[@alokkumarsingh4118]

Sir will the algorithm work if the maximum sum is negative?

[@saurabhsharma8577]

Nice Work, Thank you Sir

[@bihanbanerjee]

thank you

[@shimpyasthana5561]

Great work

[@saswatibhattacharjee7387]

Is Kadane's Algorithm applicable if all the element in the array are positive integer? I have an array like {4,2,1,10,3,5} when I am using this algorithm it return 25 as sum and all the elements . I cannot find any sub array. If I add 10+3+5=18 ,get 18 which is the largest sum in this array also {10,3,5} represent a sub array. For this problem what type of algorithm applicable? Your explanation is very clear and easily understandable. Thank you.

[@sauravbhagat4737]

If array contains all positive numbers, then sum of all elements will be maximum. So the sub array will be the whole array.

[@sivas8620]

Please do a video Tutorial on Flatten a Linkedlist, Union of 2 Linkedlist

[@vivekanandkhyade]

Yes sure I will do it..!

[@Muthuvlog104]

Good explanatiin

[@ayonkar1534]

What if all the elements in the array is set to 0?

[@gaymonkey5270]

What if all values are negative?????

[@compeng2013]

it will return the greatest negative number. So if you have an array = [-6, -5, -20, -1], it will return -1

[@sauravbhagat4737]

@@compeng2013 No it is going to return 0, we need to modify the code little bit

[@jogeswararaonynala1591]

Just take the highest elment in the negative no

[@argharoy6571]

Sir you are awesome

[@muhammahanisuzzaman5493]

Carry On...

[@mohamedanwar6073]

please do video , print all different simple cycle in undirected graph . 🙌

[@vivekanandkhyade]

yes sure ...very soon..!

[@MrVazanth]

Hi Vivekanand, Please help me with video to print given matrix in diagonal order Thanks

[@vivekanandkhyade]

Yes i will upload the matrix video very soon..!

[@modernsanskari4398]

grt sir .But this question was asked in my interview but i was not aware of this algo.But i gave a brute force solution by using two loops O(n^2).Here in this algo it is taking linear time o(n). Can we make it to O(log n) by using divide and conquer approach?

[@santhoshcts5]

if the array is not sorted , we cannot do it in o(logn) . in other way , meaning only binary search will make time complexity of o(logn) and binary search will work only on sorted arrays .

[@Alexc99xd]

You could divide and conquer in O(nlog(n)) recursively Find max on left, max on right, and find max that crosses the midpoint

[@Sudhanshusable98]

Thank you sir 🙏

[@prateekkanujiya9775]

Awesome 👍

[@yunuskocatas3879]

perfect explenentation

[@superchillh3o]

excellent explanation, thank you sir

[@vivekanandkhyade]

Thanks Alberto..!

[@smirkedShoe]

Where was the explanation of logic in this video... He only puts value and iterate through the loops...Everyone can do that..Please explain the logic!

[@shrijanaryal4923]

The logic is that you have two variables as you go through the loop. One calculates temp_max and the other max_so_far. As soon as temp_max becomes greater than max_so_far, make max_so_far equals to temp_max. But remember temp_max may not always be greater. And also when temp_max is negative, set it to 0 because you dont want to disturb the previous max by some negative numbers. I hope it helps..

[@kapilchhipa2143]

gandu dekh kahe rha h phr

[@niranjankadu4132]

giving wrong o/p=9 for {1,2,3,-2,5} correct o/p is {1,2,3}=6

[@akash7752]

will not work for all negative no in an array

[@karanshah9310]

Longest Palindrome in a string

[@sireeshakandula1031]

Biconnecting components and dfs

[@josephmorales652]

Thanks man!