From 667bc0696504c8a7c0cce9e5382f79d70b04a44b Mon Sep 17 00:00:00 2001 From: Prad Nukala Date: Tue, 29 Sep 2026 13:22:24 -0400 Subject: [PATCH] docs(docs): add O(n) Kadane implementation for Maximum Subarray solution --- .../(05-decision-space)/greedy/53-maximum-subarray.mdx | 10 ++++++++++ 1 file changed, 10 insertions(+) diff --git a/apps/docs/content/(05-decision-space)/greedy/53-maximum-subarray.mdx b/apps/docs/content/(05-decision-space)/greedy/53-maximum-subarray.mdx index cb6649a..098bc44 100644 --- a/apps/docs/content/(05-decision-space)/greedy/53-maximum-subarray.mdx +++ b/apps/docs/content/(05-decision-space)/greedy/53-maximum-subarray.mdx @@ -40,4 +40,14 @@ If you have figured out the O(n) solution, try coding another solution using the ```py class Solution: def maxSubArray(self, nums: list[int]) -> int: + best, total = nums[0], nums[0] + + for i in range(1, len(nums)): + if total < 0: + total = nums[i] + else: + total = total + nums[i] + best = max(best, total) + + return best ```