Overlapping Subproblems and Optimal Substructure in DSA Rust - 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

Define Optimal Substructure in simple terms.

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

intermediate

Why is Overlapping Subproblems important for dynamic programming?

Because it allows us to save time by storing results of subproblems and reusing them, avoiding repeated work.

intermediate

Give an example of a problem that shows Optimal Substructure.

The shortest path problem: the shortest path from A to C through B is the shortest path from A to B plus the shortest path from B to C.

advanced

How do Overlapping Subproblems and Optimal Substructure work together in dynamic programming?

Optimal substructure breaks the problem into smaller parts, and overlapping subproblems means these parts repeat. Dynamic programming solves each part once and combines results for the best answer.

Which property means a problem can be split into smaller problems whose solutions build the main solution?

A Divide and Conquer

B Optimal Substructure

C Greedy Choice Property

D Overlapping Subproblems

Optimal Substructure means the best solution comes from best solutions of smaller parts.

What does Overlapping Subproblems allow us to do in dynamic programming?

A Solve each subproblem once and reuse the answer

B Divide the problem into independent parts

C Use recursion without storing results

D Ignore repeated calculations

Overlapping Subproblems means subproblems repeat, so we store and reuse answers to save time.

Which problem is a classic example of overlapping subproblems?

A Finding maximum in an array

B Binary search

C Sorting an array

D Fibonacci sequence calculation

Fibonacci calculation repeats the same subproblems many times, showing overlapping subproblems.

If a problem does NOT have optimal substructure, can dynamic programming be used effectively?

A Only if subproblems are independent

B Yes, always

C No, because solutions to subproblems don't build the main solution

D Only if overlapping subproblems exist

Without optimal substructure, combining subproblem solutions won't give the best main solution.

What technique uses both overlapping subproblems and optimal substructure?

A Dynamic Programming

B Greedy Algorithms

C Backtracking

D Brute Force

Dynamic programming solves problems by reusing solutions to overlapping subproblems and combining optimal substructures.

Explain 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.

Describe a simple example problem that shows both overlapping subproblems and optimal substructure. Explain how dynamic programming would solve it.

Fibonacci sequence is a classic example.

Practice

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

easy

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

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

C. The problem requires sorting before solving.

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 to options

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

3. Final Answer:

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

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 Rust syntax correctly declares a function to compute Fibonacci numbers using memoization?

easy

A. fn fib(n: usize, memo: &Vec<usize>) -> usize { ... }

B. fn fib(n: usize) -> usize { let memo = Vec::new(); ... }

C. fn fib(n: usize, memo: Vec<usize>) -> usize { ... }

D. fn fib(n: usize, memo: &mut Vec) -> usize { ... }

Solution

1. Step 1: Identify correct parameter passing for memo

   Memo must be mutable reference to allow updates during recursion.

2. Step 2: Check options for mutable reference

   fn fib(n: usize, memo: &mut Vec) -> usize { ... } uses &mut Vec, which allows updating memo inside the function.

3. Final Answer:

   fn fib(n: usize, memo: &mut Vec) -> usize { ... } -> Option D

4. Quick Check:

   Mutable reference needed for memo updates [OK]

Hint: Use &mut for mutable references in Rust function parameters [OK]

Common Mistakes:

• Passing memo by value causing copies
• Using immutable reference &Vec which disallows updates
• Initializing memo inside function losing previous results

3. What is the output of this Rust code that uses memoization for Fibonacci?

fn fib(n: usize, memo: &mut Vec) -> usize {
    if n <= 1 { return n; }
    if let Some(val) = memo[n] { return val; }
    let val = fib(n-1, memo) + fib(n-2, memo);
    memo[n] = Some(val);
    val
}

fn main() {
    let mut memo = vec![None; 6];
    println!("{}", fib(5, &mut memo));
}

medium

A. 8

B. 5

C. 3

D. 13

Solution

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

   fib(5) = fib(4) + fib(3), fib(4) = 3, fib(3) = 2, so fib(5) = 5.

2. Step 2: Confirm memo stores results to avoid recomputation

   Memoization stores fib(3)=2, fib(4)=3, so final fib(5) = 5 is returned and printed.

3. Final Answer:

   5 -> Option B

4. Quick Check:

   fib(5) = 5 [OK]

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

Common Mistakes:

• Confusing fib(5) with fib(6)
• Ignoring memoization effect
• Miscounting base cases

4. Identify the bug in this Rust code for Fibonacci with memoization:

fn fib(n: usize, memo: &mut Vec) -> usize {
    if n <= 1 { return n; }
    if memo[n].is_some() { return memo[n].unwrap(); }
    let val = fib(n-1, memo) + fib(n-2, memo);
    memo[n] = Some(val);
    val
}

fn main() {
    let mut memo = vec![None; 5];
    println!("{}", fib(5, &mut memo));
}

medium

A. Vector size is too small causing index out of bounds

B. Memo is not mutable

C. Base case condition is incorrect

D. Using unwrap() causes panic always

Solution

1. Step 1: Check vector size for memo

   Memo vector has size 5 but fib(5) accesses memo[5], which is out of bounds.

2. Step 2: Understand Rust vector indexing

   Indexing beyond vector length causes runtime panic, so vector size must be at least n+1.

3. Final Answer:

   Vector size is too small causing index out of bounds -> Option A

4. Quick Check:

   Memo size < n+1 causes index error [OK]

Hint: Ensure memo vector size is n+1 for fib(n) [OK]

Common Mistakes:

• Not allocating enough space for memo
• Ignoring Rust's zero-based indexing
• Assuming unwrap() always safe

5. You want to find the minimum cost path in a grid from top-left to bottom-right, moving only right or down. Which property allows using dynamic programming to solve this efficiently?

hard

A. Greedy choice: always pick the cell with the smallest immediate cost.

B. Overlapping subproblems: each cell's cost is unique and never reused.

C. Optimal substructure: the minimum cost path to a cell depends on minimum cost paths to adjacent cells.

D. Divide and conquer: split the grid into independent parts solved separately.

Solution

1. Step 1: Understand minimum cost path problem

   The cost to reach a cell depends on the best path to its neighbors (top or left).

2. Step 2: Identify optimal substructure property

   Optimal substructure means the optimal solution to the whole problem contains optimal solutions to subproblems.

3. Final Answer:

   Optimal substructure: the minimum cost path to a cell depends on minimum cost paths to adjacent cells. -> Option C

4. Quick Check:

   Minimum cost path uses optimal substructure [OK]

Hint: Look for solutions built from optimal subproblems [OK]

Common Mistakes:

• Confusing overlapping subproblems with unique subproblems
• Assuming greedy always works here
• Thinking divide and conquer applies without overlap