Loading repovive.com/roadmaps/greedy-algorithms
Roadmaps
Greedy Algorithms
Activity Selection
Problemset
Discussion
AI Helper
Introduction to Greedy
0/36
Proving Greedy Correctness
0/42
Activity Selection
0/43
1
Intro
2
Problem - Activity Selection
3
Trying the Example
4
Wrong Approach 1 - Earliest Start
5
Wrong Approach 2 - Shortest Duration
6
Wrong Approach 3 - Fewest Conflicts
7
The Correct Approach
8
Quiz: Sort Order
9
The Algorithm
10
Walkthrough
11
Implementation
12
Proof Overview
13
Proof Step 1 - First Activity
14
Proof Step 2 - Induction
15
Proof Step 3 - Conclusion
16
Quiz: Exchange Argument
17
Lessons from Activity Selection
18
Problem - N Meetings in One Room
19
Problem - Non-overlapping Intervals
20
Non-overlapping - Walkthrough
21
Non-overlapping - Implementation
22
Quiz: Problem Transformation
23
Problem - Minimum Arrows
24
Minimum Arrows - The Idea
25
Minimum Arrows - Algorithm
26
Minimum Arrows - Walkthrough
27
Minimum Arrows - Implementation
28
Comparing the Three Problems
29
Handling Edge Cases
30
Quiz: Edge Cases
31
Variant - Weighted Activity Selection
32
Why Weighted Needs DP
33
Problem - Meeting Rooms I
34
Meeting Rooms I - Algorithm
35
Problem - Meeting Rooms II
36
Meeting Rooms II - Approach 1
37
Meeting Rooms II - Walkthrough
38
Meeting Rooms II - Approach 2
39
Meeting Rooms II - Implementation
40
Quiz: Meeting Rooms II
41
Activity Selection vs Meeting Rooms
42
What is Next
43
Section Recap
Interval Problems
0/44
Array Greedy Problems
0/41
Greedy Optimization
0/38
Advanced Greedy
0/37
Practice Problems
0/35
3.1
Intro
2 minutes
100%
Tasks
Read Unit