Code to find Maximum sum of SubArray

[Suchit1938]

Given an integer array nums, find the
SubArray(A subarray is a contiguous non-empty sequence of elements within an array)
with the largest sum, and return its sum.

Brute Froce code Time Complexity:- O(n2)
Kedan's Algorithm Time Complexity :- O(n)

[Suchit1938]

Plz, assign the issue to me. As, i eager to contribute under hacktoberfest and also add hacktoberfest tag