Getting Started Olympiad C++BdOI Preliminary BdOI National

Dynamic Programming
- Introduction to Dynamic Programming
- Coin Change
- Knapsack DP
- Longest Common Subsequence
- Bitmask DP
- DP on Trees
Graph Traversal
Shortest Paths
- Dijkstra's Algorithm
- Floyd-Warshall Algorithm
Graph Data Structures
- Disjoint Set Union (DSU)
- Minimum Spanning Tree (MST)
Number Theory
Data Structures
- Segment Tree

IOI
BdOI National
Knapsack DP

Knapsack DP

The 0/1 knapsack problem.

Content for this lesson is yet to be written.

© 2025 OlyPrep contributors.