Maximum Subarray
Medium
Problem Description
Given an integer array `nums`, find the subarray with the largest sum, and return its sum. A subarray is a contiguous non-empty sequence of elements within an array.
Examples
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
Input: nums = [1]
Output: 1
Explanation: The single element forms the subarray with the maximum sum.
Input: nums = [5,4,-1,7,8]
Output: 23
Explanation: The entire array [5,4,-1,7,8] has the largest sum 23.
Starter Code
def maxSubArray(nums: List[int]) -> int:
# Write your code here
passHints
- If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach.
- Think about how you would solve this problem if all numbers were positive.
- How would you handle negative numbers? Can you modify Kadane's algorithm?