Problem Overview & Intuition

By maintaining start and end pointers alongside the Kadane accumulation, whenever a new maximum sum is discovered, we update the boundary range [ansStart, ansEnd]. At the end, we slice and return the subarray.

Step-by-Step Approach

1. Track maxSum = -Infinity, currentSum = 0, start = 0, ansStart = 0, ansEnd = 0.
2. For each index i:
3. If currentSum === 0, mark start = i.
4. Add nums[i] to currentSum.
5. If currentSum > maxSum, update maxSum = currentSum, ansStart = start, ansEnd = i.
6. If currentSum < 0, reset currentSum = 0.
7. Return nums.slice(ansStart, ansEnd + 1).

Optimal Implementation (JavaScript)

function maxSubarrayElements(nums) {
  let maxSum = -Infinity;
  let currentSum = 0;
  let start = 0, ansStart = 0, ansEnd = 0;

  for (let i = 0; i < nums.length; i++) {
    if (currentSum === 0) start = i;
    currentSum += nums[i];

    if (currentSum > maxSum) {
      maxSum = currentSum;
      ansStart = start;
      ansEnd = i;
    }

    if (currentSum < 0) {
      currentSum = 0;
    }
  }

  return nums.slice(ansStart, ansEnd + 1);
}

Complexity Analysis