Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Ashishgup1/Competitive-Coding
/ functions
Functions
289 in github.com/Ashishgup1/Competitive-Coding
⨍
Functions
289
◇
Types & classes
35
Method
irrelevant
Convex Hull (Dynamic).cpp:51
Method
isParallel
Convex Hull (Dynamic).cpp:21
Function
isRectangleAnyOrder
Checks if ABCD form a rectangle, in any orientation
Geometry.cpp:25
Function
isSquareAnyOrder
Checks if ABCD form a square, in any orientation
Geometry.cpp:37
Function
kruskalMST
Kruskal's MST.cpp:66
Function
least_rotation
String Rotation (Booth's Algorithm).cpp:3
Method
max_flow
MaxFlow - Push Relabel [V^3].cpp:92
Method
max_flow
MaxFlow - Push Relabel [V^2 sqrt(E)].cpp:71
Method
max_matching
Matching (Hopcroft-Karp) in Bipartite Graph.cpp:68
Method
maxxor
Trie.cpp:44
Method
merge
Write reqd merge functions
Segment Tree.cpp:26
Method
merge
Treap.cpp:109
Method
merge
Gaussian Elimination.cpp:57
Method
minCostFlow
Min Cost Max Flow - Dijkstra.cpp:57
Function
mo
Mo's Algorithm.cpp:40
Function
mod_power
FFT (Iterative).cpp:380
Function
modular_inverse
Extended Euclidean Algorithm (Extensive).cpp:16
Function
multiply
FFT (Iterative).cpp:226
Function
multiply
FFT (Recursive).cpp:42
Method
mycomplex<float_t>
FFT (Iterative).cpp:11
Function
nCr
Factorials with nCr.cpp:37
Function
negativeCycle
Negative Cycles in Directed Graph.cpp:8
Method
node
Trie.cpp:8
Method
operation
Treap.cpp:72
Method
operator *
Matrix Struct.cpp:49
Method
operator +
Convex Hull (Graham's Scan).cpp:21
Method
operator +
Matrix Struct.cpp:36
Method
operator -
Convex Hull (Graham's Scan).cpp:27
Method
operator -
2 Closest Points in 2D Plane (N log^2 N).cpp:5
Method
operator <
Convex Hull (Graham's Scan).cpp:14
Method
operator =
Convex Hull (Graham's Scan).cpp:9
Method
operator*
FFT (Iterative).cpp:25
Method
operator+
FFT (Iterative).cpp:22
Method
operator+
Sweep Line: Intersecting Line Segments.cpp:27
Method
operator-
FFT (Iterative).cpp:23
Method
operator-
Sweep Line: Intersecting Line Segments.cpp:32
Function
operator<
Sweep Line: Intersecting Line Segments.cpp:168
Method
operator<
Sweep Line: Intersecting Line Segments.cpp:37
Method
operator<
Sweep Line: Intersecting Line Segments.cpp:133
Method
operator<
Convex Hull (Dynamic).cpp:29
Method
pQuery
Segment Tree.cpp:74
Method
pUpdate
Segment Tree.cpp:106
Function
parallel_binary
Parallel Binary Search.cpp:56
Function
persistentSegTree
Persistent Segment Tree.cpp:47
Method
point
Convex Hull (Graham's Scan).cpp:5
Function
power
Matrix Struct.cpp:67
Function
precompute
Factorials with nCr.cpp:21
Function
precompute
LCA (with Time Traversal DFS).cpp:29
Function
precompute
Sparse Matrix (RMQ).cpp:5
Function
precompute
Tree Construction with Specific Vertices.cpp:20
Method
pref
BIT - Binary Indexed Tree (Fenwick Tree).cpp:21
Method
prefMax
BIT - Binary Indexed Tree (Fenwick Tree).cpp:62
Function
primsMST
Prim's MST.cpp:7
Method
propagate
Handle lazy propagation appriopriately
Segment Tree.cpp:32
Method
push
MaxFlow - Push Relabel [V^2 sqrt(E)].cpp:32
Function
query
Persistent Segment Tree.cpp:34
Function
query
SQRT Decomposition.cpp:133
Method
query
Segment Tree.cpp:125
Function
query_hld
Heavy Light Decomposition (HLD).cpp:184
Method
relabel
MaxFlow - Push Relabel [V^3].cpp:52
Method
relabel
MaxFlow - Push Relabel [V^2 sqrt(E)].cpp:43
Function
remove
Intervals Handling.cpp:16
Method
remove
Trie.cpp:33
Method
reset
Matrix Struct.cpp:22
Method
rsum
BIT - Binary Indexed Tree (Fenwick Tree).cpp:32
Function
scc
Strongly Connected Component.cpp:36
Function
sccAddEdge
Strongly Connected Component.cpp:30
Method
search
BIT - Binary Indexed Tree (Fenwick Tree).cpp:39
Method
semiQuery
SQRT Decomposition.cpp:75
Method
semiUpdate
SQRT Decomposition.cpp:25
Function
solve
Sweep Line: Intersecting Line Segments.cpp:187
Function
solve
2 Closest Points in 2D Plane (N log^2 N).cpp:30
Method
solve
2-SAT.cpp:43
Method
split
Treap.cpp:95
Method
splitPos
Treap.cpp:81
Function
square
FFT (Iterative).cpp:165
Function
toposort
Topological Sort.cpp:3
Method
trie
Trie.cpp:18
Method
unite
DSU (Disjoint Set Union).cpp:29
Method
update
BIT - Binary Indexed Tree (Fenwick Tree).cpp:12
Method
update
Segment Tree.cpp:135
Method
updateCnt
Treap.cpp:40
Method
updateLeftBorder
Updates xValue of line pointed by it
Convex Hull (Dynamic).cpp:62
Method
updateMax
BIT - Binary Indexed Tree (Fenwick Tree).cpp:53
Function
update_hld
Heavy Light Decomposition (HLD).cpp:201
Function
walk
LCA (with Time Traversal DFS).cpp:19
Function
walk
Heavy Light Decomposition (HLD).cpp:53
Function
work
Tree Construction with Specific Vertices.cpp:58
Function
z_function
Z Algorithm.cpp:6
← previous
201–289 of 289, ranked by callers