Problem 60201. Find the largest sum of any contiguous subarray
Given an array of N integers, find the contiguous subarray (which must contain at least one number) with the maximum sum and return its sum.
Here are some examples:
- max_subarray([1,2,3,-2,5]) should return 9 because the sum of the subarray [1,2,3,-2,5] is 9, and the sum of any other subarray is always less.
- max_subarray([-1,-2,-3,-4]) should return -1 because the maximum sum subarray is [-1].
- max_subarray([5,-1,6,-2,7]) should return 15 because the maximum sum subarray is [5, -1, 6, -2, 7].
- max_subarray([-2, 1, -3, 4, -1, 2, 1, -5, 4]) should return 6 because the maximum sum subarray is [4, -1, 2, 1].
- max_subarray([-2, -5, 6, -2, -3, 1, 5, -6]) should return 7 because the maximum sum subarray is [6, -2, -3, 1, 5].
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers7
Suggested Problems
-
2485 Solvers
-
2954 Solvers
-
Magic is simple (for beginners)
8661 Solvers
-
Sum the 'edge' values of a matrix
335 Solvers
-
Find indices of diagonal elements
65 Solvers
More from this Author53
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!