Read: Greedy Algorithms
Start with the chapter spine
Open practice dock
Drills and weak-topic replay
Study library
Search all imported chapters
Advanced Algorithms
Continue from the last thing you actually touched, instead of hunting through the registry again.
ContinueNo assignments matching your criteria.
Try a broader filter or jump back to the course hub to browse the full assignment set.
Greedy Algorithms
Deep dive into patterns and axioms.
Matroid Theory — Definition, Examples, Greedy Algorithm on Matroids
Deep dive into patterns and axioms.
Dynamic Programming
Deep dive into patterns and axioms.
Network Flow — Ford-Fulkerson, Max-Flow Min-Cut, Applications
Deep dive into patterns and axioms.
Applications of Network Flow
Deep dive into patterns and axioms.
String Algorithms — KMP, Rabin-Karp, and Pattern Matching
Deep dive into patterns and axioms.
NP-Completeness — P, NP, NP-Hard, Reductions
Deep dive into patterns and axioms.
Approximation Algorithms
Deep dive into patterns and axioms.
Randomized Algorithms
Deep dive into patterns and axioms.
Advanced Data Structures — Segment Trees, Fenwick Trees, Disjoint Sets
Deep dive into patterns and axioms.
Exact Algorithms — Branch & Bound, DP for TSP, Local Search
Deep dive into patterns and axioms.
Online and Parallel Algorithms
Deep dive into patterns and axioms.
Parameterized Algorithms
Deep dive into patterns and axioms.