DS — merge two sorted arrays #16

Medium 30 pts New · no attempts yet csharp

Topics

Toolliyo edge

Merge [1,3,5] and [2,4,6]; print merged.

Static hints

Compare a[i] and b[j]

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;

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

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

Explanation

Two-pointer merge — merge sort building block.

Prev Next All problems

DS — merge two sorted arrays #16

Stuck? Get a nudge — not the answer

Your solution

Official solution

Explanation

Your submissions

Discussion