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

Understanding Overlapping Subproblems and Optimal Substructure with Fibonacci Numbers

📖 Scenario: Imagine you want to calculate the number of ways to climb stairs where you can take 1 or 2 steps at a time. This is similar to calculating Fibonacci numbers, which is a classic example to understand overlapping subproblems and optimal substructure in algorithms.

🎯 Goal: You will build a simple Java program that calculates Fibonacci numbers using recursion and then optimize it using memoization to avoid repeated calculations. This will help you see how overlapping subproblems and optimal substructure work in practice.

📋 What You'll Learn

Create a recursive method to calculate Fibonacci numbers

Add a memoization array to store intermediate results

Modify the recursive method to use memoization

Print the Fibonacci number for a given input

💡 Why This Matters

🌍 Real World

Many problems in computer science, like route planning, resource allocation, and dynamic programming, rely on breaking problems into smaller overlapping subproblems and combining their solutions optimally.

💼 Career

Understanding overlapping subproblems and optimal substructure is essential for software engineers to write efficient algorithms, especially in fields like data science, game development, and optimization.

1

Create a recursive method to calculate Fibonacci numbers

Create a Java method called fib that takes an int n and returns the Fibonacci number at position n using simple recursion. The method should return n if n is 0 or 1, otherwise return fib(n - 1) + fib(n - 2). Also, create a main method that calls fib(5) and stores the result in a variable called result.

DSA Java

public class Fibonacci {
    // Your code here
}

Hint

Use a simple recursive method that returns n if n is 0 or 1, else returns the sum of fib(n-1) and fib(n-2).

2

Add a memoization array to store intermediate results

Add a static integer array called memo of size 6 to the class to store intermediate Fibonacci results. Initialize all elements to -1 to indicate uncalculated values.

DSA Java

public class Fibonacci {
    static int[] memo = new int[6];
    // Your code here
}

Hint

Create a static array memo of size 6 and initialize all elements to -1 using a for loop.

3

Modify the recursive method to use memoization

Modify the fib method to first check if memo[n] is not -1. If so, return memo[n]. Otherwise, calculate the Fibonacci number recursively, store it in memo[n], and then return it.

DSA Java

public class Fibonacci {
    static int[] memo = new int[6];

    public static int fib(int n) {
        // Your code here
    }

    public static void main(String[] args) {
        for (int i = 0; i < memo.length; i++) {
            memo[i] = -1;
        }
        int result = fib(5);
    }
}

Hint

Check if memo[n] is already calculated. If yes, return it. Otherwise, calculate recursively, store in memo[n], and return.

4

Print the Fibonacci number for n = 5

Add a System.out.println statement in the main method to print the value of result.

DSA Java

public class Fibonacci {
    static int[] memo = new int[6];

    public static int fib(int n) {
        if (memo[n] != -1) {
            return memo[n];
        }
        if (n == 0 || n == 1) {
            memo[n] = n;
        } else {
            memo[n] = fib(n - 1) + fib(n - 2);
        }
        return memo[n];
    }

    public static void main(String[] args) {
        for (int i = 0; i < memo.length; i++) {
            memo[i] = -1;
        }
        int result = fib(5);
        // Your code here
    }
}

Hint

Use System.out.println(result); to print the Fibonacci number.

Practice

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

easy

A. The problem has no repeated subproblems and each subproblem is unique.

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

C. The solution requires sorting the input data first.

D. The problem can be solved using a greedy approach without recursion.

Solution

1. Step 1: Understand overlapping subproblems

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

2. Step 2: Match with options

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

3. Final Answer:

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

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
• Mixing greedy approach with dynamic programming

2. Which of the following Java method signatures correctly represents a memoized Fibonacci function?

easy

A. public int fib(int n, int[] memo)

B. public void fib(int n)

C. public int fib(String n, int[] memo)

D. public int fib(int n, String[] memo)

Solution

1. Step 1: Identify correct parameter types

   Memoization requires storing results, so an int array for memo is needed. The input n should be int.

2. Step 2: Check method signatures

   public int fib(int n, int[] memo) uses int n and int[] memo, which is correct for memoized Fibonacci.

3. Final Answer:

   public int fib(int n, int[] memo) -> Option A

4. Quick Check:

   Memo array type matches input type [OK]

Hint: Memo array must match return type and input must be int [OK]

Common Mistakes:

• Using void return type for Fibonacci function
• Using String type for numeric input or memo array
• Not passing memo array as parameter

3. What is the output of the following Java code snippet implementing a simple memoized Fibonacci?

public class FibMemo {
    static int[] memo = new int[6];
    public static int fib(int n) {
        if (n <= 1) return n;
        if (memo[n] != 0) return memo[n];
        memo[n] = fib(n-1) + fib(n-2);
        return memo[n];
    }
    public static void main(String[] args) {
        System.out.println(fib(5));
    }
}

medium

A. 8

B. 0

C. 5

D. StackOverflowError

Solution

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

   fib(5) calls fib(4) and fib(3), and so on. Memo stores results to avoid repeats.

2. Step 2: Calculate fib(5)

   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(5) = 5 [OK]

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

Common Mistakes:

• Confusing fib(5) with fib(6)
• Ignoring memoization effect
• Expecting sum of all calls instead of fib(5)

4. Identify the error in this Java code snippet for computing Fibonacci with memoization:

public class Fib {
    static int[] memo = new int[5];
    public static int fib(int n) {
        if (n <= 1) return n;
        if (memo[n] != 0) return memo[n];
        memo[n] = fib(n-1) + fib(n-2);
        return memo[n];
    }
    public static void main(String[] args) {
        System.out.println(fib(5));
    }
}

medium

A. No error, prints correct Fibonacci number

B. StackOverflowError due to infinite recursion

C. Compilation error due to missing return

D. ArrayIndexOutOfBoundsException due to memo size

Solution

1. Step 1: Check memo array size and access

   Memo array size is 5, so valid indices are 0 to 4. fib(5) tries to access memo[5], causing error.

2. Step 2: Identify exception type

   Accessing memo[5] causes ArrayIndexOutOfBoundsException at runtime.

3. Final Answer:

   ArrayIndexOutOfBoundsException due to memo size -> Option D

4. Quick Check:

   Array size < access index = error [OK]

Hint: Check array size matches max index accessed [OK]

Common Mistakes:

• Assuming memo size is enough without checking
• Thinking recursion causes stack overflow here
• Ignoring runtime exceptions

5. Given the problem of finding the minimum cost path in a grid from top-left to bottom-right, which property justifies using dynamic programming to solve it efficiently?

hard

A. The problem has overlapping subproblems and optimal substructure.

B. The problem can be solved by sorting all paths.

C. The problem requires only greedy choices without recursion.

D. The problem has no repeated subproblems and no optimal substructure.

Solution

1. Step 1: Understand minimum cost path problem

   The problem breaks into smaller subproblems (cost to reach each cell) that overlap.

2. Step 2: Check properties for dynamic programming

   Optimal substructure means optimal solution uses optimal solutions of subproblems. Overlapping subproblems means subproblems repeat.

3. Step 3: Match with options

   The problem has overlapping subproblems and optimal substructure. correctly states both properties, justifying dynamic programming.

4. Final Answer:

   The problem has overlapping subproblems and optimal substructure. -> Option A

5. Quick Check:

   Overlapping subproblems + optimal substructure = DP [OK]

Hint: Look for repeated subproblems and optimal smaller solutions [OK]

Common Mistakes:

• Thinking sorting solves the problem
• Assuming greedy approach always works
• Ignoring overlapping subproblems