Maximum subarray and subsequence using dynamic programming, divide and conquer and Kadane's algorithm. The implementation is a solution to a problem found on HackerRank: https://www.hackerrank.com/challenges/maxsubarray/problem.
mndxpnsn / max-sub Goto Github PK
View Code? Open in Web Editor NEWMaximum subarray and subsequence using dynamic programming, divide and conquer and Kadane's algorithm.