Engrain by ByteRush

DSA.02 2 concepts

Complexity and Big-O

Analyse time and space complexity of any solution.

  1. DSA.02.01Big-O, Big-Θ, Big-Ω in plain wordsCoreJuniorBeing written
  2. DSA.02.02Space complexity, recursion and amortised costCoreJuniorBeing written

Interview questions in this module

  1. What is the time complexity of your solution? Can you do better?
  2. What is amortised time complexity? Give an example.
  3. What is the complexity of Array.prototype.sort in V8?
  4. How much stack space does a recursive DFS use?
  5. Given n ≤ 10⁵, which complexities are acceptable?