Challenge: Maximum Sum Subarray
Given an array, find the contiguous subarray with the largest sum.
Maximum subarray sum: An overview
Given an unsorted array , the maximum sum sub array is the sub array (contiguous elements) from for which the sum of the elements is maximum. In this challenge, we want to find the sum of the maximum sum sub array. This problem is a tricky one because the array might have negative integers in any position, so we have to cater to those negative integers while choosing the continuous subarray with the largest positive values.
Here is an example:
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.