Technical interview guide
Greedy Algorithms
Making the locally-best choice at each step and never revisiting it — correct only when the problem has the right structural guarantee.
- Read
- 42 min
- Practice MCQs
- 25
- Interview QA
- 25
- Edition
- v7
- Editorial status
- Reviewed
Scope: Language-neutral, with sorting and priority-queue behaviour cited from CPython 3.14.
Curated: · Written: · Reviewed:
