- The task of finding a contiguous subarray with the largest sum, within a given one-dimensional array
*A[1…n]*of numbers. It can be solved in*O(n)*time and*O(1)*space. For example, for the array of values*[−2, 1, −3, 4, −1, 2, 1, −5, 4]*, the contiguous subarray with the largest sum is*[4, −1, 2, 1]*, with sum 6. ← Wikipedia

- Previous term: Maximum segment sum problem
- Next term: McCabe score
- Random term: Zero-based indexing