-
To Solve
-
To Study
- Suffix Array
- BFS (1)
- Treap Data Strutcure
- DFS & BFS on Grid (Matrix) (1)
- Bitmasks (1)
- Dijkstra (2)
- DSU (1)
- Topological Sorting (2)
- Hamiltonian path (DP)(2)
- Floyd Warshall Algorithm (3)
- Prim Algorithm (3)
- Kruskal Algorithm (3)
- Johnson’s Algorithm (4)
- Dinic's Algorithm (4)
- Dynamic Programming Over Subsets (3)
- Bitmasks DP (3)
- Ford Fulkerson's Algorithm (2)
- Square Root decomposition (3)
- Tarjan's Algorithm (4)
- Edmonds-Karp's Algorithm (4)
- Hierholzer's Algorithm (Euler Tour Construction) (4)
- K Dimensional Tree (4)
- Segment Tree & Lazy Propagation (2)
- Trie (1)
- Union-Find algorithm using path-compression (3)
- LCA & RMQ (DP) (3)
- Maximum Empty Rectangle (DP) (4)
- Suffix Tree (3)
- Sparse Table (3)
- Interval Tree (4)
- Fenwick Tree (2)
- Manacher’s Algorithm (4)
- KMP Algorithm (2)
- Z Algorithm (4)
- Sieve of Atkin (X)
- Fermat's Little Theorem (X)
- Chinese Remainder Theorem (X)
- Euler's Theorem (X)