# CodeBook
---
## [CSES Problem Set](https://hackmd.io/@revcoding/rJDjNBFJ_)
- [Sorting and Searching](https://hackmd.io/@revcoding/rJDjNBFJ_#Sorting-and-Searching)
- [Dynamic Programming](https://hackmd.io/@revcoding/rJDjNBFJ_#Dynamic-Programming)
- [Range Queries](https://hackmd.io/@revcoding/rJDjNBFJ_#Range-Queries)
- [Tree Algorithms](https://hackmd.io/@revcoding/rJDjNBFJ_#Tree-Algorithms)
- [Graph Algorithms](https://hackmd.io/@revcoding/rJDjNBFJ_#Graph-Algorithms)
## [Sorting and Searching](https://hackmd.io/@revcoding/Bk1UclDJO)
- [Sorting theory](https://hackmd.io/@revcoding/Bk1UclDJO#Sorting-theory)
- [Sorting in C++](https://hackmd.io/@revcoding/Bk1UclDJO#Sorting-in-C)
- [Binary Search](https://hackmd.io/@revcoding/Bk1UclDJO#Binary-Search)
- [Complete Search](https://hackmd.io/@revcoding/Bk1UclDJO#Complete-Search)
## [Data Structures](https://hackmd.io/@revcoding/S1ciwNd1d)
- [Dynamic Arrays](https://hackmd.io/@revcoding/S1ciwNd1d#Dynamic-Arrays)
- [Set Structures](https://hackmd.io/@revcoding/S1ciwNd1d#Set-Structures)
- [Map Structures](https://hackmd.io/@revcoding/S1ciwNd1d#Map-Structures)
- [Policy-based data structures](https://hackmd.io/@revcoding/S1ciwNd1d#Policy-based-data-structures)
- [Priority_queue](https://hackmd.io/@revcoding/S1ciwNd1d#Priority_queue)
- [Fenwick Tree](https://hackmd.io/@revcoding/S1ciwNd1d#Fenwick-Tree)
- [Segment Tree](https://hackmd.io/@revcoding/S1ciwNd1d#Segment-Tree)
- [Disjoint-set (DSU)](https://hackmd.io/@revcoding/S1ciwNd1d#Disjoint-set-DSU)
## [Greedy](https://hackmd.io/@revcoding/By3_MDmG_)
- [Coin problem](https://hackmd.io/@revcoding/By3_MDmG_#Coin-problem)
- [Scheduling](https://hackmd.io/@revcoding/By3_MDmG_#Scheduling)
- [Tasks and deadlines](https://hackmd.io/@revcoding/By3_MDmG_#Tasks-and-deadlines)
## [Dynamic Programming](https://hackmd.io/@revcoding/r1F-TUO4_)
- [Edit Distance](https://hackmd.io/@revcoding/r1F-TUO4_#Edit-Distance)
- [0/1 KnapSack](https://hackmd.io/@revcoding/r1F-TUO4_#01-KnapSack)
## [Graph Algorithm](https://hackmd.io/@revcoding/SkM7bS2N_)
- [Minimum-Spanning-Tree](https://hackmd.io/@revcoding/SkM7bS2N_#Minimum-Spanning-Tree)
- [Shortest Path](https://hackmd.io/@revcoding/SkM7bS2N_#Shortest-Path)
## [Tree Algorithm](https://hackmd.io/@revcoding/SkHHj3BHO)
- [Tree Diameter](https://hackmd.io/@revcoding/SkHHj3BHO#Tree-Diameter)
- [LCA (Lowest Common Acenstor)](https://hackmd.io/@revcoding/SkHHj3BHO#LCA-Lowest-Common-Ancestor)
---
>[color=#0ff00f][name=revcoding]
{"metaMigratedAt":"2023-06-15T16:23:22.910Z","metaMigratedFrom":"Content","title":"CodeBook","breaks":true,"contributors":"[{\"id\":\"f6e5d959-6236-46bd-9933-dbc93eaee9e0\",\"add\":3021,\"del\":535}]"}