dynamic-programming

Dynamic Programming for MCM/ICM competitions. Use for multi-stage decision problems with optimal substructure (knapsack, shortest path, resource allocation, coin change). Breaks complex problems into overlapping subproblems and stores solutions to avoid recomputation.