Maximum Subarray LeetCode Explained || Maximum Sum of Contiguous Sub Array || LeetCode 53

Software Enineering Interview Question Maximum Sum Subarray. Maximum Subarray LeetCode 53.
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
++++++++++++++++++++++++++++++++++++++++++++++++++
++++++++++++++++++++++++++++++++++++++++++++++++++
#LeetCode #CSNinja