Why Dynamic Programming and When Recursion Alone Fails in DSA Typescript - See It Work

Why Dynamic Programming and When Recursion Alone Fails

📖 Scenario: Imagine you want to find the number of ways to climb a staircase with 5 steps. You can climb either 1 or 2 steps at a time. This is a common problem where recursion alone can be slow because it repeats the same calculations many times.We will learn how to use dynamic programming to avoid repeating work and make the solution faster.

🎯 Goal: Build a simple program that first uses recursion to count ways to climb stairs, then improves it using dynamic programming with memoization to avoid repeated calculations.

📋 What You'll Learn

Create a recursive function to count ways to climb stairs

Add a memo object to store results of subproblems

Modify the recursive function to use the memo object

Print the number of ways to climb 5 steps

💡 Why This Matters

🌍 Real World

Counting ways to do tasks with overlapping steps appears in many real-world problems like route planning, resource allocation, and game moves.

💼 Career

Understanding when recursion is inefficient and how dynamic programming optimizes it is key for software engineers solving complex algorithm problems.

1

Create a recursive function to count ways to climb stairs

Create a function called countWays that takes a number n representing steps left. If n is 0 or 1, return 1. Otherwise, return the sum of countWays(n - 1) and countWays(n - 2). Then call countWays(5) and store the result in a variable called result.

DSA Typescript

// Your code here

Hint

Think about the base cases for 0 and 1 steps. Then use recursion to add the ways for smaller steps.

2

Add a memo object to store results of subproblems

Create an empty object called memo to store previously calculated results for each n.

DSA Typescript

function countWays(n: number): number {
    if (n === 0 || n === 1) {
        return 1;
    }
    return countWays(n - 1) + countWays(n - 2);
}

const memo: {[key: number]: number} = {};
// Your code here

Hint

This object will help us remember answers for each step count to avoid repeating work.

3

Modify the recursive function to use the memo object

Change the countWays function to first check if n is in memo. If yes, return memo[n]. Otherwise, calculate the result recursively, store it in memo[n], and then return it.

DSA Typescript

function countWays(n: number): number {
    if (n === 0 || n === 1) {
        return 1;
    }
    // Your code here
}

const memo: {[key: number]: number} = {};

Hint

Use the memo object to save results and check before computing again.

4

Print the number of ways to climb 5 steps

Add a console.log statement to print the value of countWays(5).

DSA Typescript

const memo: {[key: number]: number} = {};

function countWays(n: number): number {
    if (n === 0 || n === 1) {
        return 1;
    }
    if (memo[n] !== undefined) {
        return memo[n];
    }
    memo[n] = countWays(n - 1) + countWays(n - 2);
    return memo[n];
}

// Your code here

Hint

The output should be the number of ways to climb 5 steps, which is 8.

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