├── 2 Closest Points in 2D Plane (N log^2 N).cpp ├── 2 Pointers (Two Pointers).cpp ├── 2-SAT.cpp ├── BFS 2D.cpp ├── BFS.cpp ├── BIT - Binary Indexed Tree (Fenwick Tree).cpp ├── Biconnected Components (Online Bridge).cpp ├── Bridge Tree in Graph.cpp ├── Bridges in Graph.cpp ├── Centroid Decomposition.cpp ├── Convex Hull (Dynamic).cpp ├── Convex Hull (Graham's Scan).cpp ├── DFS - Cycle Detection in Directed Graph.cpp ├── DSU (Disjoint Set Union).cpp ├── DSU On Trees.cpp ├── Dijkstra.cpp ├── Discrete Logarithm.cpp ├── Extended Euclidean Algorithm (Extensive).cpp ├── Extra ├── Extra.cpp ├── FFT (Iterative).cpp ├── FFT (Recursive).cpp ├── FFT Applications.cpp ├── FFT_jatin.cpp ├── Factorials with nCr.cpp ├── Floyd Warshall.cpp ├── Gaussian Elimination.cpp ├── Geo Snippet.cpp ├── Geometry.cpp ├── Grundy Number (Nim Game).cpp ├── Hashing (Strings).cpp ├── Heavy Light Decomposition (HLD).cpp ├── Hungarian.cpp ├── Intervals Handling.cpp ├── KMP.cpp ├── Kruskal's MST.cpp ├── LCA (with Time Traversal DFS).cpp ├── Logical CF Problems.cpp ├── Matching (Hopcroft-Karp) in Bipartite Graph.cpp ├── Matrix Struct.cpp ├── MaxFlow - Push Relabel [V^2 sqrt(E)].cpp ├── MaxFlow - Push Relabel [V^3].cpp ├── Min Cost Max Flow - Dijkstra.cpp ├── Mo's Algorithm.cpp ├── NTT (Recursive).cpp ├── Negative Cycles in Directed Graph.cpp ├── Ordered Statistic Tree (PBDS).cpp ├── Parallel Binary Search.cpp ├── Persistent Segment Tree.cpp ├── Prim's MST.cpp ├── Primitive Root.cpp ├── README.md ├── Random Generator.cpp ├── SPFA.cpp ├── SQRT Decomposition.cpp ├── Segment Tree.cpp ├── Sparse Matrix (RMQ).cpp ├── Strongly Connected Component.cpp ├── Sweep Line: Intersecting Line Segments.cpp ├── Topological Sort.cpp ├── Treap.cpp ├── Tree Construction with Specific Vertices.cpp ├── Trie.cpp ├── Z Algorithm.cpp ├── polynomialInverse.cpp └── suffixArray.cpp /2 Closest Points in 2D Plane (N log^2 N).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/2 Closest Points in 2D Plane (N log^2 N).cpp -------------------------------------------------------------------------------- /2 Pointers (Two Pointers).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/2 Pointers (Two Pointers).cpp -------------------------------------------------------------------------------- /2-SAT.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/2-SAT.cpp -------------------------------------------------------------------------------- /BFS 2D.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/BFS 2D.cpp -------------------------------------------------------------------------------- /BFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/BFS.cpp -------------------------------------------------------------------------------- /BIT - Binary Indexed Tree (Fenwick Tree).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/BIT - Binary Indexed Tree (Fenwick Tree).cpp -------------------------------------------------------------------------------- /Biconnected Components (Online Bridge).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Biconnected Components (Online Bridge).cpp -------------------------------------------------------------------------------- /Bridge Tree in Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Bridge Tree in Graph.cpp -------------------------------------------------------------------------------- /Bridges in Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Bridges in Graph.cpp -------------------------------------------------------------------------------- /Centroid Decomposition.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Centroid Decomposition.cpp -------------------------------------------------------------------------------- /Convex Hull (Dynamic).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Convex Hull (Dynamic).cpp -------------------------------------------------------------------------------- /Convex Hull (Graham's Scan).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Convex Hull (Graham's Scan).cpp -------------------------------------------------------------------------------- /DFS - Cycle Detection in Directed Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/DFS - Cycle Detection in Directed Graph.cpp -------------------------------------------------------------------------------- /DSU (Disjoint Set Union).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/DSU (Disjoint Set Union).cpp -------------------------------------------------------------------------------- /DSU On Trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/DSU On Trees.cpp -------------------------------------------------------------------------------- /Dijkstra.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Dijkstra.cpp -------------------------------------------------------------------------------- /Discrete Logarithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Discrete Logarithm.cpp -------------------------------------------------------------------------------- /Extended Euclidean Algorithm (Extensive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Extended Euclidean Algorithm (Extensive).cpp -------------------------------------------------------------------------------- /Extra: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Extra -------------------------------------------------------------------------------- /Extra.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Extra.cpp -------------------------------------------------------------------------------- /FFT (Iterative).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/FFT (Iterative).cpp -------------------------------------------------------------------------------- /FFT (Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/FFT (Recursive).cpp -------------------------------------------------------------------------------- /FFT Applications.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/FFT Applications.cpp -------------------------------------------------------------------------------- /FFT_jatin.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/FFT_jatin.cpp -------------------------------------------------------------------------------- /Factorials with nCr.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Factorials with nCr.cpp -------------------------------------------------------------------------------- /Floyd Warshall.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Floyd Warshall.cpp -------------------------------------------------------------------------------- /Gaussian Elimination.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Gaussian Elimination.cpp -------------------------------------------------------------------------------- /Geo Snippet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Geo Snippet.cpp -------------------------------------------------------------------------------- /Geometry.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Geometry.cpp -------------------------------------------------------------------------------- /Grundy Number (Nim Game).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Grundy Number (Nim Game).cpp -------------------------------------------------------------------------------- /Hashing (Strings).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Hashing (Strings).cpp -------------------------------------------------------------------------------- /Heavy Light Decomposition (HLD).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Heavy Light Decomposition (HLD).cpp -------------------------------------------------------------------------------- /Hungarian.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Hungarian.cpp -------------------------------------------------------------------------------- /Intervals Handling.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Intervals Handling.cpp -------------------------------------------------------------------------------- /KMP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/KMP.cpp -------------------------------------------------------------------------------- /Kruskal's MST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Kruskal's MST.cpp -------------------------------------------------------------------------------- /LCA (with Time Traversal DFS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/LCA (with Time Traversal DFS).cpp -------------------------------------------------------------------------------- /Logical CF Problems.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Logical CF Problems.cpp -------------------------------------------------------------------------------- /Matching (Hopcroft-Karp) in Bipartite Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Matching (Hopcroft-Karp) in Bipartite Graph.cpp -------------------------------------------------------------------------------- /Matrix Struct.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Matrix Struct.cpp -------------------------------------------------------------------------------- /MaxFlow - Push Relabel [V^2 sqrt(E)].cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/MaxFlow - Push Relabel [V^2 sqrt(E)].cpp -------------------------------------------------------------------------------- /MaxFlow - Push Relabel [V^3].cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/MaxFlow - Push Relabel [V^3].cpp -------------------------------------------------------------------------------- /Min Cost Max Flow - Dijkstra.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Min Cost Max Flow - Dijkstra.cpp -------------------------------------------------------------------------------- /Mo's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Mo's Algorithm.cpp -------------------------------------------------------------------------------- /NTT (Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/NTT (Recursive).cpp -------------------------------------------------------------------------------- /Negative Cycles in Directed Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Negative Cycles in Directed Graph.cpp -------------------------------------------------------------------------------- /Ordered Statistic Tree (PBDS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Ordered Statistic Tree (PBDS).cpp -------------------------------------------------------------------------------- /Parallel Binary Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Parallel Binary Search.cpp -------------------------------------------------------------------------------- /Persistent Segment Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Persistent Segment Tree.cpp -------------------------------------------------------------------------------- /Prim's MST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Prim's MST.cpp -------------------------------------------------------------------------------- /Primitive Root.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Primitive Root.cpp -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Competitive-Coding 2 | -------------------------------------------------------------------------------- /Random Generator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Random Generator.cpp -------------------------------------------------------------------------------- /SPFA.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/SPFA.cpp -------------------------------------------------------------------------------- /SQRT Decomposition.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/SQRT Decomposition.cpp -------------------------------------------------------------------------------- /Segment Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Segment Tree.cpp -------------------------------------------------------------------------------- /Sparse Matrix (RMQ).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Sparse Matrix (RMQ).cpp -------------------------------------------------------------------------------- /Strongly Connected Component.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Strongly Connected Component.cpp -------------------------------------------------------------------------------- /Sweep Line: Intersecting Line Segments.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Sweep Line: Intersecting Line Segments.cpp -------------------------------------------------------------------------------- /Topological Sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Topological Sort.cpp -------------------------------------------------------------------------------- /Treap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Treap.cpp -------------------------------------------------------------------------------- /Tree Construction with Specific Vertices.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Tree Construction with Specific Vertices.cpp -------------------------------------------------------------------------------- /Trie.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Trie.cpp -------------------------------------------------------------------------------- /Z Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/Z Algorithm.cpp -------------------------------------------------------------------------------- /polynomialInverse.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/polynomialInverse.cpp -------------------------------------------------------------------------------- /suffixArray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/aryanc403/Competitive-Coding-Library/HEAD/suffixArray.cpp --------------------------------------------------------------------------------