Overlapping Subproblems and Optimal Substructure in DSA Rust - Build from Scratch

Overlapping Subproblems and Optimal Substructure with Fibonacci Numbers

📖 Scenario: Imagine you want to calculate the nth Fibonacci number. The Fibonacci sequence is a famous example where the same calculations repeat many times (overlapping subproblems), and the solution can be built from smaller solutions (optimal substructure).We will build a program step-by-step in Rust to calculate Fibonacci numbers efficiently using these ideas.

🎯 Goal: Build a Rust program that calculates the nth Fibonacci number using memoization to avoid repeated calculations.This will demonstrate overlapping subproblems and optimal substructure concepts clearly.

📋 What You'll Learn

Create a vector to store Fibonacci numbers for memoization

Create a variable to hold the target Fibonacci index n

Write a recursive function fib_memo that uses memoization

Print the Fibonacci number for n

💡 Why This Matters

🌍 Real World

Calculating Fibonacci numbers efficiently is a classic example of dynamic programming, which is used in many real-world problems like resource allocation, route planning, and bioinformatics.

💼 Career

Understanding overlapping subproblems and optimal substructure is essential for software engineers and data scientists to write efficient algorithms and optimize performance.

1

Create a memoization vector for Fibonacci numbers

Create a mutable vector called memo with 11 elements, all initialized to None. This vector will store Option values for Fibonacci numbers from 0 to 10.

DSA Rust

# Create a mutable vector called memo with 11 None values
# Your code here

Hint

Use vec![None; 11] to create a vector with 11 None values.

2

Set the target Fibonacci index n

Add a variable called n and set it to 10. This is the Fibonacci number we want to calculate.

DSA Rust

fn main() {
    let mut memo: Vec> = vec![None; 11];
    // Set n to 10
    // Your code here
}

Hint

Use let n: usize = 10; to create the variable.

3

Write the recursive Fibonacci function with memoization

Write a function called fib_memo that takes n: usize and memo: &mut Vec> as parameters and returns a u64. The function should: - Return 0 if n == 0 - Return 1 if n == 1 - Check if memo[n] has a value and return it if present - Otherwise, calculate fib_memo(n-1, memo) + fib_memo(n-2, memo), store it in memo[n], and return it.

DSA Rust

fn main() {
    let mut memo: Vec> = vec![None; 11];
    let n: usize = 10;

    // Define fib_memo function here
    // Your code here
}

Hint

Use if let Some(value) = memo[n] to check memoized results.

4

Print the Fibonacci number for n

Call the fib_memo function with n and &mut memo, then print the result using println!.

DSA Rust

fn main() {
    let mut memo: Vec> = vec![None; 11];
    let n: usize = 10;

    fn fib_memo(n: usize, memo: &mut Vec>) -> u64 {
        if n == 0 {
            return 0;
        } else if n == 1 {
            return 1;
        }
        if let Some(value) = memo[n] {
            return value;
        }
        let result = fib_memo(n - 1, memo) + fib_memo(n - 2, memo);
        memo[n] = Some(result);
        result
    }

    // Print the Fibonacci number for n
    // Your code here
}

Hint

Use println!("Fibonacci number {} is {}", n, result); to print the output.

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