Skip to content

vectar31/code_library

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
0 Questions
0 Questions
 
 
0_Tutorials
0_Tutorials
 
 
Articulation Points and Bridges
Articulation Points and Bridges
 
 
Articulation Points
Articulation Points
 
 
BIT (range update and range query)
BIT (range update and range query)
 
 
BIT
BIT
 
 
Bellman Ford shortest path
Bellman Ford shortest path
 
 
Bnomial Coefficient
Bnomial Coefficient
 
 
Bridges
Bridges
 
 
Building Bridges
Building Bridges
 
 
Check bipartite (by coloring)
Check bipartite (by coloring)
 
 
Check for negative cycle using Bellman
Check for negative cycle using Bellman
 
 
Convex Hull
Convex Hull
 
 
Damerau Levenshtein Edit Distance with transposition
Damerau Levenshtein Edit Distance with transposition
 
 
Derangement of a string
Derangement of a string
 
 
Dijkstra_s Shortest Path
Dijkstra_s Shortest Path
 
 
Disjoint Set (STL)
Disjoint Set (STL)
 
 
Disjoint Set (Union Find)
Disjoint Set (Union Find)
 
 
Euclid and other modular arithmetic functions
Euclid and other modular arithmetic functions
 
 
Factorize all numbers upto 10^7
Factorize all numbers upto 10^7
 
 
Fibonacci Number fast doubling O(logn)
Fibonacci Number fast doubling O(logn)
 
 
Gauss Jordan Elimination (Solvin a system of linear equations)
Gauss Jordan Elimination (Solvin a system of linear equations)
 
 
Gaussian Elimination system of equations
Gaussian Elimination system of equations
 
 
Graph coloring (d+1 upper bound)
Graph coloring (d+1 upper bound)
 
 
HYPNOSII
HYPNOSII
 
 
Highly Composite Numbers
Highly Composite Numbers
 
 
Integer Factorization - 20 digits
Integer Factorization - 20 digits
 
 
Integer Partition DNC
Integer Partition DNC
 
 
Interval Scheduling
Interval Scheduling
 
 
Inverse Modulo simple
Inverse Modulo simple
 
 
Kruskal MST
Kruskal MST
 
 
LOVEBIRDS
LOVEBIRDS
 
 
Max Flow Dinic
Max Flow Dinic
 
 
Maximum Bipartite Matching Adjacency list
Maximum Bipartite Matching Adjacency list
 
 
Maximum Bipartite Matching
Maximum Bipartite Matching
 
 
Maximum decimal number after k roundoffs(one place at a time)
Maximum decimal number after k roundoffs(one place at a time)
 
 
Miller Rabin faster (Lakshman)
Miller Rabin faster (Lakshman)
 
 
Mirror string check
Mirror string check
 
 
Modular Invers(Fermat’s Little theorem, O(Log m) [Works when ‘m’ is prime])
Modular Invers(Fermat’s Little theorem, O(Log m) [Works when ‘m’ is prime])
 
 
Modular Inverse(Iterative,extended euler)(when a and m are coprime)
Modular Inverse(Iterative,extended euler)(when a and m are coprime)
 
 
NATALIAG
NATALIAG
 
 
NCR mod M (M is not prime)
NCR mod M (M is not prime)
 
 
NCR mod M
NCR mod M
 
 
Next Prime
Next Prime
 
 
Prim_s MST
Prim_s MST
 
 
Prime test Miller Rabin
Prime test Miller Rabin
 
 
Row Reduced Echleon Form
Row Reduced Echleon Form
 
 
String Matching Online mode(add, delete, count)
String Matching Online mode(add, delete, count)
 
 
Suffix Array Implementations/suffix_array
Suffix Array Implementations/suffix_array
 
 
Topological Sorting
Topological Sorting
 
 
Trie with search and insert
Trie with search and insert
 
 
VAP01
VAP01
 
 
XORrounds
XORrounds
 
 
Z algorithm
Z algorithm
 
 
bfs on a grid
bfs on a grid
 
 
bfs
bfs
 
 
bin
bin
 
 
binomial coefficient ( nck O(k) )
binomial coefficient ( nck O(k) )
 
 
checkbipartite
checkbipartite
 
 
connected components of a grid
connected components of a grid
 
 
count divisors (prime factorization)
count divisors (prime factorization)
 
 
cycle detection in undirected graph
cycle detection in undirected graph
 
 
dfs
dfs
 
 
distinct prime factors using sieve
distinct prime factors using sieve
 
 
edist
edist
 
 
egg dropping puzzle
egg dropping puzzle
 
 
euler totient function
euler totient function
 
 
euler_totient_sieve
euler_totient_sieve
 
 
factorization - 15 digits
factorization - 15 digits
 
 
fast multiplication (VFMUL)
fast multiplication (VFMUL)
 
 
fastio
fastio
 
 
fermat_primality_test
fermat_primality_test
 
 
fibonacci in logn
fibonacci in logn
 
 
fibonacci short
fibonacci short
 
 
floydwarshall
floydwarshall
 
 
geeksforgeeks/Searching and Sorting
geeksforgeeks/Searching and Sorting
 
 
integer partition DP
integer partition DP
 
 
integer_partition_fumction
integer_partition_fumction
 
 
inverse modulo
inverse modulo
 
 
kadane max sum subarray
kadane max sum subarray
 
 
knapsack
knapsack
 
 
manacher_s algorithm (longest_pallindromic_substring O(n))
manacher_s algorithm (longest_pallindromic_substring O(n))
 
 
minimum cost path
minimum cost path
 
 
miscellaneous maths
miscellaneous maths
 
 
modular equation
modular equation
 
 
modular_exponentiation
modular_exponentiation
 
 
next lexicographic permutation
next lexicographic permutation
 
 
next permutation of a string
next permutation of a string
 
 
numbertheorycollectiojn
numbertheorycollectiojn
 
 
optimized knapsack
optimized knapsack
 
 
optimized sieve
optimized sieve
 
 
permutation of a string
permutation of a string
 
 
pollard rho factorisation
pollard rho factorisation
 
 
polynomial multiplication
polynomial multiplication
 
 
polynomiallongdivision
polynomiallongdivision
 
 
print primes in a range max upto int range
print primes in a range max upto int range
 
 
probable prime and next prime
probable prime and next prime
 
 
segmented sieve
segmented sieve
 
 
sieve of atkin
sieve of atkin
 
 
sieve of eratosthenes 2 (faster)
sieve of eratosthenes 2 (faster)
 
 

Repository files navigation

code_library

Essential code base for competitive programming

About

Essential code base for competitive programming

Resources

Readme

License

Unlicense license
Activity

Stars

1 star

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages