Greedy vs DP How to Know Which to Apply in DSA Rust - Visual Comparison

Concept Flow - Greedy vs DP How to Know Which to Apply

Start Problem

↓

Check if problem has optimal substructure?

Yes↓

Check if problem has overlapping subproblems?

↓

Use DP approach

↓

Build solution step-by-step

↓

End

Decide approach by checking if problem has optimal substructure and overlapping subproblems. Use DP if both exist, else greedy.

Execution Sample

DSA Rust

fn choose_approach(opt_sub: bool, overlap_sub: bool) -> &'static str {
    if opt_sub {
        if overlap_sub {
            "DP"
        } else {
            "Greedy"
        }
    } else {
        "Neither"
    }
}

Function decides approach based on optimal substructure and overlapping subproblems flags.

Execution Table

Step	Operation	Optimal Substructure	Overlapping Subproblems	Decision	Reasoning
1	Start problem analysis	Unknown	Unknown	None	Need to check properties
2	Check optimal substructure	True	Unknown	None	Problem can be broken into subproblems
3	Check overlapping subproblems	True	True	DP	Both conditions met, use DP
4	Build solution with DP	True	True	DP	Use memoization or tabulation
5	End	True	True	DP	Finished with DP approach

💡 Decision made based on properties: DP chosen because both optimal substructure and overlapping subproblems are true

Variable Tracker

Variable	Start	After Step 2	After Step 3	Final
opt_sub	Unknown	True	True	True
overlap_sub	Unknown	Unknown	True	True
decision	None	None	DP	DP

Key Moments - 3 Insights

Why do we check for optimal substructure first?

Because without optimal substructure, neither greedy nor DP will work well. Execution table step 2 shows this check.

What if overlapping subproblems is false but optimal substructure is true?

Then greedy approach is preferred as shown in the concept flow where overlapping subproblems false leads to greedy.

Can we use DP if overlapping subproblems is false?

No, DP relies on overlapping subproblems to reuse solutions. Execution table step 3 clarifies this.

Visual Quiz - 3 Questions

Look at the execution table, what is the decision at step 3?

A Neither

B Greedy

C DP

D Unknown

💡 Hint

Check the 'Decision' column at step 3 in the execution table

At which step do we confirm overlapping subproblems is true?

A Step 3

B Step 2

C Step 4

D Step 1

💡 Hint

Look at the 'Overlapping Subproblems' column in the execution table

If overlapping subproblems was false but optimal substructure true, which approach would be chosen?

A DP

B Greedy

C Neither

D Random

💡 Hint

Refer to the concept flow where overlapping subproblems false leads to greedy

Concept Snapshot

Check if problem has optimal substructure:
- If no, neither greedy nor DP applies
- If yes, check overlapping subproblems:
  - If yes, use DP (store and reuse solutions)
  - If no, use greedy (make best local choice)
DP is for problems with overlapping subproblems and optimal substructure
Greedy is simpler but only works if local choices lead to global optimum

Full Transcript

To decide between greedy and dynamic programming (DP), first check if the problem has optimal substructure, meaning the problem can be broken down into smaller subproblems whose solutions build up the final answer. If this is false, neither greedy nor DP will work well. If optimal substructure is true, next check if the problem has overlapping subproblems, meaning the same subproblems appear multiple times. If overlapping subproblems are true, DP is the right choice because it stores and reuses solutions to subproblems. If overlapping subproblems are false, greedy approach is preferred because making the best local choice leads to the global optimum. This decision flow helps pick the right approach for solving optimization problems efficiently.

Practice

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

easy

A. When the problem has overlapping subproblems and no optimal substructure

B. When the problem has an optimal substructure and no overlapping subproblems

C. When the problem requires checking all possible solutions

D. When the problem is unsolvable

Solution

1. Step 1: Understand greedy algorithm conditions

   Greedy algorithms work when choosing the best option at each step leads to a global optimum, which means the problem has an optimal substructure and no overlapping subproblems.

2. Step 2: Compare with dynamic programming conditions

   Dynamic programming is used when the problem has overlapping subproblems and optimal substructure, requiring storing intermediate results.

3. Final Answer:

   When the problem has an optimal substructure and no overlapping subproblems -> Option B

4. Quick Check:

   Greedy = optimal substructure + no overlap [OK]

Hint: Use greedy if no overlapping subproblems exist [OK]

Common Mistakes:

• Confusing overlapping subproblems as a greedy condition
• Using DP when greedy suffices
• Assuming greedy always finds optimal solution
• Ignoring problem structure before choosing approach

2. Which Rust code snippet correctly declares a vector and uses it to implement a greedy approach for selecting intervals sorted by end time?

easy

A. let intervals = vec![(1,3), (2,5), (4,7)]; intervals.reverse();

B. let intervals = vec![(1,3), (2,5), (4,7)]; intervals.sort();

