Name	Name	Last commit message	Last commit date
Latest commit History 284 Commits
2 Closest Points in 2D Plane (N log^2 N).cpp	2 Closest Points in 2D Plane (N log^2 N).cpp
2 Pointers (Two Pointers).cpp	2 Pointers (Two Pointers).cpp
2-SAT.cpp	2-SAT.cpp
Algebra.cpp	Algebra.cpp
Articulation Points.cpp	Articulation Points.cpp
BFS 2D.cpp	BFS 2D.cpp
BFS.cpp	BFS.cpp
BIT - Binary Indexed Tree (Fenwick Tree).cpp	BIT - Binary Indexed Tree (Fenwick Tree).cpp
Biconnected Components (Online Bridge).cpp	Biconnected Components (Online Bridge).cpp
Bitset.cpp	Bitset.cpp
Bridge Tree in Graph.cpp	Bridge Tree in Graph.cpp
Bridges in Graph.cpp	Bridges in Graph.cpp
Centroid Decomposition.cpp	Centroid Decomposition.cpp
Convex Hull (Dynamic).cpp	Convex Hull (Dynamic).cpp
Convex Hull (Graham's Scan).cpp	Convex Hull (Graham's Scan).cpp
DFS - Cycle Detection in Directed Graph.cpp	DFS - Cycle Detection in Directed Graph.cpp
DSU (Disjoint Set Union).cpp	DSU (Disjoint Set Union).cpp
DSU On Trees.cpp	DSU On Trees.cpp
Digit DP.cpp	Digit DP.cpp
Dijkstra.cpp	Dijkstra.cpp
Discrete Logarithm.cpp	Discrete Logarithm.cpp
Euler Path.cpp	Euler Path.cpp
Extended Euclidean Algorithm (Extensive).cpp	Extended Euclidean Algorithm (Extensive).cpp
Extra	Extra
Extra.cpp	Extra.cpp
FFT (Iterative).cpp	FFT (Iterative).cpp
FFT (Recursive).cpp	FFT (Recursive).cpp
FFT Applications.cpp	FFT Applications.cpp
Factorials with nCr.cpp	Factorials with nCr.cpp
Floyd Warshall.cpp	Floyd Warshall.cpp
Gaussian Elimination.cpp	Gaussian Elimination.cpp
Geometry.cpp	Geometry.cpp
Grundy Number (Nim Game).cpp	Grundy Number (Nim Game).cpp
Hashing (Strings).cpp	Hashing (Strings).cpp
Heavy Light Decomposition (HLD).cpp	Heavy Light Decomposition (HLD).cpp
Intervals Handling.cpp	Intervals Handling.cpp
KMP.cpp	KMP.cpp
Kruskal's MST.cpp	Kruskal's MST.cpp
LCA (with Time Traversal DFS).cpp	LCA (with Time Traversal DFS).cpp
Logical CF Problems.cpp	Logical CF Problems.cpp
Matching (Hopcroft-Karp) in Bipartite Graph.cpp	Matching (Hopcroft-Karp) in Bipartite Graph.cpp
Matrix Struct.cpp	Matrix Struct.cpp
MaxFlow - Push Relabel [V^2 sqrt(E)].cpp	MaxFlow - Push Relabel [V^2 sqrt(E)].cpp
MaxFlow - Push Relabel [V^3].cpp	MaxFlow - Push Relabel [V^3].cpp
Min Cost Max Flow - Dijkstra.cpp	Min Cost Max Flow - Dijkstra.cpp
Mo's Algorithm.cpp	Mo's Algorithm.cpp
Negative Cycles in Directed Graph.cpp	Negative Cycles in Directed Graph.cpp
Ordered Statistic Tree (PBDS).cpp	Ordered Statistic Tree (PBDS).cpp
Parallel Binary Search.cpp	Parallel Binary Search.cpp
Persistent Segment Tree.cpp	Persistent Segment Tree.cpp
Prim's MST O(n*n) dense.cpp	Prim's MST O(n*n) dense.cpp
Prim's MST.cpp	Prim's MST.cpp
Primitive Root.cpp	Primitive Root.cpp
README.md	README.md
Random Generator.cpp	Random Generator.cpp
SPFA.cpp	SPFA.cpp
SQRT Decomposition.cpp	SQRT Decomposition.cpp
Segment Tree.cpp	Segment Tree.cpp
Sparse Matrix (RMQ).cpp	Sparse Matrix (RMQ).cpp
String Rotation (Booth's Algorithm).cpp	String Rotation (Booth's Algorithm).cpp
Strongly Connected Component.cpp	Strongly Connected Component.cpp
Sum Over Subsets DP (SOS)	Sum Over Subsets DP (SOS)
Sweep Line: Intersecting Line Segments.cpp	Sweep Line: Intersecting Line Segments.cpp
Topological Sort.cpp	Topological Sort.cpp
Treap.cpp	Treap.cpp
Tree Construction with Specific Vertices.cpp	Tree Construction with Specific Vertices.cpp
Trie.cpp	Trie.cpp
Z Algorithm.cpp	Z Algorithm.cpp

Name

Last commit message

Last commit date

284 Commits

2 Closest Points in 2D Plane (N log^2 N).cpp

2 Pointers (Two Pointers).cpp

2-SAT.cpp

Algebra.cpp

Articulation Points.cpp

BFS 2D.cpp

BFS.cpp

BIT - Binary Indexed Tree (Fenwick Tree).cpp