Skip to interview prep
Apexed

336. Merging two sorted files of sizes a and b costs a + b. Given n file sizes, how do you merge them all into one file at minimum total cost?

MediumGreedy algorithms

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Merging two sorted files of sizes a and b costs a + b. Given n file sizes, how do you merge them all into one file at minimum total cost — Data structures & alg