Kadane's Algorithm - Maximum Subarray (Dynamic Programming)
Maximum subarray is a popular LeetCode interview questions asked at Microsoft, Amazon, Apple, LinkedIn, ByteDance, Google, Adobe, and several other top tech companies. This problem is solved in the most efficient way using dynamic programming with an algorithm known as Kadane's algorithm.
Kadane's algorithm finds a contiguous subarray with the largest sum in linear time. Using this algorithm, as we iterate through our array, we compute the max subarray at each step using the following recurrence relation; current is equal to the max between the current and the current plus the previous. Since we overwrite the formula values with the array we are given, the algorithm provides a constant space complexity in addition to the linear time complexity.
Check out my interview prep platform for learning the patterns!
📢 Interview Prep Platform: https://algoswithmichael.com
🔗 Social 🔗
🎧 Join the community Discord: / discord
💰 Support me on Patreon: / michaelmuinos
🔗Follow me on LinkedIn: / michael-muinos
📂Follow me on Github: https://github.com/MichaelMuinos
Sur cette page du site, vous pouvez voir la vidéo en ligne Kadane's Algorithm - Maximum Subarray (Dynamic Programming) durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur AlgosWithMichael 21 avril 2021, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 31,554 fois et il a aimé 892 téléspectateurs. Bon visionnage!
