Maximum Subarray - LeetCode 53 - Python

[sufainanasrin]

Nice algorithm, hats off to the creator

[goalshub]

Code for golang follow with O(n)
func maxSubArray(nums []int) int {
maxSum, currSum := nums[0], 0

for _, num := range nums{
if currSum < 0{
currSum = 0
}
currSum += num

maxSum = max(maxSum, currSum)
}
return maxSum
}

func max(a, b int)int{
if a > b {
return a
}
return b
}

thanks for the videos

[najujusi]

Sound kurch koode koottaan try cheyytto

[amalshaheencreations]

aa oru observation aan key alle 🤯. 2 days ee Questionl irnn.