Problem Set
#11
Maximum Subarray
MediumAcceptance: 51.8%•ArrayDivide and ConquerDynamic Programming•AmazonMicrosoftAppleGoogleMetaBloombergCiscoAdobeTCS DigitalInfosys DSEWipro Turbo
Problem Statement
Given an integer array nums, find the subarray with the largest sum, and return its sum.
Examples
Example 1
Input:
nums = [-2,1,-3,4,-1,2,1,-5,4]Output:
6Explanation:
The subarray [4,-1,2,1] has the largest sum 6.
Example 2
Input:
nums = [1]Output:
1Explanation:
The subarray [1] has the largest sum 1.
Example 3
Input:
nums = [5,4,-1,7,8]Output:
23Explanation:
The subarray [5,4,-1,7,8] has the largest sum 23.
Constraints
1 <= nums.length <= 10^5-10^4 <= nums[i] <= 10^4
Hints
1
2
3
4
5
6
7
8
9
10
Input (nums array):