LeetCode — Maximum Subarray

Problem statement Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Problem statement taken from: https://leetcode.com/problems/maximum-subarray Example 1: Input: ...