| Id | Name | Done | Resources | Problems | Code | Difficulty |
|---|---|---|---|---|---|---|
| 217 | Segment Tree | 1 | 1 2 | code | 1 | |
| 218 | Segment Tree with Lazy Propagation | 1 | 1 2 | code | 1 | |
| 219 | Persistent Segment Tree | 1 | 1 | code | 1 | |
| 220 | Persistent Segment Tree with Lazy Propagation | 1 | 1 | code | 2 | |
| 221 | Dynamic Segment Tree | 1 | 1 | |||
| 222 | 2D Dynamic Segment Tree | 1 | code | 2 | ||
| 223 | Iterative Segment Tree | 1 | code | 1 | ||
| 224 | Segment Tree ft Arithmetic Progressions | 1 | code | 1 | ||
| 225 | Segment Tree Merging | 1 | 1 | code | 2 | |
| 226 | Segment Tree Beats | 1 | 1 | code | 3 | |
| 227 | Merge Sort Tree | 1 | 1 | 1 | ||
| 228 | Wavelet Tree | 1 | 1 | code | 1 | |
| 229 | Sparse Table | 1 | 1 | code | 1 | |
| 230 | Disjoint Sparse Table | 1 | 1 | code | 2 | |
| 231 | Sparse Table 2D | 1 | 1 | code | 2 | |
| 232 | BIT | 1 | 1 | code | 1 | |
| 233 | Lower bound on BIT | 1 | 1 | 1 | ||
| 234 | BIT with Range Update and Range Query | 1 | code | 2 | ||
| 235 | 2D BIT with Range Update and Range Query | code | 2 | |||
| 236 | MOs Algorithm | 1 2 | 1 | code | 1 | |
| 237 | MOs on Tree | 1 | 1 | code | 2 | |
| 238 | MOs with Update | 1 2 | 1 | code | 2 | |
| 239 | MOs Online | 1 | code | 2 | ||
| 240 | MOs with DSU | 1 2 | code | 2 | ||
| 241 | Sweepline MO | 1 | 3 | |||
| 242 | Trie | 1 | 1 | code | 1 | |
| 243 | Persistent Trie | 1 | 1 | code | 2 | |
| 244 | DSU | 1 | 1 | code | 1 | |
| 245 | Reachability Tree/ DSU Tree | 1 | 1 2 | code | 2 | |
| 246 | DSU with Rollbacks | code | 1 | |||
| 247 | Partially Persistent DSU | 1 | 1 | code | 3 | |
| 248 | Persistent DSU | 1 | code | 3 | ||
| 249 | Augmented DSU | 1 | code | 2 | ||
| 250 | Queue Undo Trick | 1 | 1 2 | code | 3 | |
| 251 | Dynamic Connectivity Problem | 1 | 1 | code | 2 | |
| 252 | DSU on Tree | 1 | 1 | code | 1 | |
| 253 | SQRT Decomposition | 1 | 1 | 1 | ||
| 254 | SQRT Decomposition Split and Build Technique | 1 | code | 3 | ||
| 255 | Centroid Decomposition | 1 | 1 | 1 | ||
| 256 | Persistent Centroid Decomposition | 1 | code | 3 | ||
| 257 | Binarizing a Tree | 1 | code | 1 | ||
| 258 | HLD ft Subtrees and Path Query | 1 2 | 1 | code | 2 | |
| 259 | HLD ft Persistent Lazy Propagation | 1 | code | 3 | ||
| 260 | LCT | 1 | 1 | code | 2 | |
| 261 | Treap | 1 | 1 | code | 2 | |
| 262 | Implicit Treap | 1 | 1 | code | 2 | |
| 263 | Persistent Treap | 1 2 | code | 3 | ||
| 264 | SQRT Tree | 1 | 1 | code | 3 | |
| 265 | KD Tree | 1 | 1 | code | 2 | |
| 266 | Cartesian Tree | 1 | code | 2 | ||
| 267 | Rope | 1 | 1 | 1 | ||
| 268 | Monotonous Queue | 1 | 1 | code | 1 | |
| 269 | BST using STL | 1 | code | 1 | ||
| 270 | Persistent BST | 1 | 3 | |||
| 271 | Ordered Set | 1 2 | 1 | code | 1 | |
| 272 | Static to Dynamic Trick | 1 2 | code | 2 | ||
| 273 | Interval Set | code | 2 | |||
| 274 | Divide and Conquer on Queries | 1 | 2 | |||
| 275 | Divide and Conquer for Insert and Query Problems | 1 | 1 | code | 2 | |
| 276 | Venice Technique | 1 | 1 | code | 1 | |
| 277 | Permutation Tree | 1 | code | 3 | ||
| 278 | Persistent Array | 1 | code | 1 | ||
| 279 | Persistent Queue | 1 | code | 3 | ||
| 280 | Persistent Meldable Heap | 1 | 1 | code | 2 | |
| 281 | Top Tree | 1 | 1 | code | 3 | |
| 282 | PQ Tree | 1 | 1 | 3 | ||
| 283 | Link Cut Cactus | 1 | 3 | |||
| 284 | HDLT | 1 | 3 |