midRecursion

Find the N-th Fibonacci number using recursion vs memoization.

Updated Apr 28, 2026

Short answer

Comparing naive exponential recursion with efficient O(n) top-down DP.

Deep explanation

Intermediate recursion focuses on optimization and advanced patterns like backtracking. Comparing naive exponential recursion with efficient O(n) top-down DP.

Real-world example

File system crawlers (scanning directories and sub-directories).

Common mistakes

  • Thinking all recursion is tail-recursive
  • the result must not depend on local calculations after the call.

Follow-up questions

  • Does Python support TCO?

More Recursion interview questions

View all →