Maximum Subarray

Given an integer array, find the contiguous subarray (containing at least one element) with the largest sum and print that sum.

1 <= n <= 10^5 -10^4 <= nums[i] <= 10^4