Maximum Subarray

Try to solve the Maximum Subarray problem.

We'll cover the following

Statement

Given an integer array, nums, find the contiguous subarray that has the largest sum and return its sum.

Note: A subarray is a contiguous part of an array that contains at least one number.

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 80+ hands-on prep courses.