Topics

20

Duration

40 Weeks

Progress

0/20

Learning Progress0%
Competitive Programming Roadmap

Greedy Algorithms

Learning Path

Follow these concepts in order to master this topic.

1
Introduction to Greedy Algorithms
2
Greedy Choice Property
3
Optimal Substructure
4
When Greedy Works
5
Sorting-Based Greedy
6
Interval Scheduling
7
Activity Selection
8
Fractional Knapsack
9
Jop Sequencing
10
Minimum Platforms
11
Coin Change (Greedy vs Dynamic Programming)
12
Huffman Coding
13
Minimum Spanning Tree (Greedy Preview)
14
Exchange Argument
15
Proof of Correctness
16
Recognizing Greedy Problems
17
Common Greedy Patterns
18
Greedy Pitfalls
19
Greedy in Competitive Programming
20
Contest Problem Solving

Practice Websites

Practice what you've learned.

Projects

Apply what you've learned by building real projects.

Implement 10 Classic Greedy Algorithms
Beginner
Solve 50 Greedy Programming Problems
Intermediate
Build a Greedy Algorithm Cheat Sheet with Proofs
Advanced

Tools

Recommended tools for this topic.