Skip to content

ArfatulAsif/Competitive-programming

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

187 Commits
Dynamic Programming Road Map
Dynamic Programming Road Map
 
 
2 - SAT with solution .cpp
2 - SAT with solution .cpp
 
 
Aho Corasick.cpp
Aho Corasick.cpp
 
 
Articulartion Points .cpp
Articulartion Points .cpp
 
 
Articulation Bridge .cpp
Articulation Bridge .cpp
 
 
BIT - Binary Indexed Tree(All variant , Sum+Xor).cpp
BIT - Binary Indexed Tree(All variant , Sum+Xor).cpp
 
 
BIT- Binary Indexed Tree - 2D ( All Variant , sum+xor).cpp
BIT- Binary Indexed Tree - 2D ( All Variant , sum+xor).cpp
 
 
Bellman Ford .cpp
Bellman Ford .cpp
 
 
Bi-connected Components.cpp
Bi-connected Components.cpp
 
 
Big Integer.cpp
Big Integer.cpp
 
 
Binary Lifting (Sum Query between two vertex of a tree) .cpp
Binary Lifting (Sum Query between two vertex of a tree) .cpp
 
 
Centroid Decomposition .cpp
Centroid Decomposition .cpp
 
 
Cycle Printing in Directed Graph .cpp
Cycle Printing in Directed Graph .cpp
 
 
DSU Modified(DSU+Ordered Set).cpp
DSU Modified(DSU+Ordered Set).cpp
 
 
DSU On Tree (nlogn) .cpp
DSU On Tree (nlogn) .cpp
 
 
DSU On Tree O(n log^2 n) .cpp
DSU On Tree O(n log^2 n) .cpp
 
 
Dijkstra .cpp
Dijkstra .cpp
 
 
EULER TOURS On Tree ( All variant).cpp
EULER TOURS On Tree ( All variant).cpp
 
 
Euler Path_Circuit.cpp
Euler Path_Circuit.cpp
 
 
Euler Tour Improved (FOR USE).cpp
Euler Tour Improved (FOR USE).cpp
 
 
FLOW1 - Max Flow (Ford-Fulkerson) O(E * max flow).cpp
FLOW1 - Max Flow (Ford-Fulkerson) O(E * max flow).cpp
 
 
FLOW2 - Max Flow (Edmonds-Karp) O(V * E^2).cpp
FLOW2 - Max Flow (Edmonds-Karp) O(V * E^2).cpp
 
 
FLOW3 - Max Flow (for general use) (Dinic's algorithm) O(V^2 * E).cpp
FLOW3 - Max Flow (for general use) (Dinic's algorithm) O(V^2 * E).cpp
 
 
FLOW4 - Minimum Cut.cpp
FLOW4 - Minimum Cut.cpp
 
 
FLOW5 - Maximum Bipartite Matching HopcroftKarp.cpp
FLOW5 - Maximum Bipartite Matching HopcroftKarp.cpp
 
 
FLOW6 - Minimum Cost Maximum Flow (MCMF).cpp
FLOW6 - Minimum Cost Maximum Flow (MCMF).cpp
 
 
FLOW7 - Minimum Cost Maximum Flow With Negative Cycle(MCMF).cpp
FLOW7 - Minimum Cost Maximum Flow With Negative Cycle(MCMF).cpp
 
 
FLOW8 - Weighted Maximum Bipartite Matching (Hungarian algorithm).cpp
FLOW8 - Weighted Maximum Bipartite Matching (Hungarian algorithm).cpp
 
 
FLOW9 - Minimum Vertex Cover\Maximum Independent Set in Bipartite Graph (hopcroft-karp).cpp
FLOW9 - Minimum Vertex Cover\Maximum Independent Set in Bipartite Graph (hopcroft-karp).cpp
 
 
GP Hash .cpp
GP Hash .cpp
 
 
Game Theory ( MEX , Sprague-Grundy Number Calculation).cpp
Game Theory ( MEX , Sprague-Grundy Number Calculation).cpp
 
 
Gaussian Elimination.cpp
Gaussian Elimination.cpp
 
 
Heavy Light Decomposition ( Edge Update MINIMUM Query).cpp
Heavy Light Decomposition ( Edge Update MINIMUM Query).cpp
 
 
Heavy Light Decomposition ( Sum Update Query on Vertex ).cpp
Heavy Light Decomposition ( Sum Update Query on Vertex ).cpp
 
 
Heavy Light Decomposition (Sum Update Query on Edges ).cpp
Heavy Light Decomposition (Sum Update Query on Edges ).cpp
 
 
Heavy Light Decomposition (Vertex Maximum Query with Single update).cpp
Heavy Light Decomposition (Vertex Maximum Query with Single update).cpp
 
 
Inclusion Exclusion .cpp
Inclusion Exclusion .cpp
 
 
Johnson’s algorithm for All-pairs shortest paths.cpp
Johnson’s algorithm for All-pairs shortest paths.cpp
 
 
LCA in O(1).cpp
LCA in O(1).cpp
 
 
LCA with Binary lifting.cpp
LCA with Binary lifting.cpp
 
 
Longest Path In A DAG O(V+E).cpp
Longest Path In A DAG O(V+E).cpp
 
 
MO's Algorithm (K-th Minimum in Range).cpp
MO's Algorithm (K-th Minimum in Range).cpp
 
 
MST Krushkal .cpp
MST Krushkal .cpp
 
 
MST Prims .cpp
MST Prims .cpp
 
 
Matrix Exponentiation .cpp
Matrix Exponentiation .cpp
 
 
Merge Sort Tree (k-th minimum in range) .cpp
Merge Sort Tree (k-th minimum in range) .cpp
 
 
Mobius Function.cpp
Mobius Function.cpp
 
 
Monotonic Stack.cpp
Monotonic Stack.cpp
 
 
Negative Cycle Printing .cpp
Negative Cycle Printing .cpp
 
 
Order Multiset Template.cpp
Order Multiset Template.cpp
 
 
Persistent Segment Tree (k-th minimum in range).cpp
Persistent Segment Tree (k-th minimum in range).cpp
 
 
Pollard Rho ( probabilistic Factorization) Algorithm.cpp
Pollard Rho ( probabilistic Factorization) Algorithm.cpp
 
 
Prime Factorization .cpp
Prime Factorization .cpp
 
 
README.md
README.md
 
 
Segment Tree With Lazy Propagation.cpp
Segment Tree With Lazy Propagation.cpp
 
 
Shortest Path In A DAG O(V+E) .cpp
Shortest Path In A DAG O(V+E) .cpp
 
 
Sliding Window (Fixed,Variable Length Window Template).cpp
Sliding Window (Fixed,Variable Length Window Template).cpp
 
 
Strongly Connected Components to DAG.cpp
Strongly Connected Components to DAG.cpp
 
 
Suffix Array.cpp
Suffix Array.cpp
 
 
Topological Sorting .cpp
Topological Sorting .cpp
 
 
Trie .cpp
Trie .cpp
 
 
Trie Xor (Min - Max).cpp
Trie Xor (Min - Max).cpp
 
 
Why Dijkstra Fails For Negative Edges.md
Why Dijkstra Fails For Negative Edges.md
 
 
XOR Basis.cpp
XOR Basis.cpp
 
 
Z Function.cpp
Z Function.cpp
 
 
zzzzzzz Me.png
zzzzzzz Me.png
 
 
zzzzzzzz Batarang.png
zzzzzzzz Batarang.png
 
 

Repository files navigation

Competitive-programming LinkedIn

In this repository I have stored some of the most used intermediate and advanced level algorithms in competitive programming . I have written all the codes by myself . Before that I myself have learned these algorihms from various blog's . I have written them while maintaing strong modularity , so that when I need to remember a process or an algorithms I can do so just by looking at the codes . I have also commented in the codes where it was necessary .

These codes are written in way which makes them very easy to understand for a beginner or an intermediate level coder .

I strongly hope that an intermediate level programmer will benefit highly from my library , as there isn't much resources available for advanced topic's .

I am currently in the enrichment process of my library . Hope to include almost all the algorithms used by an intermediate or an advanced level cp coder.

#include<studio.h>
int main()
{
    printf("Happy Coding");
    return 0;
}

About

No description or website provided.

Topics

algorithms competitive-programming coding problem-solving cp

Resources

Readme
Activity

Stars

27 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages