Why Activity Selection Problem in DSA Rust?

The Big Idea

What if you could instantly pick the perfect schedule without trying every option?

The Scenario

Imagine you have a list of meetings to attend in a day, each with a start and end time. You want to attend as many meetings as possible without any overlap. Doing this by checking every possible combination manually is like trying to solve a huge puzzle without a picture.

The Problem

Manually checking all meeting combinations is slow and confusing. You might miss the best set of meetings or waste time trying every option. It's easy to make mistakes and get tired, especially when the list is long.

The Solution

The Activity Selection Problem uses a smart way to pick meetings. By sorting meetings by their finish times and always choosing the earliest finishing meeting next, you quickly find the maximum number of meetings you can attend without overlap.

Before vs After

✗ Before

let mut max_meetings = 0;
for i in 0..n {
    for j in i+1..n {
        if meetings[i].end <= meetings[j].start {
            max_meetings += 1;
        }
    }
}

✓ After

meetings.sort_by_key(|m| m.end);
let mut count = 1;
let mut last_end = meetings[0].end;
for meeting in &meetings[1..] {
    if meeting.start >= last_end {
        count += 1;
        last_end = meeting.end;
    }
}

What It Enables

This concept lets you quickly and correctly find the largest number of non-overlapping activities you can do, saving time and effort.

Real Life Example

Scheduling conference talks to attend without missing any, or booking meeting rooms efficiently so no two meetings clash.

Key Takeaways

Manual checking of all activity combinations is slow and error-prone.

Sorting by finish time and greedy selection solves the problem efficiently.

Enables maximum use of available time without conflicts.

Practice

1. What is the main goal of the Activity Selection Problem?

easy

A. Calculate the total duration of all activities

B. Select the maximum number of activities that don't overlap in time

C. Sort activities by their start time

D. Find the activity with the longest duration

Solution

1. Step 1: Understand the problem objective

   The Activity Selection Problem aims to choose the largest set of activities that do not overlap in their time intervals.

2. Step 2: Identify the correct goal

   Among the options, only selecting the maximum number of non-overlapping activities matches the problem's goal.

3. Final Answer:

   Select the maximum number of activities that don't overlap in time -> Option B

4. Quick Check:

   Goal = Max non-overlapping activities [OK]

Hint: Focus on maximizing non-overlapping activities [OK]

Common Mistakes:

• Confusing longest duration with maximum count
• Sorting by start time only
• Summing durations instead of counting activities

2. Which Rust code snippet correctly sorts a vector of activities by their finish time? Assume each activity is a tuple (start: i32, finish: i32).

easy

A. activities.sort_by_key(|a| a.1);

B. activities.sort_by_key(|a| a.0);

C. activities.sort_unstable_by(|a, b| b.1.cmp(&a.1));

D. activities.sort_by(|a, b| a.0.cmp(&b.0));

Solution

1. Step 1: Identify sorting key for finish time

   Each activity is a tuple (start, finish). The finish time is at index 1.

2. Step 2: Choose correct sorting method

   Sorting by finish time ascending uses sort_by_key(|a| a.1). activities.sort_by_key(|a| a.1); matches this.

3. Final Answer:

   activities.sort_by_key(|a| a.1); -> Option A

4. Quick Check:

   Sort by finish time = a.1 [OK]

Hint: Sort activities by finish time using .sort_by_key(|a| a.1) [OK]

Common Mistakes:

• Sorting by start time instead of finish time
• Sorting in descending order incorrectly
• Using unstable sort unnecessarily

3. What is the output of the following Rust code that implements the activity selection logic?

let mut activities = vec![(1, 4), (3, 5), (0, 6), (5, 7), (8, 9), (5, 9)];
activities.sort_by_key(|a| a.1);
let mut selected = vec![activities[0]];
let mut last_finish = activities[0].1;
for &activity in &activities[1..] {
    if activity.0 >= last_finish {
        selected.push(activity);
        last_finish = activity.1;
    }
}
println!("{:?}", selected);

medium

A. [(1, 4), (3, 5), (5, 7), (8, 9)]

B. [(0, 6), (5, 7), (8, 9)]

C. [(1, 4), (5, 7), (8, 9)]

D. [(1, 4), (5, 9)]

Solution

1. Step 1: Sort activities by finish time

   Sorted activities: [(1,4), (3,5), (0,6), (5,7), (8,9), (5,9)]

2. Step 2: Select activities greedily

   Start with (1,4). Next, (3,5) starts before 4, skip. (0,6) starts before 4, skip. (5,7) starts at 5 ≥ 4, select. (8,9) starts at 8 ≥ 7, select. (5,9) starts at 5 < 7, skip.

3. Final Answer:

   [(1, 4), (5, 7), (8, 9)] -> Option C

4. Quick Check:

   Greedy selection = [(1,4),(5,7),(8,9)] [OK]

Hint: Pick earliest finishing activities that start after last finish [OK]

Common Mistakes:

• Selecting overlapping activities
• Not sorting by finish time first
• Including activities starting before last finish

4. Identify the bug in this Rust code snippet for the Activity Selection Problem:

let mut activities = vec![(1, 3), (2, 5), (4, 7)];
activities.sort_by_key(|a| a.0);
let mut selected = vec![activities[0]];
let mut last_finish = activities[0].1;
for &activity in &activities[1..] {
    if activity.0 > last_finish {
        selected.push(activity);
        last_finish = activity.1;
    }
}
println!("{:?}", selected);

medium

A. Using > instead of >= in the if condition

B. Not pushing the first activity into selected

C. Not initializing last_finish correctly

D. Sorting by start time instead of finish time

Solution

1. Step 1: Check sorting criteria

   The code sorts activities by start time (a.0), but the greedy approach requires sorting by finish time.

2. Step 2: Understand impact of sorting

   Sorting by start time breaks the greedy logic, causing incorrect selection of activities.

3. Final Answer:

   Sorting by start time instead of finish time -> Option D

4. Quick Check:

   Sort by finish time needed, not start time [OK]

Hint: Always sort activities by finish time, not start time [OK]

Common Mistakes:

• Sorting by start time
• Using strict > instead of >= (less critical)
• Incorrect initialization of last_finish

5. Given a list of activities with start and finish times, how would you modify the standard Activity Selection Problem to select activities that maximize total duration instead of count? Which approach is correct?

hard

A. Use dynamic programming to consider all subsets and maximize total duration

B. Sort activities by start time and greedily pick those with longest duration

C. Sort by finish time and pick activities with shortest duration first

D. Select activities randomly and check total duration

Solution

1. Step 1: Understand difference in optimization goal

   Maximizing total duration is different from maximizing count; greedy approach fails here.

2. Step 2: Choose correct algorithmic approach

   Dynamic programming can consider all subsets to find the maximum total duration without overlaps.

3. Final Answer:

   Use dynamic programming to consider all subsets and maximize total duration -> Option A

4. Quick Check:

   Max total duration needs DP, not greedy [OK]

Hint: Max duration needs DP, not greedy selection [OK]

Common Mistakes:

• Trying greedy for max duration
• Sorting by start time only
• Random selection without logic