Problem

On a Meta Reels analytics stream, each integer in nums represents the gain or loss in engagement for a consecutive time window. Find the contiguous subarray with the largest possible sum and return that sum.

Formal Specification

• Input: A non-empty list of integers nums
• Output: An integer representing the maximum sum of any contiguous subarray in nums

You must solve this in linear time.

Examples

Example 1

• Input: nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]
• Output: 6
• Explanation: The subarray [4, -1, 2, 1] has sum 6, which is the largest possible.

Example 2

• Input: nums = [1]
• Output: 1
• Explanation: The only subarray is [1].

Example 3

• Input: nums = [5, 4, -1, 7, 8]
• Output: 23
• Explanation: The full array has the maximum sum: 5 + 4 - 1 + 7 + 8 = 23.

Constraints

• 1 <= len(nums) <= 10^5
• -10^4 <= nums[i] <= 10^4
• nums contains at least one element