- 1. amoshuangyc
- 2. Data Structures
❱
- 2.1. BIT
- 2.2. DSU
- 2.3. LazySegTree
- 2.4. Mint
- 2.5. Prefix Sum
- 2.6. PolyHash
- 2.7. PolyHash2
- 2.8. SegTree
- 2.9. Sparse Table
- 2.10. Treap
- 2.11. Wavelet Matrix
- 3. Algorithms
❱
- 3.1. 2-SAT
- 3.2. Bellman Ford
- 3.3. BFS
- 3.4. Binary Search
- 3.5. CombTool
- 3.6. Dijkstra
- 3.7. Euler Tour
- 3.8. Floyd Warshall
- 3.9. LCA
- 3.10. Linear Congruence
- 3.11. Longest Increasing Subsequence
- 3.12. Monotonic Stack/Deque
- 3.13. Powmod
- 3.14. Prefix2D
- 3.15. Prefix3D
- 3.16. Rerooting
- 3.17. Searching
- 3.18. Sieve of Eratosthenes
- 3.19. Tarjan SCC
- 3.20. Ternary Search
- 3.21. Topological Sort
- 3.22. XorShift
- 4. Topics
❱
- 4.1. 2D Poset
- 4.2. Binary Operations
- 4.3. Bivariate
- 4.4. Digit DP
- 4.5. DP
- 4.6. Eccentricity
- 4.7. Floor and Ceiling
- 4.8. Functional/Permutation Graph
- 4.9. Geometry
- 4.10. Greedy
- 4.11. L1 Distance
- 4.12. Longest Common Prefix
- 4.13. K(-th) Smallest
- 4.14. Knapsack
- 4.15. Multiples/GCD/LCM
- 4.16. Pairwise on Graph/Tree
- 4.17. Pairwise on Sequence
- 4.18. Parenthesis Sequence
- 4.19. Square Number
- 4.20. Segments
- 4.21. Subsequence
- 4.22. Palindrome
- 4.23. Random Hashing
- 4.24. Ring
- 4.25. Sum to X
- 4.26. Unique Elements
- 5. Miscellaneous
❱
- 5.1. Rust Basic
- 5.2. Rotate
- 5.3. Running Length Encoding
- 5.4. Merge 2 Sorted Array
- 5.5. Ordered Float
- 5.6. Bit Operations