- DP32
- DFS15
- DSU11
- Binary Search11
- Prefix Sum9
- Math9
- BFS8
- Tree DP7
- Fenwick Tree4
- Constructive4
- Bitmask4
- Simulation3
- Meet-in-the-Middle3
- Manacher3
- Sliding Window2
- Suffix Sum2
- Bitmask DP2
- Linear Sieve2
- Extended Dijkstra2
- Max Flow2
- Bipartite Graph2
- 0-1 BFS2
- Meet-in-the-middle1
- Doubling1
- Binary Lifting1
- Function Exponentiation1
- LCA1
- Time‐Sweep1
- Warshall-Floyed1
- Dynamic ModInt1
- Grouped DP1
- Floyd-Warshall1
- Modular exponentiation1
- Column Addition1
- Expectation DP1
- Divide and Conquer1
- Max Coverage1
- LCP1
- Range Update1
- Bell Number1
- Group DP1
- Dijkstra1
- Lazy Segment Tree1
- Z Algorithm1
- Palindrome1
- Range DP1
- Greedy1
- Bottom-Up DP1
- Expected Value Optimization1
- Path DP1
- Trie1
- Dynamic Segment Tree1
- Multi-source BFS1
- Combination1
- Digit DP1
- Fast Fourier Transform1
- Number Theory1
- Bitwise1
- LPS1