Overlapping Subproblems and Optimal Substructure in DSA Typescript

Mental Model

Some problems can be broken into smaller parts that repeat, and the best solution uses the best answers to those parts.

Analogy: Imagine building a big Lego castle by reusing the same small Lego pieces many times instead of making new ones each time.

Problem
  ↓
Subproblem A -> Subproblem B -> Subproblem C
  ↓           ↓
Subproblem A (reused)  Subproblem B (reused)

Dry Run Walkthrough

Input: Calculate Fibonacci number for 5 using overlapping subproblems and optimal substructure

Goal: Show how smaller Fibonacci numbers are reused to find the answer efficiently

Step 1: Calculate fib(5) by breaking into fib(4) + fib(3)

fib(5) = fib(4) + fib(3)

Why: We break the problem into smaller parts to solve step by step

Step 2: Calculate fib(4) by fib(3) + fib(2)

fib(5) = [fib(3) + fib(2)] + fib(3)

Why: fib(4) also breaks down, but fib(3) appears again

Step 3: Calculate fib(3) by fib(2) + fib(1)

fib(5) = [[fib(2) + fib(1)] + fib(2)] + fib(3)

Why: fib(3) breaks down further, fib(2) repeats multiple times

Step 4: Reuse fib(2) and fib(1) values instead of recalculating

fib(5) = [[1 + 1] + 1] + [1 + 1]

Why: Reusing results saves time and avoids repeated work

Step 5: Sum all values to get fib(5) = 5

fib(5) = 5

Why: Combining all solved parts gives the final answer

Result:

fib(5) = 5

Annotated Code

DSA Typescript

class Fibonacci {
  private memo: Map<number, number> = new Map();

  fib(n: number): number {
    if (n <= 1) return n; // base case
    if (this.memo.has(n)) return this.memo.get(n)!; // reuse stored result

    const result = this.fib(n - 1) + this.fib(n - 2); // break into subproblems
    this.memo.set(n, result); // store result for reuse
    return result;
  }
}

const fibCalc = new Fibonacci();
console.log(`fib(5) = ${fibCalc.fib(5)}`);

if (n <= 1) return n; // base case

stop recursion when problem is smallest

if (this.memo.has(n)) return this.memo.get(n)!; // reuse stored result

check if subproblem already solved to avoid repeat work

const result = this.fib(n - 1) + this.fib(n - 2); // break into subproblems

divide problem into smaller overlapping parts

this.memo.set(n, result); // store result for reuse

save answer to reuse later, showing optimal substructure

Output

fib(5) = 5

Complexity Analysis

Time: O(n) because each Fibonacci number from 0 to n is calculated once and reused

Space: O(n) for storing results of subproblems in the memo map

vs Alternative: Compared to naive recursion with O(2^n) time, this approach is much faster by reusing answers

Edge Cases

n = 0 or n = 1 (smallest inputs)

Returns n immediately as base case without recursion

DSA Typescript

if (n <= 1) return n; // base case

Repeated calls with same n

Uses memoized result to avoid recalculation

DSA Typescript

if (this.memo.has(n)) return this.memo.get(n)!; // reuse stored result

When to Use This Pattern

When a problem can be split into smaller repeated parts and the best solution uses answers to those parts, look for overlapping subproblems and optimal substructure patterns.

Common Mistakes

Mistake: Not storing results of subproblems causing repeated calculations
Fix: Use a memo structure to save and reuse answers for subproblems

Mistake: Missing base case causing infinite recursion
Fix: Add base case to stop recursion when problem is smallest

Summary

It breaks problems into smaller overlapping parts and reuses their best answers.

Use it when a problem can be divided into repeated smaller problems with optimal solutions.

The key is to save answers to subproblems so you don't solve the same thing twice.

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