Slug: heap-merge-01 · Paired reading: Chapter 20
Prompt
fn merge_k_sorted(lists: &[Vec<i32>]) -> Vec<i32> — merge k ascending
lists. Heap entries are (value, list_idx, elem_idx).
The curriculum, drills, tutor, and interviewer mode are for readers of Ace the Rust Interview. The code is printed in the Preface (Companion site access).
Don’t have the book yet? Get it on Amazon (US and other storefronts linked in the site footer) — the Preface access code unlocks this gym.
intermediate · order 120
Slug: heap-merge-01 · Paired reading: Chapter 20
fn merge_k_sorted(lists: &[Vec<i32>]) -> Vec<i32> — merge k ascending
lists. Heap entries are (value, list_idx, elem_idx).