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

Recall & Review

beginner

What does the term Overlapping Subproblems mean in dynamic programming?

It means the problem can be broken down into smaller subproblems which are solved multiple times. Instead of solving them repeatedly, we store their results to avoid repeated work.

beginner

Explain Optimal Substructure in simple words.

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

beginner

Why is Overlapping Subproblems important for dynamic programming?

Because it allows us to save time by remembering answers to subproblems and reusing them, instead of solving the same subproblems again and again.

beginner

Give a real-life example that shows Optimal Substructure.

Planning a trip: The best route from home to destination can be made by choosing the best routes between intermediate stops. Each small best route helps build the overall best route.

intermediate

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 reuses the answer to build the final solution.

Which of the following best describes overlapping subproblems?

A Subproblems are solved multiple times

B Subproblems are all independent

C Subproblems never repeat

D Subproblems are always larger than the original problem

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

What does optimal substructure imply about a problem?

A The problem cannot be divided

B The problem can be solved by combining optimal solutions of subproblems

C The problem has no smaller parts

D The problem solution is always unique

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

Which technique uses overlapping subproblems and optimal substructure?

A Dynamic Programming

B Greedy Algorithm

C Divide and Conquer

D Brute Force

Dynamic programming solves problems by storing answers to overlapping subproblems and using optimal substructure.

If a problem does NOT have overlapping subproblems, what is the likely best approach?

A Dynamic Programming

B Backtracking

C Memoization

D Divide and Conquer

Divide and conquer works well when subproblems are independent and do not overlap.

Which of these is NOT a sign of optimal substructure?

A Combining subproblem solutions gives overall solution

B Best solution can be built from best sub-solutions

C Subproblems are independent

D Problem can be broken into smaller parts

Optimal substructure does not require subproblems to be independent; overlapping subproblems may exist.

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

Think about breaking problems into smaller parts and reusing answers.

Give an example of a problem that has overlapping subproblems and optimal substructure and 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 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