Largest Sum Contiguous Subarray | Love Babbar DSA Sheet Q8 | Arrays | (Leetcode 53)

[@thegadgetfusion1138]

thankyou so so much bhaiya

[@ankurrawat5156]

Dude seriously! This is the best explanation I've seen for this question. Keep up the good work!

[@saptarshichattopadhyay8234]

Thank you so much sir...

[@vishalbalani1068]

The best explanation and video I have seen for Leetcode examples. Thanks a lot!!

[@sudiptaranjan7405]

you are awesome bro...Keep it Up... Love you man...🥰

[@Premkumar-zk7lb]

mast approach tha bhai. thanks for this video 🙏

[@meetshujah]

love from pk

[@abhijitbiradar]

great video

[@snehajoywal17]

I do not skip the ads for support u more and more and shares your videos to all my friends...one day I'll contribute u something... Just keep it up and hats off ☺️

[@CodingWithPrakash_]

Krdo skip ads Focus on studies I will add more content

[@shasvatjain1579]

I did the same😊

[@CodingWithPrakash_]

✅ Useful Links 𝐂𝐨𝐮𝐫𝐬𝐞𝐬 - www.codingwithprakash.com/learn 𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦 - instagram.com/codingwithprakash/ 𝐖𝐡𝐚𝐭𝐬𝐀𝐩𝐩𝐂𝐡𝐚𝐧𝐧𝐞𝐥 - whatsapp.com/channel/0029VaACtTa4tRrpDCQc5f44 𝐋𝐢𝐧𝐤𝐞𝐝𝐢𝐧 - www.linkedin.com/in/prakash-shukla/

[@AkashSharmaSDE]

nice way to explain

[@CodingWithPrakash_]

Thanks for liking

[@shasvatjain1579]

You are awesome!

[@AvinashKumar-ps4tw]

You are really doing nice work

[@CodingWithPrakash_]

Thanks

[@abhishekranjan1094]

Thank you so much sir... you are great ❤️

[@abhishekranjan1094]

sir aap jab video upload kijiyega to please aise hi pahle bata dijiyega ki ye question kon kon sa company me pucha gaya aise me beginners ko kafi motivation milta hai..🙏

[@NextInterviewPrep]

great

[@sahebullah2194]

Man you are so underrated ! I will be the best if you would solve the whole dsa sheet Humble request please Even if you upload 2 videos a week or even provide a paid course But do it asap 🔥

[@CodingWithPrakash_]

I will try!

[@omkarsawant9267]

Summary: Using C language for Writing Code Current Max gets updated value if sum total of initial Current max add with apporaching value of array is greater than current max initial value. So after that Max sum value get updated. # include int kadanesAlgorithm(int arr[], int n){ int maxSum= arr[0]; // Encounters Max Sum encountered so far int CurrentMax=arr[0]; // Show max subarray's Sum for (int i=1;i arr[i])? CurrentMax + arr[i] : arr[i]; maxSum = (CurrentMax > maxSum) ? CurrentMax : maxSum; } return maxSum; } int main(){ int arr[] = {-2,-3,4,-1,-2,1,5,-3}; int n = sizeof(arr)/sizeof(arr[0]); int maxSum = kadanesAlgorithm(arr, n); printf("Largest Sum of Contiguos Subarray:%d ", maxSum); return 0; } Time complexity is O(n) because where n is the number of elements in the array. This is because it only requires a single pass through the array. Space Complexity is O(1) as no extra space required to store value as values are incrementing and getting assigned.