Challenge: Maximum Sublist

Try to solve the Maximum Sublist problem.

We'll cover the following

Statement

Given an unsorted list nums, find the sum of the maximum sum sublist. The maximum sum sublist is a list of contiguous elements in nums for which the sum of the elements is maximum.

Constraints:

  • 1≤1 \leq nums.length ≤103\leq 10^3

  • −104≤-10^4 \leq nums[i] ≤104\leq 10^4

Examples

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.