Skip to interview prep
Apexed

58. How do you solve subtract-and-conquer recurrences such as T(n) = 2T(n-1) + 1 or T(n) = T(n-1) + n?

MediumAlgorithm analysis

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 solve subtract-and-conquer recurrences such as T(n) = 2T(n-1) + 1 or T(n) = T(n-1) + n — Data structures & algorithms interview question — Apexed