Cascadiq
← Problems

Maximum Subarray

algorithm · Level 2 · 20 min

Description

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

Requirements

  • Implement a function that takes nums (array of integers).
  • Return the maximum sum of any non-empty subarray.

Constraints

- `1 <= nums.length <= 10^5` - `-10^4 <= nums[i] <= 10^4`

Deliverables

Return the maximum subarray sum.

Tags

ArrayDynamic Programming