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:
  1. 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.
  2. max_subarray([-1,-2,-3,-4]) should return -1 because the maximum sum subarray is [-1].
  3. max_subarray([5,-1,6,-2,7]) should return 15 because the maximum sum subarray is [5, -1, 6, -2, 7].
  4. max_subarray([-2, 1, -3, 4, -1, 2, 1, -5, 4]) should return 6 because the maximum sum subarray is [4, -1, 2, 1].
  5. max_subarray([-2, -5, 6, -2, -3, 1, 5, -6]) should return 7 because the maximum sum subarray is [6, -2, -3, 1, 5].
Solve

Solution Stats

88.89% Correct | 11.11% Incorrect
Last Solution submitted on Jul 22, 2024

Solution Comments

Show comments

Problem Recent Solvers7

Suggested Problems

More from this Author53

Problem Tags

easy kadane

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!