> For the complete documentation index, see [llms.txt](https://programming.arora-aditya.com/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://programming.arora-aditya.com/leetcode/divide-and-conquer/53.-maximum-subarray.md).

# 53. Maximum Subarray

### Approach 1: Store the sums up to index