Maximum Subarray Sum
Find the maximum subarray sum in an integer array.
Input: nums = [-3,-4,-1,-2]
Output: -1
Explanation: Kadane's algorithm correctly identifies that the single isolated element -1 provides the highest possible sum.

Question

Find the maximum subarray sum in an integer array.

Input: nums = [-3,-4,-1,-2]

Output: -1

Explanation: Kadane's algorithm correctly identifies that the single isolated element -1 provides the highest possible sum.