Skip to interview prep
Apexed

346. How do you write and solve the recurrence for an algorithm that splits a problem into a subproblems of size n/b and does f(n) extra work?

MediumDivide & conquer

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.

How do you write and solve the recurrence for an algorithm that splits a problem into a subproblems of size n/b and does f(n) extra work — Data structures & alg