Why Dynamic Programming and When Recursion Alone Fails in DSA Typescript - Challenge Your Understanding

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Recursive Fibonacci Without Memoization

What is the output of the following TypeScript code that calculates Fibonacci numbers using simple recursion without any optimization?

DSA Typescript

function fib(n: number): number {
  if (n <= 1) return n;
  return fib(n - 1) + fib(n - 2);
}

console.log(fib(5));

A 5

B 8

C 13

D 3

💡 Hint

Remember that fib(0) = 0, fib(1) = 1, and fib(n) = fib(n-1) + fib(n-2).

The function calculates Fibonacci numbers recursively. fib(5) = fib(4) + fib(3) = 3 + 2 = 5.

🧠 Conceptual

intermediate

Why Recursion Alone Can Be Inefficient

Which of the following best explains why simple recursion can be inefficient for problems like Fibonacci sequence calculation?

A It recalculates the same subproblems multiple times, causing exponential time complexity.

B It uses too much memory because it stores all results in a table.

C It cannot handle base cases properly, leading to infinite loops.

D It always requires iterative loops to work correctly.

💡 Hint

Think about how many times fib(2) is calculated in fib(5).

Simple recursion recalculates the same subproblems many times, which leads to exponential time complexity and inefficiency.

❓ Predict Output

advanced

Output of Fibonacci with Memoization

What is the output of this TypeScript code that uses memoization to optimize Fibonacci calculation?

DSA Typescript

function fibMemo(n: number, memo: {[key: number]: number} = {}): number {
  if (n <= 1) return n;
  if (memo[n] !== undefined) return memo[n];
  memo[n] = fibMemo(n - 1, memo) + fibMemo(n - 2, memo);
  return memo[n];
}

console.log(fibMemo(10));

A 89

B 55

C 34

D 144

💡 Hint

Recall the Fibonacci sequence: 0,1,1,2,3,5,8,13,21,34,55,...

fibMemo(10) returns the 10th Fibonacci number which is 55. Memoization avoids repeated calculations.

🧠 Conceptual

advanced

When to Use Dynamic Programming Instead of Recursion

Which scenario best describes when dynamic programming is preferred over simple recursion?

A When the problem cannot be broken down into smaller subproblems.

B When the problem requires only a single recursive call per step.

C When the problem has overlapping subproblems and optimal substructure, making recursion inefficient.

D When the problem has no repeated calculations and recursion is already fast.

💡 Hint

Think about problems where the same smaller problems appear multiple times.

Dynamic programming is best when problems have overlapping subproblems and optimal substructure, allowing reuse of results to improve efficiency.

🔧 Debug

expert

Identify the Error in Recursive Fibonacci with Memoization

What error does the following TypeScript code produce when calling fibMemo(5)?

DSA Typescript

function fibMemo(n: number, memo: {[key: number]: number} = {}): number {
  if (n <= 1) return n;
  if (memo[n]) return memo[n];
  memo[n] = fibMemo(n - 1, memo) + fibMemo(n - 2, memo);
  return memo[n];
}

console.log(fibMemo(5));

A Causes a stack overflow error

B Returns 5 correctly without error

C Throws a TypeError because memo is undefined

D Returns undefined due to incorrect memo check

💡 Hint

Check how the memo object is checked before returning stored values.

The condition 'if (memo[n])' fails when memo[n] is 0, which is falsy, causing repeated calls and incorrect behavior.

Practice

1. Why do we use dynamic programming instead of just recursion for some problems?

easy

A. Because recursion alone can repeat the same calculations many times, making it slow.

B. Because recursion cannot solve problems with multiple steps.

C. Because dynamic programming uses loops instead of functions.

D. Because recursion always causes errors in large problems.

Solution

1. Step 1: Understand recursion's limitation

   Recursion solves problems by calling itself but often recalculates the same results multiple times.

2. Step 2: Recognize dynamic programming's advantage

   Dynamic programming stores results of subproblems to avoid repeated work, making it faster.

3. Final Answer:

   Because recursion alone can repeat the same calculations many times, making it slow. -> Option A

4. Quick Check:

   Recursion repeats work, DP saves results [OK]

Hint: DP saves repeated results to speed up recursion [OK]

Common Mistakes:

• Thinking recursion cannot handle multiple steps
• Believing DP only uses loops
• Assuming recursion always causes errors

