todo - line tree https://codeforces.com/blog/entry/71568?#comment-559304 - rurq BIT: is lower_bound possible? - chordal graph https://judge.yosupo.jp/problem/chordal_graph_recognition - ultimate NTT https://codeforces.com/blog/entry/75326 - Multipoint Evaluation with Polynomial Division https://github.com/e-maxx-eng/e-maxx-eng-aux/blob/master/src/polynomial.cpp https://cp-algorithms.com/algebra/polynomial.html - online static point-in-polygon O(log) https://codeforces.com/blog/entry/107901 - Euler's Planar Graph Formula (add to hackpack) - basis of matrix https://judge.yosupo.jp/problem/system_of_linear_equations - 2D matching - min25 sieve https://codeforces.com/blog/entry/92703 - formulas to hackpack [add formulas to hackpack #478](https://github.com/lrvideckis/programming_team_code/issues/478) - Mos on Tree - Online Bridge Finding not todo - 2D data structures (like [seg tree](https://github.com/ShahjalalShohag/code-library/blob/master/Data%20Structures/Segment%20Tree%202D%20Dynamic.cpp), [sparse table](https://codeforces.com/blog/entry/45485) etc) - [2-sat](https://github.com/kth-competitive-programming/kactl/blob/main/content/graph/2sat.h) - [bitwise convolution (and,or,xor)](https://github.com/kth-competitive-programming/kactl/blob/main/content/numerical/FastSubsetTransform.h) - [Chinese Remainder Theorem](https://github.com/kth-competitive-programming/kactl/blob/main/content/number-theory/CRT.h) - [Convex Hull Trick](https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/LineContainer.h) - [Dinic](https://github.com/ucf-programming-team/hackpack-cpp/blob/lightseba-general-changes/content/graphs/SebaDinic.h) - [Directed MST](https://github.com/kth-competitive-programming/kactl/blob/main/content/graph/DirectedMST.h) - [Disjoint set](https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/UnionFind.h) - [Dominator Tree](https://github.com/ucf-programming-team/hackpack-cpp/blob/master/content/graphs/DominatorTree.h) - [Fast Fourier transform](https://github.com/kth-competitive-programming/kactl/blob/main/content/numerical/FastFourierTransform.h) - [fast IO](https://github.com/nealwu/competitive-programming/blob/master/io/io.cc) - I've never TLE'd specifically from IO slowness while using both cin.tie(0)->sync_with_stdio(0); and '\n' - [Floyd Warshall](https://github.com/kth-competitive-programming/kactl/blob/main/content/graph/FloydWarshall.h) - [Geometry](https://github.com/kth-competitive-programming/kactl/tree/main/content/geometry) - [Half Plane Intersection](https://github.com/ucf-programming-team/hackpack-cpp/blob/lightseba-general-changes/content/geometry/halfPlane.h) - [Hilbert Mo](https://github.com/ucf-programming-team/hackpack-cpp/blob/lightseba-general-changes/content/misc/HilbertMos.h) - [Interval container](https://github.com/kth-competitive-programming/kactl/blob/main/content/various/IntervalContainer.h) - [KD BIT](https://github.com/ucf-programming-team/hackpack-cpp/blob/master/content/data-structures/KDBIT.h) - [Longest Increasing Subsequence](https://github.com/kth-competitive-programming/kactl/blob/main/content/various/LIS.h) - [Manacher's](https://github.com/kth-competitive-programming/kactl/blob/main/content/strings/Manacher.h) - [Matrix Operations](https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/Matrix.h) - [Miller Rabin](https://github.com/kth-competitive-programming/kactl/blob/main/content/number-theory/MillerRabin.h) - [Non-lazy seg tree](https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/SegmentTree.h) - [polynomial stuff](https://cp-algorithms.com/algebra/polynomial.html) - [queue with get max](https://github.com/ucf-programming-team/hackpack-cpp/blob/lightseba-general-changes/content/data-structures/MonotonicQueue.h) - [seg tree beats](https://codeforces.com/blog/entry/57319) - [sqrt decomposition](https://github.com/nealwu/competitive-programming/blob/master/sqrt/search_buckets.cc) (search buckets) - [string hashing](https://github.com/kth-competitive-programming/kactl/blob/main/content/strings/Hashing.h) - [string rotational equivalence](https://github.com/kth-competitive-programming/kactl/blob/main/content/strings/MinRotation.h) - [Sum Over Subsets with Convolution](https://github.com/ucf-programming-team/hackpack-cpp/blob/lightseba-general-changes/content/numerical/SumOverSubsets.h) - [Treap](https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/Treap.h) - [Z function](https://github.com/kth-competitive-programming/kactl/blob/main/content/strings/Zfunc.h) - bits/extc++.h stuff [order statistics tree](https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/OrderStatisticTree.h), [faster hashmap](https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/HashMap.h) - [aho](https://github.com/kth-competitive-programming/kactl/blob/main/content/strings/AhoCorasick.h) - suffix tree - li chao tree - suffix automaton - hungarian with sparse adj list
todo
not todo