Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
0 - 1 Kanpsack Code.cpp		0 - 1 Kanpsack Code.cpp
0-1 BFS.cpp		0-1 BFS.cpp
2-D Segment Tree.cpp		2-D Segment Tree.cpp
2D Segment Tree.cpp		2D Segment Tree.cpp
BFS - 5.cpp		BFS - 5.cpp
Bactracking Learning.cpp		Bactracking Learning.cpp
Bitwise Sieve.cpp		Bitwise Sieve.cpp
Centroid Decompostion.cpp		Centroid Decompostion.cpp
Closest Pair of Points O(n lg^2 n).cpp		Closest Pair of Points O(n lg^2 n).cpp
ConvexHull.cpp		ConvexHull.cpp
ConvexHullTrick.cpp		ConvexHullTrick.cpp
DFS - Algo.cpp		DFS - Algo.cpp
Dijkstra.cpp		Dijkstra.cpp
Divisor.cpp		Divisor.cpp
Euler Totient - Relative Prime Numbers.cpp		Euler Totient - Relative Prime Numbers.cpp
Find Total Number Of Distinct Substring in a String.cpp		Find Total Number Of Distinct Substring in a String.cpp
Floyd Warshal Learning.cpp		Floyd Warshal Learning.cpp
HLD.cpp		HLD.cpp
INF Knight.cpp		INF Knight.cpp
Knuth, Morris, Pratt ( KMP ).cpp		Knuth, Morris, Pratt ( KMP ).cpp
Krushkal Algorithm Practice.cpp		Krushkal Algorithm Practice.cpp
LCA _O(nlogn),O(logn)_.cpp		LCA _O(nlogn),O(logn)_.cpp
LCA(BST-O(n)).cpp.txt		LCA(BST-O(n)).cpp.txt
LCA(o(n))(tree).cpp.txt		LCA(o(n))(tree).cpp.txt
LCS_Total.cpp		LCS_Total.cpp
Lexicographical LCS between 3 Strings.cpp		Lexicographical LCS between 3 Strings.cpp
Longest Increasing Subsequences ( NlgN ).cpp		Longest Increasing Subsequences ( NlgN ).cpp
MO's Algo.cpp		MO's Algo.cpp
MST - Krushkal.cpp		MST - Krushkal.cpp
Matrix Exponentiation - 2 _Fn.cpp		Matrix Exponentiation - 2 _Fn.cpp
Matrix Exponentiation.cpp		Matrix Exponentiation.cpp
MatrixExpo.cpp		MatrixExpo.cpp
Minimum Window Characters.cpp		Minimum Window Characters.cpp
NCR.cpp		NCR.cpp
Persistent Segment Tree.cpp		Persistent Segment Tree.cpp
Persistent Trie.cpp		Persistent Trie.cpp
README.md		README.md
SCC - Kosaraju.cpp		SCC - Kosaraju.cpp
SCC - Tarjan.cpp		SCC - Tarjan.cpp
Segment Tree (Lazy Prop).cpp		Segment Tree (Lazy Prop).cpp
Segment Tree - Lazy propagation.cpp		Segment Tree - Lazy propagation.cpp
Segment Tree.cpp		Segment Tree.cpp
Segmented Sieve.cpp		Segmented Sieve.cpp
Sieve.cpp		Sieve.cpp
TopoLogical Sort.cpp		TopoLogical Sort.cpp
Trie - Array.cpp		Trie - Array.cpp
Union Find - Disjoint Set Learning.cpp		Union Find - Disjoint Set Learning.cpp
big_integer_library.cpp		big_integer_library.cpp
maxHistrogram.cpp		maxHistrogram.cpp
n'th permutation.cpp		n'th permutation.cpp
nCr mod M.cpp		nCr mod M.cpp
nextGreaterElement.cpp		nextGreaterElement.cpp
slidingRMQ.cpp		slidingRMQ.cpp

Repository files navigation

Algorithm-and-Data-Structure

Different Alogrithm technique for Programming Contest

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Algorithm-and-Data-Structure

Different Alogrithm technique for Programming Contest

About

Releases

Packages

Languages

asad14053/Algorithm-and-Data-Structure-for-Contest

Folders and files

Latest commit

History

Repository files navigation

Algorithm-and-Data-Structure

Different Alogrithm technique for Programming Contest

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages