Challenge: Maximum Sum Sublist
Given an array, find the contiguous sublist with the largest sum.
Maximum sublist sum: An overview
Given an unsorted list , the maximum sum sub list is the sub list (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 list. This problem is a tricky one because the list might have negative integers in any position, so we have to cater to those negative integers while choosing the continuous sublist with the largest positive values.
Here is an example:
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.