Greedy vs DP How to Know Which to Apply in DSA Java - Why the Distinction Matters

The Big Idea

Can a quick choice always lead to the best answer? Discover when to trust your gut and when to plan carefully.

The Scenario

Imagine you have a big jar of coins and you want to give exact change using the fewest coins possible. You try picking the biggest coin first every time, hoping it will work. But sometimes, this simple choice doesn't give the right answer.

The Problem

Choosing the biggest coin each time (greedy) can be fast but often misses the best solution. It's like rushing without checking all options, leading to mistakes or missing better answers. Doing all checks manually is slow and confusing.

The Solution

Dynamic Programming (DP) helps by remembering past results and exploring all options carefully. It finds the best answer by building up from smaller problems, avoiding repeated work. Greedy is quick and simple but only works when the problem fits certain rules.

Before vs After

✗ Before

int change = 0;
while(amount > 0) {
  if(amount >= 25) amount -= 25;
  else if(amount >= 10) amount -= 10;
  else if(amount >= 5) amount -= 5;
  else amount -= 1;
  change++;
}

✓ After

int[] dp = new int[amount + 1];
Arrays.fill(dp, amount + 1);
dp[0] = 0;
for(int i = 1; i <= amount; i++) {
  for(int coin : coins) {
    if(coin <= i) dp[i] = Math.min(dp[i], dp[i - coin] + 1);
  }
}

What It Enables

Understanding when to use Greedy or DP lets you solve problems efficiently and correctly, saving time and avoiding errors.

Real Life Example

When packing a backpack with limited space, Greedy might pick the heaviest items first, but DP helps find the best combination of items to maximize value without exceeding space.

Key Takeaways

Greedy is fast but only works if local choices lead to global best.

DP explores all options and remembers results to find the best solution.

Knowing which to apply saves time and ensures correct answers.

Practice

1. Which of the following best describes when to use a greedy algorithm instead of dynamic programming?

easy

A. When the problem needs to store all intermediate results

B. When the problem requires checking all possible combinations

C. When the problem has overlapping subproblems but no optimal substructure

D. When the problem has the greedy choice property and optimal substructure

Solution

1. Step 1: Understand greedy choice property

   A greedy algorithm works when choosing the best option at each step leads to a global optimum.

2. Step 2: Recognize optimal substructure

   Optimal substructure means the optimal solution can be built from optimal solutions of subproblems.

3. Final Answer:

   When the problem has the greedy choice property and optimal substructure -> Option D

4. Quick Check:

   Greedy = greedy choice + optimal substructure [OK]

Hint: Use greedy if local best leads to global best [OK]

Common Mistakes:

• Confusing overlapping subproblems with greedy applicability
• Using greedy when problem needs full exploration
• Ignoring optimal substructure requirement

2. Which Java syntax correctly declares a 2D array for dynamic programming table initialization?

easy

A. int[][] dp = new int[5];

B. int dp[][] = new int(5,5);

C. int[][] dp = new int[5][5];

D. int dp[5][5] = new int[][];

Solution

1. Step 1: Recall Java 2D array syntax

   Java uses new int[rows][columns] to declare 2D arrays.

2. Step 2: Check each option

   int[][] dp = new int[5][5]; uses correct syntax. Options A, B, C have syntax errors or incomplete declarations.

3. Final Answer:

   int[][] dp = new int[5][5]; -> Option C

4. Quick Check:

   Correct 2D array declaration = int[][] dp = new int[5][5]; [OK]

Hint: Use new int[rows][cols] for 2D arrays in Java [OK]

Common Mistakes:

• Using parentheses instead of brackets
• Missing size in second dimension
• Incorrect array initialization syntax

3. What is the output of the following Java code snippet?

int[] coins = {1, 2, 5};
int amount = 11;
int count = 0;
for (int i = coins.length - 1; i >= 0; i--) {
    count += amount / coins[i];
    amount %= coins[i];
}
System.out.println(count);

medium

A. 3

B. 5

C. 4

D. 6

Solution

1. Step 1: Trace the loop from largest coin to smallest

   Start with amount=11, coins = [1,2,5]. i=2 (coin=5): count += 11/5=2, amount=11%5=1.

2. Step 2: Continue with next coins

   i=1 (coin=2): count += 1/2=0, amount=1%2=1; i=0 (coin=1): count += 1/1=1, amount=1%1=0.

3. Step 3: Calculate total count

   Total count = 2 + 0 + 1 = 3.

4. Final Answer:

   3 -> Option A

5. Quick Check:

   Greedy coin count = 3 [OK]

Hint: Divide and mod with largest coin first [OK]

Common Mistakes:

• Adding counts incorrectly
• Mixing up division and modulo
• Ignoring order of coins

4. The following code attempts to solve the coin change problem using greedy approach. What is the bug?

int[] coins = {1, 3, 4};
int amount = 6;
int count = 0;
for (int i = coins.length - 1; i >= 0; i--) {
    count += amount / coins[i];
    amount %= coins[i];
}
System.out.println(count);

medium

A. Division by zero error

B. Greedy fails because coin set lacks greedy choice property

C. Array index out of bounds error

D. Incorrect initialization of count variable

Solution

1. Step 1: Understand greedy choice property failure

   Coins {1,3,4} do not guarantee greedy choice property for amount 6.

2. Step 2: Trace greedy approach output

   Greedy picks 4 once (count=1), remainder 2; then picks two 1s (count=3). But optimal is two 3s (count=2).

3. Final Answer:

   Greedy fails because coin set lacks greedy choice property -> Option B

4. Quick Check:

   Greedy fails if no greedy choice property [OK]

Hint: Check if greedy choice property holds before using greedy [OK]

Common Mistakes:

• Assuming greedy always works for coin change
• Ignoring optimal substructure requirement
• Confusing runtime errors with logic errors

5. Given a set of tasks with start and end times, which approach is best to find the maximum number of non-overlapping tasks?

class Task {
    int start, end;
    Task(int s, int e) { start = s; end = e; }
}

Choose the correct approach and why.

hard

A. Use greedy by sorting tasks by earliest finish time to select tasks

B. Use dynamic programming to check all subsets of tasks

C. Use greedy by sorting tasks by longest duration first

D. Use dynamic programming to store maximum tasks ending at each time

Solution

1. Step 1: Identify problem type

   This is the activity selection problem, classic greedy example.

2. Step 2: Choose greedy approach

   Sorting by earliest finish time ensures maximum tasks without overlap.

3. Step 3: Compare options

   Use greedy by sorting tasks by earliest finish time to select tasks matches known greedy solution; DP is possible but less efficient here.

4. Final Answer:

   Use greedy by sorting tasks by earliest finish time to select tasks -> Option A

5. Quick Check:

   Activity selection = greedy by finish time [OK]

Hint: Sort tasks by finish time for max non-overlapping tasks [OK]

Common Mistakes:

• Sorting by start time or duration instead of finish time
• Using DP unnecessarily increasing complexity
• Ignoring greedy choice property in scheduling