Why Memoization to Optimize Recursion in DSA Java?

The Big Idea

What if your program could remember its past work and never repeat the same mistake twice?

The Scenario

Imagine you are solving a puzzle where you need to find the number of ways to climb stairs, but you keep recalculating the same steps over and over again.

This is like trying to remember a long list of phone numbers by repeating them again and again without writing them down.

The Problem

Doing the same calculations repeatedly wastes time and makes your solution very slow.

It is easy to get confused or make mistakes when you repeat the same work many times.

The Solution

Memoization helps by remembering the answers to problems you already solved.

It stores these answers so you can quickly use them again without recalculating.

This makes your program much faster and easier to understand.

Before vs After

✗ Before

int fib(int n) {
  if (n <= 1) return n;
  return fib(n-1) + fib(n-2);
}

✓ After

int fib(int n, int[] memo) {
  if (n <= 1) return n;
  if (memo[n] != -1) return memo[n];
  memo[n] = fib(n-1, memo) + fib(n-2, memo);
  return memo[n];
}

What It Enables

Memoization enables solving complex problems quickly by avoiding repeated work.

Real Life Example

When planning routes on a map, memoization helps by remembering the shortest paths already found, so you don't recalculate them every time.

Key Takeaways

Manual recursion repeats work and is slow.

Memoization stores results to reuse them.

This makes recursive solutions efficient and practical.

Practice

1. What is the main purpose of using memoization in recursive functions?

easy

A. To store results of expensive function calls and reuse them

B. To make the code shorter and simpler

C. To avoid using loops in recursion

D. To increase the number of recursive calls

Solution

1. Step 1: Understand recursion inefficiency

   Recursive functions often repeat the same calculations multiple times, which wastes time.

2. Step 2: Role of memoization

   Memoization saves the results of these repeated calculations so they can be reused instead of recalculated.

3. Final Answer:

   To store results of expensive function calls and reuse them -> Option A

4. Quick Check:

   Memoization = Store and reuse results [OK]

Hint: Memoization saves repeated results to speed recursion [OK]

Common Mistakes:

• Thinking memoization makes code shorter
• Confusing memoization with iteration
• Believing memoization increases recursion calls

2. Which of the following Java code snippets correctly declares a memoization cache for storing integer results by input integer keys?

easy

A. Map memo = new HashMap<>();

B. List<Integer> memo = new ArrayList<>();

C. int[] memo = new int();

D. HashSet<Integer> memo = new HashSet<>();

Solution

1. Step 1: Identify suitable data structure for key-value pairs

   Memoization requires storing results by input keys, so a Map is ideal.

2. Step 2: Check Java syntax correctness

   Map memo = new HashMap<>(); uses Map with HashMap, which is correct syntax for memoization cache.

3. Final Answer:

   Map memo = new HashMap<>(); -> Option A

4. Quick Check:

   Memo cache = Map for key-value pairs [OK]

Hint: Use Map for key-value memo cache in Java [OK]

Common Mistakes:

• Using List instead of Map for memoization
• Incorrect array declaration syntax
• Using Set which stores only keys, no values

3. What will be the output of the following Java code using memoization for Fibonacci numbers?

import java.util.*;
public class FibMemo {
  static Map memo = new HashMap<>();
  public static int fib(int n) {
    if (n <= 1) return n;
    if (memo.containsKey(n)) return memo.get(n);
    int result = fib(n-1) + fib(n-2);
    memo.put(n, result);
    return result;
  }
  public static void main(String[] args) {
    System.out.println(fib(5));
  }
}

medium

A. Error at runtime

B. 8

C. 5

D. 13

Solution

1. Step 1: Understand Fibonacci sequence calculation

   fib(5) = fib(4) + fib(3), and so on, with base cases fib(0)=0, fib(1)=1.

2. Step 2: Calculate fib(5) with memoization

   fib(2)=1, fib(3)=2, fib(4)=3, fib(5)=5. Memoization avoids repeated calls but result is same.

3. Final Answer:

   5 -> Option C

4. Quick Check:

   fib(5) = 5 [OK]

Hint: Recall Fibonacci(5) = 5, memoization doesn't change result [OK]

Common Mistakes:

• Confusing Fibonacci values for wrong n
• Assuming memoization changes output
• Thinking code causes runtime error

4. Identify the error in this Java memoized factorial function:

import java.util.*;
public class FactorialMemo {
  static Map memo = new HashMap<>();
  public static int fact(int n) {
    if (n == 0) return 1;
    if (memo.containsKey(n)) return memo.get(n);
    int result = n * fact(n - 1);
    memo.put(n, result);
    return result;
  }
  public static void main(String[] args) {
    System.out.println(fact(-1));
  }
}

medium

A. Memo map is not initialized properly

B. fact method should return long instead of int

C. Incorrect multiplication order in recursion

D. No base case for negative input causes infinite recursion

Solution

1. Step 1: Analyze base cases and input handling

   Base case handles n == 0 only, but negative n causes no stop condition.

2. Step 2: Effect of negative input

   Calling fact(-1) leads to infinite recursion because n never reaches 0 or memoized value.

3. Final Answer:

   No base case for negative input causes infinite recursion -> Option D

4. Quick Check:

   Missing negative base case = infinite recursion [OK]

Hint: Check base cases cover all input ranges [OK]

Common Mistakes:

• Ignoring negative input handling
• Assuming memo initialization error
• Thinking multiplication order causes error

5. You want to optimize a recursive function that calculates the number of ways to climb n stairs taking 1 or 2 steps at a time. Which memoization approach below correctly implements this in Java?

hard

A. Use a List<Integer> to store results; always calculate recursively without checking cache.

B. Use a Map to store results; check cache before recursive calls; store results after calculation.

C. Use an int array without initializing values; store results only after all recursion ends.

D. Use a Set<Integer> to store visited stairs; return size of set as result.

Solution

1. Step 1: Understand problem and memoization needs

   We must store number of ways for each stair number to avoid repeated calculations.

2. Step 2: Evaluate memoization approaches

   Use a Map to store results; check cache before recursive calls; store results after calculation. uses Map to store and check results before recursion, which is correct memoization practice.

3. Final Answer:

   Use a Map to store results; check cache before recursive calls; store results after calculation. -> Option B

4. Quick Check:

   Memo = Map with cache check and store [OK]

Hint: Check cache before recursion, store after calculation [OK]

Common Mistakes:

• Not checking cache before recursive calls
• Using List or Set incorrectly for memoization
• Storing results too late or not at all