Skip to content
BranchesTags

Latest commit

 

History

11 Commits

Folders and files

NameName
Last commit message
Last commit date
Closest_Pair_of_Points.cpp
Closest_Pair_of_Points.cpp
 
 
CycleDetect_DirectedGraph.cpp
CycleDetect_DirectedGraph.cpp
 
 
DSU.cpp
DSU.cpp
 
 
Dinic_MaxFlow.cpp
Dinic_MaxFlow.cpp
 
 
Hopcroft_Karp_Max_Bipartite_Matching.cpp
Hopcroft_Karp_Max_Bipartite_Matching.cpp
 
 
Kruskal's Algo - MST.cpp
Kruskal's Algo - MST.cpp
 
 
LIS.cpp
LIS.cpp
 
 
Lazy_Prop_Segment_Tree.cpp
Lazy_Prop_Segment_Tree.cpp
 
 
MInHeap.cpp
MInHeap.cpp
 
 
Manacher's Algo - no. of palindromes.cpp
Manacher's Algo - no. of palindromes.cpp
 
 
Maths.cpp
Maths.cpp
 
 
Mo's_algo.cpp
Mo's_algo.cpp
 
 
PBDS.cpp
PBDS.cpp
 
 
README.md
README.md
 
 
Suffix_Array.cpp
Suffix_Array.cpp
 
 
Tree_LCA.cpp
Tree_LCA.cpp
 
 
Trie.cpp
Trie.cpp
 
 
Undir_Graph_Cycle_Det.cpp
Undir_Graph_Cycle_Det.cpp
 
 
Zarray.cpp
Zarray.cpp
 
 
dfs.cpp
dfs.cpp
 
 
dijkstra_&_bfs.cpp
dijkstra_&_bfs.cpp
 
 
fenwick.cpp
fenwick.cpp
 
 
fft_ntt.cpp
fft_ntt.cpp
 
 
matrixExpo.cpp
matrixExpo.cpp
 
 
prim_algo_n2.cpp
prim_algo_n2.cpp
 
 
segment_tree.cpp
segment_tree.cpp
 
 
subset_sum.cpp
subset_sum.cpp
 
 
umap_hasher.cpp
umap_hasher.cpp
 
 

Repository files navigation

Competitive-Programming-Templates

A collection of templates for commonly used Data Structures and Algorithms that can be used during Competitive Programming to solve problems easily and quickly.

To Do List

  • making implementations more readable and easier to understand and use
  • adding more templates
  • giving a brief explanation of all the template files and adding sources where you can learn the dsa in the template

About

A collection of templates for commonly used Data Structures and Algorithms that can be used during Competitive Programming to solve problems easily and quickly.

Topics

competitive-programming

Resources

Readme
Activity

Stars

12 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

Packages

Contributors

Languages