Challenge: Maximum Subarray
Try to solve the Maximum Subarray problem.
We'll cover the following
Statement
Given an unsorted array nums
, find the sum of the maximum sum subarray. The maximum sum subarray is an array of contiguous elements in nums
for which the sum of the elements is maximum.
Constraints:
nums.length
nums[i]
Examples
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Educative's Terms of Service and Privacy Policy