LESSON 234 OF 348 · TWO POINTERS

Merge two sorted arrays in Rust

Practice O(n + m)

Given two sorted arrays of integers, merge them into one sorted array containing all numbers

Example:

Input: first =[1, 4, 8],
       second = [1, 3, 4, 17]

Output: [1, 1, 3, 4, 4, 8, 17]

Note:

Your algorithm should run in O(n + m) time and use O(n + m) extra space.

STEP 1 OF 10

Guided

Ctrl + Enter to check

Keep going with RustAbout 340 step-by-step lessons, from your first line of code to coding interviews. Free to start.

Merge Sorted Arrays in Rust