Categorygithub.com/Elven9/my-leetcodeProblems53
package
0.0.0-20241209140624-9fce2a725d55
Repository: https://github.com/elven9/my-leetcode.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

Maximum Subarray

Solution IdxTime ComplexitySpace ComplexityComment
1O(n)O(n)DP
2O(n)O(1)DP

DP

  • Prefix Sum
  • Stack to find previous min element ( pop non-viable solution )
  • End at index i subarray to consider all solution