Given an integer array nums, find the subarray with the largest sum and return its sum. (Kadane's Algorithm)
Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6
Input: nums = [1] Output: 1
Input: nums = [5,4,-1,7,8] Output: 23
Jnaneshwara Reddy Satti
Builder · ClearCode
Hi — I'm a 21yo CS grad from India. I built ClearCode while recovering from a surgery, because I genuinely believe DSA should be visual, free, and accessible to everyone. No VC funding. No team. Just me, my laptop, and a lot of chai. ☕
If ClearCode helped you understand even one concept — consider supporting it. Every rupee keeps the servers running and new videos coming.