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
Nesta página do site você pode assistir ao vídeo on-line Kadane's Algorithm - Maximum Subarray (Dynamic Programming) duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário AlgosWithMichael 21 Abril 2021, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 31,554 vezes e gostou 892 espectadores. Boa visualização!
