Overlapping Subproblems and Optimal Substructure in DSA Typescript - Cheat Sheet & Quick Revision

Recall & Review

beginner

What does Overlapping Subproblems mean in dynamic programming?

It means the problem can be broken down into smaller subproblems that repeat multiple times. Instead of solving them again and again, we solve once and reuse the answer.

beginner

Explain Optimal Substructure in simple terms.

A problem has optimal substructure if the best solution can be made by combining the best solutions of its smaller parts.

intermediate

Why is Overlapping Subproblems important for dynamic programming?

Because it allows us to store results of subproblems and reuse them, saving time by avoiding repeated work.

beginner

Give an example of a problem that shows both overlapping subproblems and optimal substructure.

The Fibonacci sequence calculation: It has overlapping subproblems (fib(n-1), fib(n-2) repeat) and optimal substructure (fib(n) = fib(n-1) + fib(n-2)).

intermediate

How does memoization relate to overlapping subproblems?

Memoization saves answers of subproblems so when the same subproblem appears again, we use the saved answer instead of recalculating.

Which of the following best describes overlapping subproblems?

A Subproblems are completely different

B Subproblems repeat and can be reused

C Subproblems do not affect the main problem

D Subproblems are solved only once

Overlapping subproblems means the same smaller problems appear multiple times and can be reused.

What does optimal substructure allow us to do?

A Build the best solution from best smaller solutions

B Ignore smaller problems

C Solve only the largest problem

D Avoid breaking problems into parts

Optimal substructure means the best answer comes from combining best answers of smaller parts.

Which technique uses overlapping subproblems to improve efficiency?

A Greedy algorithm

B Brute force

C Sorting

D Memoization

Memoization stores results of repeated subproblems to avoid recalculating.

The Fibonacci sequence is an example of a problem with:

A Overlapping subproblems and optimal substructure

B No overlapping subproblems

C No optimal substructure

D Neither overlapping subproblems nor optimal substructure

Fibonacci has repeated subproblems and the solution builds from smaller solutions.

Why is dynamic programming better than simple recursion for problems with overlapping subproblems?

A It solves problems randomly

B It uses more memory without speed benefit

C It avoids repeated calculations by storing results

D It ignores subproblems

Dynamic programming stores answers to subproblems to reuse and save time.

Describe in your own words what overlapping subproblems and optimal substructure mean and why they matter in solving problems efficiently.

Think about breaking problems into parts and reusing answers.

Explain how memoization uses the concept of overlapping subproblems to improve performance.

Focus on saving and reusing answers.

Practice

1. Which of the following best describes the overlapping subproblems property in dynamic programming?

easy

A. The problem requires sorting elements before solving.

B. The problem has a unique solution without repeating any subproblems.

C. The problem can be broken down into smaller subproblems that are solved multiple times.

D. The problem can only be solved using recursion without memoization.

Solution

1. Step 1: Understand overlapping subproblems

   Overlapping subproblems means the same smaller problems appear multiple times during solving.

2. Step 2: Match definition with options

   The problem can be broken down into smaller subproblems that are solved multiple times. correctly states that subproblems repeat and can be reused.

3. Final Answer:

   The problem can be broken down into smaller subproblems that are solved multiple times. -> Option C

4. Quick Check:

   Overlapping subproblems = repeated smaller problems [OK]

Hint: Look for repeated smaller problems solved multiple times [OK]

Common Mistakes:

• Confusing overlapping subproblems with unique subproblems
• Thinking sorting is required for overlapping subproblems
• Assuming recursion alone solves overlapping subproblems

2. Which TypeScript syntax correctly declares a memoization object for storing subproblem results?

easy

A. let memo = new Map();

B. const memo: number[] = [];

C. var memo = {};

D. const memo: string = '';

Solution

1. Step 1: Identify suitable data structure for memoization

   Memoization stores key-value pairs of subproblems and results, so Map is ideal.