C. let mut intervals = vec![(1,3), (2,5), (4,7)]; intervals.sort_by(|a,b| a.0.cmp(&b.0));

D. let mut intervals = vec![(1,3), (2,5), (4,7)]; intervals.sort_by_key(|k| k.1);

Solution

1. Step 1: Identify correct vector declaration and sorting

   let mut intervals = vec![(1,3), (2,5), (4,7)]; intervals.sort_by_key(|k| k.1); declares a mutable vector and sorts it by the second element (end time), which is needed for greedy interval scheduling.

2. Step 2: Check other options for correctness

   let intervals = vec![(1,3), (2,5), (4,7)]; intervals.sort(); tries to sort an immutable vector and uses default sort (by first element), let mut intervals = vec![(1,3), (2,5), (4,7)]; intervals.sort_by(|a,b| a.0.cmp(&b.0)); sorts by start time, not end time, and let intervals = vec![(1,3), (2,5), (4,7)]; intervals.reverse(); reverses without sorting.

3. Final Answer:

   let mut intervals = vec![(1,3), (2,5), (4,7)]; intervals.sort_by_key(|k| k.1); -> Option D

4. Quick Check:

   Sort intervals by end time with mutable vector [OK]

Hint: Sort intervals by end time for greedy scheduling [OK]

Common Mistakes:

• Sorting by start time instead of end time
• Using immutable vector when sorting is needed
• Not sorting intervals before greedy selection
• Using reverse instead of sort

3. What is the output of the following Rust code implementing a greedy approach to select maximum intervals?

let mut intervals = vec![(1,3), (2,5), (4,7)];
intervals.sort_by_key(|k| k.1);
let mut count = 0;
let mut end = 0;
for &(start, finish) in &intervals {
    if start >= end {
        count += 1;
        end = finish;
    }
}
println!("{}", count);

medium

A. 2

B. 3

C. 1

D. 0

Solution

1. Step 1: Sort intervals by end time

   Sorted intervals: (1,3), (2,5), (4,7)

2. Step 2: Iterate and count non-overlapping intervals

   First interval (1,3): start=1 >= end=0, count=1, end=3 Second interval (2,5): start=2 < end=3, skip Third interval (4,7): start=4 >= end=3, count=2, end=7

3. Final Answer:

   2 -> Option A

4. Quick Check:

   Greedy interval count = 2 [OK]

Hint: Count intervals where start >= last end [OK]

Common Mistakes:

• Counting overlapping intervals
• Not updating end after selection
• Sorting incorrectly
• Confusing start and end values

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

let coins = vec![1, 3, 4];
let mut amount = 6;
let mut count = 0;
for &coin in coins.iter().rev() {
    while amount >= coin {
        amount -= coin;
        count += 1;
    }
}
println!("{}", count);

medium

A. The amount variable is not mutable

B. The coins vector is not sorted ascending

C. Greedy fails because coin denominations do not guarantee optimal solution

D. The loop should not reverse the coins vector

Solution

1. Step 1: Understand greedy coin change limitation

   Greedy works only if coin denominations are canonical (like 1,5,10). Here, 1,3,4 can cause greedy to fail.

2. Step 2: Check code behavior

   Greedy picks 4 once (amount=2), then picks 1 twice (total 3 coins). But optimal is 2 coins (3+3).

3. Final Answer:

   Greedy fails because coin denominations do not guarantee optimal solution -> Option C

4. Quick Check:

   Greedy fails on non-canonical coins [OK]

Hint: Greedy fails if coin set is not canonical [OK]

Common Mistakes:

• Assuming greedy always works for coin change
• Ignoring coin order importance
• Not checking for optimal substructure
• Confusing mutability of variables

5. You want to find the minimum number of coins to make amount 6 using coins [1, 3, 4]. Which approach is best and why? A) Greedy picking largest coin first B) Brute force checking all combinations C) Dynamic programming storing minimum coins for each amount D) Sorting coins ascending and picking smallest first

hard

A. Dynamic programming storing minimum coins for each amount

B. Brute force checking all combinations

C. Greedy picking largest coin first

D. Sorting coins ascending and picking smallest first

Solution

1. Step 1: Analyze greedy approach limitations

   Greedy may pick 4 then 1s, resulting in 3 coins, but optimal is 2 coins (3+3).

2. Step 2: Understand dynamic programming advantage

   DP stores minimum coins needed for each amount, ensuring optimal solution even with tricky coin sets.

3. Step 3: Compare other options

   Brute force is slow; sorting ascending and picking smallest first is not optimal strategy.

4. Final Answer:

   Dynamic programming storing minimum coins for each amount -> Option A

5. Quick Check:

   DP handles overlapping subproblems for optimal coin count [OK]

Hint: Use DP for minimum coins with tricky denominations [OK]

Common Mistakes:

• Using greedy for non-canonical coin sets
• Ignoring performance of brute force
• Assuming sorting smallest first helps
• Not recognizing overlapping subproblems