Maximum subarray sum ([10, 20, 30, 40, 50])

Print the largest sum of any contiguous run in [-1, -2, -3, 4, 5] (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.