Neetcode – Advanced Algorithms
English | Tutorial | Size: 1.19 GB
Kadane’s algorithm is a greedy/dynamic programming algorithm that can be used on array problems to bring the time complexity down to O(n)O(n). It is used to calculate the maximum sum subarray ending at a particular position.