Name		Name	Last commit message	Last commit date
Latest commit History 128 Commits
(Base^Power) MOD m.cpp		(Base^Power) MOD m.cpp
0-1 Knapsack.cpp		0-1 Knapsack.cpp
0-1 KnapsackPrint.cpp		0-1 KnapsackPrint.cpp
All Subset Sum.cpp		All Subset Sum.cpp
Articulation Point.cpp		Articulation Point.cpp
Base Conversion.cpp		Base Conversion.cpp
Binary_Search.c		Binary_Search.c
Breadth First Search(BFS).cpp		Breadth First Search(BFS).cpp
Count Inversions in an array (Using Merge Sort).cpp		Count Inversions in an array (Using Merge Sort).cpp
Counting_digit.cpp		Counting_digit.cpp
Counting_digit_in_a^b.cpp		Counting_digit_in_a^b.cpp
Counting_digit_in_the_factorial_of_a_number.cpp		Counting_digit_in_the_factorial_of_a_number.cpp
Dev Skill - Kufa_game(Seg Tree).cpp		Dev Skill - Kufa_game(Seg Tree).cpp
Dijkstra’s shortest path(CP3 book).cpp		Dijkstra’s shortest path(CP3 book).cpp
Disjoint Set Union(DSU).cpp		Disjoint Set Union(DSU).cpp
Edit Distance.cpp		Edit Distance.cpp
Euler's Totient Function(Efficient).cpp		Euler's Totient Function(Efficient).cpp
Euler's Totient Function.cpp		Euler's Totient Function.cpp
Factorial of A Big Integer.c		Factorial of A Big Integer.c
Finding cycle in a graph using DFS.cpp		Finding cycle in a graph using DFS.cpp
LCA.cpp		LCA.cpp
LCS(DP-O(nm)).cpp		LCS(DP-O(nm)).cpp
LIS(DP) nlogn.cpp		LIS(DP) nlogn.cpp
Largest rectangular area in a histogram.cpp		Largest rectangular area in a histogram.cpp
Light Oj 1214		Light Oj 1214
Light oj 1214.java		Light oj 1214.java
Link By Size (DSU).cpp		Link By Size (DSU).cpp
Longest Common Substring.cpp		Longest Common Substring.cpp
MAX_FLOW (Edmonds–Karp algorithm) .cpp		MAX_FLOW (Edmonds–Karp algorithm) .cpp
Merge Sort.cpp		Merge Sort.cpp
Minimal addition edges to make a graph SCC.cpp		Minimal addition edges to make a graph SCC.cpp
Minimum Insertion Needed To Make A String A Palindrome.cpp		Minimum Insertion Needed To Make A String A Palindrome.cpp
Minimum length of subarray with equal or greater than sum.cpp		Minimum length of subarray with equal or greater than sum.cpp
N! Mod r.cpp		N! Mod r.cpp
Point Updates and Range Queries-(Fenwick Tree).cpp		Point Updates and Range Queries-(Fenwick Tree).cpp
Power of prime numbers in a fatcorial.cpp		Power of prime numbers in a fatcorial.cpp
Prefix tree(Array Implementation).cpp		Prefix tree(Array Implementation).cpp
Prime Factors.cpp		Prime Factors.cpp
Print ALL LCS.cpp		Print ALL LCS.cpp
README.md		README.md
RMQ(Sqrt Decompostion with pont update).cpp		RMQ(Sqrt Decompostion with pont update).cpp
RMQ(Sqrt Decompostion).cpp		RMQ(Sqrt Decompostion).cpp
SCC(Kosaraju-using topsort).cpp		SCC(Kosaraju-using topsort).cpp
SCC(Tarjan).cpp		SCC(Tarjan).cpp
SPOJ BRCKTS(Seg Tree).cpp		SPOJ BRCKTS(Seg Tree).cpp
SPOJ D-query.cpp		SPOJ D-query.cpp
SPOJ Inversion Count.cpp		SPOJ Inversion Count.cpp
SPOJ(LCA) .cpp		SPOJ(LCA) .cpp
Segment Tree		Segment Tree
Segment Tree.cpp		Segment Tree.cpp
Segment tree with Lazy Propagation.cpp		Segment tree with Lazy Propagation.cpp
Shortest Path by (BFS).cpp		Shortest Path by (BFS).cpp
Shortest path in a Matrix.cpp		Shortest path in a Matrix.cpp
Sqrt Decomposition.cpp		Sqrt Decomposition.cpp
Stack(push_pop).c		Stack(push_pop).c
Subset Problem O(nSUM).cpp		Subset Problem O(nSUM).cpp
Subset SUM (SUM is so BIG).cpp		Subset SUM (SUM is so BIG).cpp
Subtraction Of Two Big Integer.c		Subtraction Of Two Big Integer.c
Sum Of All Subset.cpp		Sum Of All Subset.cpp
Sum Of Big Integers.c		Sum Of Big Integers.c
Timus-1471(LCA).cpp		Timus-1471(LCA).cpp
Topological Sort Using BFS.cpp		Topological Sort Using BFS.cpp
Topological Sort using DFS.cpp		Topological Sort using DFS.cpp
cf 301E(Seg Tree).cpp		cf 301E(Seg Tree).cpp
cf 368B(Fenwick Tree).cpp		cf 368B(Fenwick Tree).cpp
cf 811B(Seg Tree).cpp		cf 811B(Seg Tree).cpp
cf 816B(Fenwick Tree).cpp		cf 816B(Fenwick Tree).cpp
cf 816B(Seg Tree).cpp		cf 816B(Seg Tree).cpp
light oj 1003(graph).cpp		light oj 1003(graph).cpp
light oj 1033(LCS).cpp		light oj 1033(LCS).cpp
light oj 1034(TopSort).cpp		light oj 1034(TopSort).cpp
light oj 1080(Binary Simulation) (Seg Tree).cpp		light oj 1080(Binary Simulation) (Seg Tree).cpp
light oj 1080(Fenwick Tree).cpp		light oj 1080(Fenwick Tree).cpp
light oj 1082(Sqrt Decomposition).cpp		light oj 1082(Sqrt Decomposition).cpp
light oj 1083(Histogram).cpp		light oj 1083(Histogram).cpp
light oj 1087(Segment Tree).cpp		light oj 1087(Segment Tree).cpp
light oj 1089(Segment Tree).cpp		light oj 1089(Segment Tree).cpp
light oj 1093(Segment Tree).cpp		light oj 1093(Segment Tree).cpp
light oj 1099(graph).cpp		light oj 1099(graph).cpp
light oj 1110(LCS).cpp		light oj 1110(LCS).cpp
light oj 1111(graph).cpp		light oj 1111(graph).cpp
light oj 1112(Segment Tree).cpp		light oj 1112(Segment Tree).cpp
light oj 1129(Prefix Tree).cpp		light oj 1129(Prefix Tree).cpp
light oj 1164(Segment Tree).cpp		light oj 1164(Segment Tree).cpp
light oj 1168(SCC).cpp		light oj 1168(SCC).cpp
light oj 1174(BFS).cpp		light oj 1174(BFS).cpp
light oj 1188(Seg Tree).cpp		light oj 1188(Seg Tree).cpp
light oj 1188(Segment Tree).cpp		light oj 1188(Segment Tree).cpp
light oj 1210(graph).cpp		light oj 1210(graph).cpp
longest path in DAG(LIS).cpp		longest path in DAG(LIS).cpp
prifix_trie_with_array.cpp		prifix_trie_with_array.cpp
spoj GSS4(BIT+DSU).cpp		spoj GSS4(BIT+DSU).cpp
spoj(EDIST).cpp		spoj(EDIST).cpp
uva 10066(LCS).cpp		uva 10066(LCS).cpp
uva 10131(LIS).cpp		uva 10131(LIS).cpp
uva 111(LCS).cpp		uva 111(LCS).cpp
uva 11235(Segment Tree).cpp		uva 11235(Segment Tree).cpp
uva 11512(prefix Tree).cpp		uva 11512(prefix Tree).cpp
uva 11790(LIS).cpp		uva 11790(LIS).cpp
uva 12442(TopSort or DFS Finishing Time).cpp		uva 12442(TopSort or DFS Finishing Time).cpp

Repository files navigation

Algorithms-Implementations

I will store here some algorithms...

ShawonNSTU/Algorithms-Implementations

Folders and files

Latest commit

History