2. Which of the following TypeScript function signatures correctly shows a recursive function with memoization parameter for dynamic programming?

easy

A. function fib(n: number): number[]

B. function fib(n: string, memo: number): number

C. function fib(memo: number[], n: number): void

D. function fib(n: number, memo: number[] = []): number

Solution

1. Step 1: Check parameter types and order

   function fib(n: number, memo: number[] = []): number has number n and optional memo array with default empty array, suitable for memoization.

2. Step 2: Verify return type and parameters

   function fib(n: number, memo: number[] = []): number returns number (the Fibonacci number), others have wrong types or order.

3. Final Answer:

   function fib(n: number, memo: number[] = []): number -> Option D

4. Quick Check:

   Correct memo param with default empty array [OK]

Hint: Memo param usually an array with default empty value [OK]

Common Mistakes:

• Swapping parameter order
• Using wrong return type
• Not providing default value for memo

3. What is the output of this TypeScript code snippet?

function fib(n: number, memo: number[] = []): number {
  if (n <= 1) return n;
  if (memo[n] !== undefined) return memo[n];
  memo[n] = fib(n - 1, memo) + fib(n - 2, memo);
  return memo[n];
}
console.log(fib(5));

medium

A. 3

B. 8

C. 5

D. Undefined

Solution

1. Step 1: Trace fib(5) calls with memo

   fib(5) = fib(4) + fib(3), memo stores results to avoid repeats.

2. Step 2: Calculate fib values

   fib(0)=0, fib(1)=1, fib(2)=1, fib(3)=2, fib(4)=3, fib(5)=5.

3. Final Answer:

   5 -> Option C

4. Quick Check:

   Fibonacci of 5 = 5 [OK]

Hint: Memo avoids repeats; fib(5) = 5 [OK]

Common Mistakes:

• Confusing fib(5) with fib(6)
• Ignoring memoization effect
• Assuming output is sum of all calls

4. Identify the bug in this recursive Fibonacci function without memoization:

function fib(n: number): number {
  if (n === 0) return 0;
  if (n === 1) return 1;
  return fib(n - 1) + fib(n - 2);
}
console.log(fib(40));

medium

A. It will cause a stack overflow error for large n.

B. It returns wrong Fibonacci numbers for n > 2.

C. It uses memoization incorrectly.

D. It has a syntax error in the return statement.

Solution

1. Step 1: Analyze recursion depth for fib(40)

   Without memoization, fib(40) causes many repeated calls, leading to deep recursion.

2. Step 2: Understand consequences

   Deep recursion can cause stack overflow or very slow execution, but no syntax or logic errors.

3. Final Answer:

   It will cause a stack overflow error for large n. -> Option A

4. Quick Check:

   Deep recursion without memo causes stack overflow [OK]

Hint: Large n without memo causes stack overflow [OK]

Common Mistakes:

• Thinking it returns wrong values
• Assuming syntax error exists
• Confusing memoization usage

5. You want to find the minimum number of coins to make a sum using recursion. Why is dynamic programming necessary here instead of plain recursion?

function minCoins(coins: number[], sum: number): number {
  if (sum === 0) return 0;
  let res = Infinity;
  for (let coin of coins) {
    if (coin <= sum) {
      let subRes = minCoins(coins, sum - coin);
      if (subRes !== Infinity && subRes + 1 < res) {
        res = subRes + 1;
      }
    }
  }
  return res;
}

hard

A. Because recursion cannot handle arrays as input parameters.

B. Because recursion alone recalculates the same sums multiple times, causing slow performance.

C. Because dynamic programming uses loops instead of recursion.

D. Because recursion always returns Infinity for large sums.

Solution

1. Step 1: Identify repeated subproblems in recursion

   The function calls itself with the same sums multiple times, recalculating results.

2. Step 2: Explain dynamic programming benefit

   DP stores results for sums already computed, avoiding repeated work and speeding up solution.

3. Final Answer:

   Because recursion alone recalculates the same sums multiple times, causing slow performance. -> Option B

4. Quick Check:

   DP saves repeated sum calculations [OK]

Hint: DP caches results to avoid repeated sum calculations [OK]

Common Mistakes:

• Thinking recursion can't handle arrays
• Believing DP replaces recursion with loops
• Assuming recursion returns Infinity always