Kadane's Algorithm

Approach Explanation (ﾉ◕ヮ◕)ﾉ*:･ﾟ✧ I started with the first element as both current_sum and max_sum. I checked each element: either add it to the current_sum or start fresh from it. I updated the max_sum whenever the current_sum became larger. I continued until the end of the array. The result was the largest possible subarray sum. Method Used: (〜￣▽￣)〜 Dynamic tracking Max comparison Single traversal No extra space