Maximum Subarray

DSA Solving and practicing

Posted by Hitesh Kumar on June 22, 2022
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
func maxSubArray(nums []int) int {

    currSum := 0
    maxSum := -99999
    
    for idx, _ := range nums {
        currSum += nums[idx]
        if currSum >= maxSum {
            maxSum = currSum
        } 
        if currSum < 0 {
            currSum = 0
        }
    }
    
    return maxSum
    
}

Screenshot-2022-06-23-at-20-25-10-Maximum-Subarray-Leet-Code.png