Maximum subarray sum (Kadane) #2

Medium 30 pts New · no attempts yet csharp

Topics

Toolliyo edge

Find max contiguous subarray sum for array with values 1..6 and one negative.

Static hints

cur = max(a[k], cur + a[k])

Toolliyo Coach

Stuck? Get a nudge — not the answer

Progressive help: Nudge → Guide → Approach. Full solution stays behind the Solution tab.

Your solution

Editor is open — no login wall to practice.

Ready — edit the code above and click Run or Submit.

Official solution

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static void Main()
    {
        int[] a = { 1, 2, 3, 4, 5, 6, -6 };
        int best = a[0], cur = a[0];
        for (int k = 1; k < a.Length; k++) {
            cur = Math.Max(a[k], cur + a[k]);
            best = Math.Max(best, cur);
        }
        Console.WriteLine(best);
    }
}

Prefer Coach (Nudge → Guide → Approach) before revealing. No forced signup.

Explanation

Kadane's algorithm for max subarray.

Prev Next All problems

Maximum subarray sum (Kadane) #2

Stuck? Get a nudge — not the answer

Your solution

Official solution

Explanation

Your submissions

Discussion