Merge two sorted arrays

Hard 40 pts New · no attempts yet csharp

Topics

Toolliyo edge

Merge {1,3,5} and {2,4,6} into sorted output.

Static hints

Compare a[i] and b[j], append smaller, advance pointer.

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;

class Program
{
    static void Main()
    {
        int[] a = { 1, 3, 5 }, b = { 2, 4, 6 };
        var result = new List<int>();
        int i = 0, j = 0;
        while (i < a.Length && j < b.Length)
            result.Add(a[i] <= b[j] ? a[i++] : b[j++]);
        while (i < a.Length) result.Add(a[i++]);
        while (j < b.Length) result.Add(b[j++]);
        Console.WriteLine(string.Join(", ", result));
    }
}

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

Explanation

Two-pointer merge—building block of merge sort; often asked in .NET interviews.

Prev Next All problems

Merge two sorted arrays

Stuck? Get a nudge — not the answer

Your solution

Official solution

Explanation

Your submissions

Discussion