Maximum subarray sum ([3, 7, 11, 15, 19])

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