Maximum subarray sum ([1, 4, 9, 16, 25, 36])

Print the largest sum of any contiguous run in [1, -2, 3, 4, -1] (Kadane's algorithm).

Part of CodeAscent Premium

Your first 10 lessons are free. Unlock every beginner, intermediate, and advanced lesson — and keep your streak going — with a subscription. Start with a 7-day free trial.

$4.99/month or $39.99/year after trial. Cancel anytime.