Maximum Subarray

Try to solve the Maximum Subarray problem.


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.


  • 11 \leq nums.length 103\leq 10^3

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


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