HackMD
Greedy Algorithm Study Guide
Selection Problems
Problems where the algorithm must make a series of choices, selecting the best option at each step.
- 🟨 134. Gas Station [Solution]
- 🟥 502. IPO [Solution]
Optimization Problems
Problems that involve finding the best solution among a set of possible solutions.
- 🟨 1509. Minimum Difference Between Largest and Smallest Value in Three Moves [Solution]
- 🟨 3218. Minimum Cost for Cutting Cake I [Solution]
- 🟥 3219. Minimum Cost for Cutting Cake II [Solution]
- 🟨 3228. Maximum Number of Operations to Move Ones to the End [Solution]
Matching Problems
Problems involving pairing or assigning elements from different sets.
Graph Problems
Problems that involve graph structures and can be solved using greedy approaches.
Matrix Problems
A subset of graph problems dealing with 2D matrices.
Traversal Problems
Problems that involve moving through a structure in a specific manner.
Sequential Decision Problems
Problems where decisions must be made in sequence, with each decision affecting future options.
Problem Difficulty Legend
- 🟩 Easy
- 🟨 Medium
- 🟧 Medium-Hard
- 🟥 Hard
- ⬛ Very Hard
