Maximum Subarray

Given an integer array `nums`, return the largest sum of any contiguous subarray (at least one element). Use Kadane’s algorithm for O(n). Example: [-2, 1, -3, 4, -1, 2, 1, -5, 4] → 6 (the subarray [4, -1, 2, 1]).