Subaaray / Subsequence problems

Maximum Subarray

tip

7 Simple Solutions w/ Explanation | Brute-Force + DP + Kadane + Divide & Conquer

Brute Force

Time Complexity : O(N^2), where N is the number of elements in nums. There are N*(N+1)/2 total sub-arrays and trying out each one takes time of O(N2) Space Complexity : O(1)

Recursion

DP - Memoization

TO LEARN

DP - Tabulation

TO LEARN

Divide & Conquer

TO LEARN

Also see: https://leetcode.com/problems/maximum-subarray/discuss/992466/Functional-ish-Python