[Data Structures] Maximum Subarray Kadanes

Question

Problem Statement for Maximum Subarray Kadanes under Data Structures:

Given an integer array nums, find the subarray with the largest sum and return its sum.

Input Constraints:
- 1 <= len(nums) <= 10^5
- Elements fit in memory standard spaces.

Accepted Answer

```
def maxSubArray(nums):
    max_sum = nums[0]
    curr_sum = nums[0]
    for num in nums[1:]:
        curr_sum = max(num, curr_sum + num)
        max_sum = max(max_sum, curr_sum)
    return max_sum
```

[Data Structures] Maximum Subarray Kadanes

Problem Statement

Proposed Solution

Your Progress

Save Progress?