Name		Name	Last commit message	Last commit date
Latest commit History 62 Commits
.output		.output
.vscode		.vscode
BIT		BIT
Contests		Contests
DSU		DSU
LCA		LCA
MO		MO
Tree		Tree
algorepo		algorepo
bfs		bfs
binary_search		binary_search
bitmasking+dp		bitmasking+dp
dfs		dfs
digit_dp		digit_dp
dp		dp
fenwick		fenwick
nim_game		nim_game
samsung_interview_prep		samsung_interview_prep
segment_tree		segment_tree
sparse_table		sparse_table
stack_queue		stack_queue
trie		trie
2 Closest Points in 2D Plane (N log^2 N).cpp		2 Closest Points in 2D Plane (N log^2 N).cpp
2-SAT.cpp		2-SAT.cpp
Bridge Tree in Graph.cpp		Bridge Tree in Graph.cpp
Bridges in Graph.cpp		Bridges in Graph.cpp
Convex Hull (Dynamic)		Convex Hull (Dynamic)
Convex Hull (Graham's Scan).cpp		Convex Hull (Graham's Scan).cpp
Dijkstra.cpp		Dijkstra.cpp
Division.cpp		Division.cpp
Djikstra.cpp		Djikstra.cpp
Edit_Distance.cpp		Edit_Distance.cpp
Euler_phi.cpp		Euler_phi.cpp
Exponentiation.cpp		Exponentiation.cpp
Extended Euclidean Algorithm (Extensive).cpp		Extended Euclidean Algorithm (Extensive).cpp
Extended_euclid.cpp		Extended_euclid.cpp
FFT (Iterative)		FFT (Iterative)
FFT (Recursive)		FFT (Recursive)
FFTApplications.cpp		FFTApplications.cpp
Factorials with nCr.cpp		Factorials with nCr.cpp
FlyodWarshall(Dj).cpp		FlyodWarshall(Dj).cpp
Gaussian Elimination.cpp		Gaussian Elimination.cpp
Hashing (Strings)		Hashing (Strings)
IO_int128.cpp		IO_int128.cpp
Intervals Handling		Intervals Handling
KMP.cpp		KMP.cpp
Kruskal's MST.cpp		Kruskal's MST.cpp
LCS.cpp		LCS.cpp
Lcp_kasai.cpp		Lcp_kasai.cpp
Logical CF Problems		Logical CF Problems
Longest_Palindromic_substring(Manchar's).cpp		Longest_Palindromic_substring(Manchar's).cpp
Matching (Hopcroft-Karp) in Bipartite Graph		Matching (Hopcroft-Karp) in Bipartite Graph
Matrix Struct.cpp		Matrix Struct.cpp
MaxFlow - Push Relabel [V^2 sqrt(E)]		MaxFlow - Push Relabel [V^2 sqrt(E)]
MaxFlow - Push Relabel [V^3]		MaxFlow - Push Relabel [V^3]
Merge-sort_tree.cpp		Merge-sort_tree.cpp
Min Cost Max Flow - Dijkstra		Min Cost Max Flow - Dijkstra
Minimum_spanning_tree(Kruskal).cpp		Minimum_spanning_tree(Kruskal).cpp
Nth_Fibonacci.cpp		Nth_Fibonacci.cpp
Power_matrix.cpp		Power_matrix.cpp
Prim's MST.cpp		Prim's MST.cpp
README.md		README.md
Rabin-Karp.cpp		Rabin-Karp.cpp
Random Generator		Random Generator
SQRT_TREE.cpp		SQRT_TREE.cpp
Sort.cpp		Sort.cpp
Sparse Matrix (RMQ).cpp		Sparse Matrix (RMQ).cpp
Strongly Connected Component.cpp		Strongly Connected Component.cpp
Tree Construction with Specific Vertices		Tree Construction with Specific Vertices
UF_DSU.cpp		UF_DSU.cpp
Union_find.cpp		Union_find.cpp
Z Algorithm.cpp		Z Algorithm.cpp
assign.cpp		assign.cpp
bit.cpp		bit.cpp
bitset_string_int.cpp		bitset_string_int.cpp
circles.cpp		circles.cpp
codechef_template.cpp		codechef_template.cpp
convexHull.cpp		convexHull.cpp
cyclic_check.cpp		cyclic_check.cpp
diameter_of_a_tree.cpp		diameter_of_a_tree.cpp
dijkstra.cpp		dijkstra.cpp
dynamic_segment_tree.cpp		dynamic_segment_tree.cpp
edmonds_karp_maxflow.cpp		edmonds_karp_maxflow.cpp
eggDrop.cpp		eggDrop.cpp
expression.cpp		expression.cpp
fibonacci.cpp		fibonacci.cpp
find_cycle.cpp		find_cycle.cpp
inverse_modulo_map.cpp		inverse_modulo_map.cpp
iterative-tree-traversal-1.cpp		iterative-tree-traversal-1.cpp
iterative-tree-traversal-2.cpp		iterative-tree-traversal-2.cpp
kadane.cpp		kadane.cpp
leetcode		leetcode
leetcode.cpp		leetcode.cpp
leetcode.o		leetcode.o
leetcode1		leetcode1
leetcode1.cpp		leetcode1.cpp
leetcode1.o		leetcode1.o
level_order.py		level_order.py
make_pair.cpp		make_pair.cpp
matrix_expo.cpp		matrix_expo.cpp

Repository files navigation

Competitive Programming

An effort to put all templates(dS + Algo) under one repo during the course time of May 2016 - Present .

All the templates and standard algorithms are correct upto my knowledge. Feel free to contibute :)

Hope it might be useful :)

(Note : Try to share your thoughts and experience of competative coding in your github profile, it might be useful for others.)

harrypotter0/competitive-programming

Folders and files

Latest commit

History