Kadane's Algorithm - DSA with Javascript | Maximum Subarray Sum | Frontend DSA Interview Questions

[@RoadsideCoder]

➡ Download my DSA with JS E-Book - topmate.io/roadsidecoder/491565 ✅ Follow me on Instagram to be updated about next videos - instagram.com/roadsidecoder/ If this video gets good response, I will make more DSA videos, so do share it with others 🔥

[@DhruvSharma3]

This is one of the most simplified and intuitive explanation for kadane's algorithm and logic behind the working of SUBARRAY SUM in general. Kudos !!! ///////////////////////////////////////////////////////////////////// ///// Cleanest way to return subarray as well ///// ///////////////////////////////////////////////////////////////////// const array = [0,0,0,0,0,1,40,-40,200]; (function (array) { let sum = 0, maxSum = 0, start = 0, tempStart = 0, end = 0; array.forEach((element, index) => { sum += element; if (sum > maxSum) { maxSum = sum; start = tempStart; end = index; } if (sum < 0) { sum = 0; tempStart = index + 1; } }); console.log({"Max Sum": maxSum, "Subarray": array.slice(start, end + 1)}); })(array); Happy coding floks !!

[@DamnSerious12]

I submitted this solution, and it beats 100% in time complexity. You are way good bro.

[@PriyaNayak-xo9yg]

Sir please keep it in you tube there is few teachers who teach DSA in javascript in advance level you going very well explaination technique is fabulous sir 👏

[@eleah2665]

Very good. The word "contiguous" works here also.

[@jayeshcholker]

Awesome man valuable content 💯❤

[@prashanthgv86]

Only by your video, I was able to understand the question or this algorithm.. You explain things so well on all your videos! Amazing you guys are.

[@RoadsideCoder]

Awesome, thank you!

[@kaushikmondal3873]

function maxSubArraySum(arr) { // Edge case: If array is empty if (arr.length === 0) return 0; // Initialize variables let maxEndingHere = arr[0]; let maxSoFar = arr[0]; // Iterate through the array starting from index 1 for (let i = 1; i < arr.length; i++) { // Extend the current subarray or start a new one maxEndingHere = Math.max(arr[i], maxEndingHere + arr[i]); // Update the global maximum maxSoFar = Math.max(maxSoFar, maxEndingHere); } return maxSoFar; } let arr = [-2, 1, -3, 4, -1, 2, 1, -5, 4]; console.log(maxSubArraySum(arr)); // Output: 6

[@crazyvaleideas]

Amazing explanation, I never thought Kadane's algorithm was that easy. 😂

[@BharathKumar-iq7ku]

Thanks piyush keep up your good work.. Love from netherland❤

[@PG-418]

Thankyou soo much for your superb explanation @RoadsideCoder👌❤.. Please check below code and correct me if it is wrong.. Get subarray with the help of Kadane's Algorithm: - function getMaxSubArray(nums: number[]) { let maxSum = nums[0]; let sum = 0, min = 0, max = 0, currMin = 0; for (let i = 0; i < nums.length; i++) { sum += nums[i]; if (sum > maxSum) { maxSum = sum; max = i; min = currMin; } if (sum < 0) { sum = 0; currMin = i + 1; } } return { subArray: nums.slice(min, max + 1), maxSum }; }

[@vinothmohan4247]

awesome bro

[@devlopersessential4349]

Super Duper Video👌👌👌👌

[@fallen_turbo]

I loved the explaination of kidney algorithm by algo agarwal

[@RoadsideCoder]

😂

[@snehil3209]

Hey piyush plz also cover the leetcode 30 day js challenge. Live your work bro❤

[@motivationalmusic3721]

Helpful please complete the series

[@rahuls22]

This is so good!

[@A9kit.k]

Please continue this DSA course :)

[@surajburman7543]

awesome,need more videos on dsa in js

[@RoadsideCoder]

I have made a complete playlist

[@surajburman7543]

@@RoadsideCoder thankyou

[@isha25tripathi12]

one question so incase of bruteforce you explained how to get the sub array ,could you please explain how can we get that with the second solution as well?

[@victoriakelz2602]

I co-ask

[@DjGaming-iy8ml]

Please continue this DSA course

[@davidhusted817]

But the issue with this algorithm will be applicable just when we have a positiv number if all numbers less than 0, the sum doesn't updated and return at the end 0 not logique answer

[@socialopossum6487]

It did work for me with negative numbers as well. The max is always a number from array, and the sum becomes nums[i] before you compare and reset it each round. So the final number will always be someting from the array. E.g. [-5, -4, -1, -7, -8] returns -1

[@dipanshuroutray4942]

Please make a detailed tutorial on React

[@randomsVlogs871]

Love you from Pakistan 🇵🇰❤️

[@vaibhavirakeshmore4029]

Good❤

[@syedabdullahazhar6298]

Thanks man!!!

[@shaikmahaboobjani3655]

please make more videos bro i tried from your explanation Kadane's Algorithm like this let nums = [-2,1,-3,4,-1,2,1,-5,4] let sum = nums[0]; let max = nums[0]; for (let i = 0; i < nums.length; i++) { sum=Math.max(nums[i],sum+nums[i]) max=Math.max(sum,max) } console.log (max);

[@ayushjain7023]

in for loop i could start from 1 as well

[@Darwin2412]

Hi I am following your DSA in javascript playlist and it amazing ? Just have one dought regarding Kadanes algorithm . Can we get subarray also with the help of this Kadane's Algorithm.

[@PG-418]

function getMaxSubArray(nums: number[]) { let maxSum = nums[0]; let sum = 0, min = 0, max = 0, currMin = 0; for (let i = 0; i < nums.length; i++) { sum += nums[i]; if (sum > maxSum) { maxSum = sum; max = i; min = currMin; } if (sum < 0) { sum = 0; currMin = i + 1; } } return { subArray: nums.slice(min, max + 1), maxSum }; }

[@chiragsharma4102]

What if we have all negative integers and max sum is -10 , how are we going to reject the negative sum in that case?

[@Bfhhg-bj3jy]

Just set initial value of max = 0

[@ishantkushwaha534]

The Starting 🤣🤣

[@pranjuljain6025]

If currentelement is greater than currentelement+sum than sum = currentelement Done one line code

[@RavindraSingh-lp9pl]

@roadside coder need few more help for below code. Can you please give me solution for below questions asked in React interviews- Question 1. a = [{id: 1, value: 1}, {id: 1, value: 2}, {id: 2, value: 20}, {id: 3, value: 30}] output--> {1: [{id: 1, value: 1}, {id: 1, value: 2}], 2: [{id: 2, value: 20}],3:[{id: 3, value: 30}]} Output should be : a = [{id: 1, value: 1}, {id: 1, value: 2}, {id: 2, value: 20}, {id: 3, value: 30}] output--> {1: [{id: 1, value: 1}, {id: 1, value: 2}], 2: [{id: 2, value: 20}],3:[{id: 3, value: 30}]} *************** Question 2- a = [{sum: 1}, {sum: 2}, {sum: 6}] Output should be sum of all that is 9

[@jagadeeshgade6309]

Thanks

[@prafuldeoghare1904]

you didn't explain how to return that subarray

[@bhaveshsaxena9861]

It will be great if you also start teach in Hindi

[@NageshNani_28]

can you update polyfil of all js methodes please

[@RoadsideCoder]

Already did in my JS interview Playlist

[@NageshNani_28]

Only map, filter and reduce are there we need more

[@RoadsideCoder]

Complete Playlist is there bro - kzbin.info/aero/PLKhlp2qtUcSaCVJEt4ogEFs6I41pNnMU5 Watch other videos as well

[@NageshNani_28]

@@RoadsideCoder all this videos i watched can u make single video for polyfil

[@deepakam201]

i liked the explanation. But one thing that is really annoying is when you try to explain the algorithm sometimes you insert that noise video (white and black) which is really kinda irritating. Other than that i like your content

[@RoadsideCoder]

Thats just the part of video story that I did, don't worry it was only for limited time.

[@purusharma8192]

Wow

[@s0226-n4e]

Bhai itna easy kaise krlete ho kisi bhi problem/algorithm ko solve😢

[@abhishekrajput9291]

tree and graph ...

[@vishwas55]

Bro if possible finish it quickly 😭😭 atleast different algo technique in array and strings

[@ProgrammingWithSatyamP]

Kidney 😂😂

[@MithileshKumar-c1g]

Hindi me chahiye video