2. Step 2: Check options for correct TypeScript syntax

   let memo = new Map(); uses Map which is correct for memoization.

3. Final Answer:

   let memo = new Map<number, number>(); -> Option A

4. Quick Check:

   Memoization uses Map for key-value storage [OK]

Hint: Use Map for flexible key-value memo storage in TypeScript [OK]

Common Mistakes:

• Using empty object without type safety
• Declaring memo as a string instead of a collection
• Using array when keys are not sequential indices

3. Consider this TypeScript function using memoization for Fibonacci numbers:

function fib(n: number, memo = new Map()): number {
  if (n <= 1) return n;
  if (memo.has(n)) return memo.get(n)!;
  const result = fib(n - 1, memo) + fib(n - 2, memo);
  memo.set(n, result);
  return result;
}
console.log(fib(5));

What is the output printed?

medium

A. 8

B. 5

C. 3

D. Error

Solution

1. Step 1: Understand Fibonacci calculation with memoization

   fib(5) = fib(4) + fib(3), recursively calculated and stored to avoid repeats.

2. Step 2: Calculate fib(5) step-by-step

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

3. Final Answer:

   5 -> Option B

4. Quick Check:

   fib(5) = 5 [OK]

Hint: Recall Fibonacci sequence: 0,1,1,2,3,5... [OK]

Common Mistakes:

• Confusing fib(5) with fib(6)
• Forgetting base cases n <= 1
• Assuming memo is reset each call

4. The following TypeScript code attempts to compute Fibonacci numbers with memoization but has a bug:

function fib(n: number, memo = new Map()): number {
  if (n <= 1) return n;
  if (memo.has(n)) return memo.get(n)!;
  const result = fib(n - 1) + fib(n - 2);
  memo.set(n, result);
  return result;
}
console.log(fib(5));

What is the main issue causing incorrect behavior?

medium

A. Memo object is not passed in recursive calls, so memoization fails.

B. Base case condition is incorrect for n <= 1.

C. Map is not initialized properly.

D. Return statement is missing.

Solution

1. Step 1: Analyze recursive calls and memo usage

   Recursive calls fib(n - 1) and fib(n - 2) do not pass the memo Map, so each call creates a new Map.

2. Step 2: Understand impact on memoization

   Without passing memo, results are not stored or reused, causing repeated calculations and no optimization.

3. Final Answer:

   Memo object is not passed in recursive calls, so memoization fails. -> Option A

4. Quick Check:

   Pass memo in recursive calls to reuse stored results [OK]

Hint: Always pass memo object in recursive calls for memoization [OK]

Common Mistakes:

• Not passing memo in recursive calls
• Changing base case unnecessarily
• Assuming Map auto-shares across calls

5. You want to find the minimum cost path in a grid from top-left to bottom-right, moving only right or down. The cost grid is:

const cost = [
  [1, 3, 5],
  [2, 1, 2],
  [4, 3, 1]
];

Which approach best uses overlapping subproblems and optimal substructure to solve this efficiently?

hard

A. Use a greedy approach picking the smallest adjacent cost at each step.

B. Use recursion without memoization to explore all paths.

C. Sort the grid and pick the smallest values.

D. Use dynamic programming to store minimum cost for each cell based on previous cells.

Solution

1. Step 1: Identify problem properties

   Minimum cost path has optimal substructure: cost to reach a cell depends on minimum cost to reach adjacent cells.

2. Step 2: Choose approach using overlapping subproblems

   Dynamic programming stores results for each cell to avoid recomputing paths (overlapping subproblems).

3. Final Answer:

   Use dynamic programming to store minimum cost for each cell based on previous cells. -> Option D

4. Quick Check:

   DP uses overlapping subproblems + optimal substructure [OK]

Hint: Use DP to store and reuse subproblem results for grid paths [OK]

Common Mistakes:

• Using recursion without memoization causing slow performance
• Assuming greedy always finds minimum cost
• Sorting grid values unrelated to path costs