Maximum Subarray Sum (Kadane's)

Given an integer array `nums`, find the contiguous subarray (containing at least one number) which has the largest sum and print its sum. ### Constraints - `1 <= nums.length <= 10^5` - `-10^4 <= nums[i] <= 10^4` ### Input Format A single line containing space-separated integers representing the array `nums`. ### Output Format Print a single integer representing the maximum subarray sum.