Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Abhishek-Saini/educational
/ functions
Functions
2,330 in github.com/Abhishek-Saini/educational
⨍
Functions
2,330
◇
Types & classes
131
Method
Treap
cses/advanced/Cut_and_Paste.cpp:51
Method
Treap
cses/advanced/Substring_Reversals.cpp:51
Method
Treap
cses/advanced/Reversals_and_Sums.cpp:51
Method
Trie
cses/string/Word_Combinations.cpp:170
Method
Trie
codeforces/round_edu_159/E_Collapsing_Strings.cpp:49
Method
UF
cses/advanced/Eulerian_Subgraphs.cpp:40
Method
UF
cses/advanced/New_Roads_Queries.cpp:70
Method
UF
cses/graph/Road_Construction.cpp:41
Method
addBiEdge
cses/graph/Distinct_Routes.cpp:71
Method
addEdge
cses/graph/Police_Chase.cpp:60
Method
add_to_tree
cses/advanced/Dynamic_Connectivity.cpp:117
Method
apply
cses/range_queries/Prefix_Sum_Queries.cpp:65
Method
apply
cses/range_queries/Polynomial_Queries.cpp:62
Method
apply
cses/range_queries/Range_Updates_and_Sums.cpp:62
Method
apply
cses/range_queries/Subarray_Sum_Queries.cpp:65
Method
balance
cses/sorting_and_searching/Sliding_Median.cpp:43
Method
balance
cses/sorting_and_searching/Sliding_Cost.cpp:43
Method
balance
youtube/stl_practice.cpp:451
Method
balance
youtube/mix_practice.cpp:118
Method
bfs
cses/graph/Distinct_Routes.cpp:78
Method
bfs
cses/graph/School_Dance.cpp:67
Method
bfs
cses/graph/Police_Chase.cpp:74
Method
bfs
cses/graph/Download_Speed.cpp:67
Function
bitSet
cses/introductory/Bit_Strings.cpp:50
Function
bitSet
cses/advanced/New_Roads_Queries.cpp:45
Function
bitSet
codeforces/round_edu_159/F_Trees_and_XOR_Queries_Again.cpp:51
Function
bruteForceCompute
cses/advanced/Houses_and_Schools.cpp:68
Method
build
A[] input array should be ready before calling this
atcoder_educational_dp_problems/W_Intervals.cpp:137
Method
build
int findFirstOneTree(int st, int end, int ind, int l, int r) { if(st == end and l == r) return l; int mid; mid = st + (end - st) / 2; if(r <= mid) ret
codeforces/round_922/D_Blocking_Elements.cpp:123
Method
buildTree
cses/range_queries/Pizzeria_Queries.cpp:47
Method
buildTree
cses/range_queries/Dynamic_Range_Minimum_Queries.cpp:50
Method
buildTree
cses/range_queries/Increasing_Array_Queries.cpp:57
Method
buildTree
cses/range_queries/Prefix_Sum_Queries.cpp:89
Method
buildTree
cses/range_queries/List_Removals.cpp:53
Method
buildTree
cses/range_queries/Polynomial_Queries.cpp:88
Method
buildTree
cses/range_queries/Range_Updates_and_Sums.cpp:88
Method
buildTree
cses/range_queries/Subarray_Sum_Queries.cpp:89
Method
buildTree
cses/range_queries/Hotel_Queries.cpp:50
Method
buildTree
cses/tree/Path_Queries_II.cpp:56
Method
buildTree
cses/tree/Subtree_Queries.cpp:51
Method
buildTree
cses/tree/dfs_numbering.cpp:51
Method
buildTree
atcoder_educational_dp_problems/Q_Flowers.cpp:53
Method
buildTree
atcoder_educational_dp_problems/W_Intervals.cpp:81
Method
buildTree
codeforces/round_edu_165/E_Unique_Array.cpp:75
Method
buildTree
codeforces/round_922/D_Blocking_Elements.cpp:76
Method
buildTree
codeforces/round_edu_159/F_Trees_and_XOR_Queries_Again.cpp:114
Method
cnt
cses/advanced/Cut_and_Paste.cpp:54
Method
cnt
cses/advanced/Substring_Reversals.cpp:54
Method
cnt
cses/advanced/Reversals_and_Sums.cpp:54
Method
combineNodes
change below function and initilization step in buildTree it uses A[] while building the tree and change updateTree for updating
cses/range_queries/Increasing_Array_Queries.cpp:54
Method
combineNodes
cses/range_queries/Prefix_Sum_Queries.cpp:45
Method
combineNodes
cses/range_queries/Polynomial_Queries.cpp:45
Method
combineNodes
cses/range_queries/Range_Updates_and_Sums.cpp:45
Method
combineNodes
cses/range_queries/Subarray_Sum_Queries.cpp:45
Method
dfs
cses/advanced/Task_Assignment.cpp:96
Method
dfs
cses/advanced/Distinct_Routes_II.cpp:96
Method
dfs
cses/advanced/Parcel_Delivery.cpp:97
Method
dfs
cses/advanced/Dynamic_Connectivity.cpp:134
Method
dfs
cses/graph/Distinct_Routes.cpp:94
Method
dfs
cses/graph/School_Dance.cpp:83
Method
dfs
cses/graph/Police_Chase.cpp:90
Method
dfs
cses/graph/Download_Speed.cpp:83
Method
dsu_save
cses/advanced/Dynamic_Connectivity.cpp:41
Method
dsu_with_rollbacks
cses/advanced/Dynamic_Connectivity.cpp:52
Method
edge
cses/advanced/Task_Assignment.cpp:47
Method
edge
cses/advanced/Distinct_Routes_II.cpp:47
Method
edge
cses/advanced/Parcel_Delivery.cpp:48
Method
empty
youtube/min_deque.cpp:66
Method
erase
cses/advanced/Substring_Reversals.cpp:137
Method
erase
cses/advanced/Reversals_and_Sums.cpp:137
Method
findAns
cses/tree/Fixed_Length_Paths_I.cpp:114
Method
findCentriod
cses/tree/Finding_a_Centroid.cpp:81
Method
findCentriod
cses/tree/Fixed_Length_Paths_I.cpp:103
Method
findFirstOne
cses/range_queries/Pizzeria_Queries.cpp:107
Method
findFirstOne
cses/range_queries/Dynamic_Range_Minimum_Queries.cpp:110
Method
findFirstOne
cses/tree/Subtree_Queries.cpp:111
Method
findFirstOne
cses/tree/dfs_numbering.cpp:111
Method
findFirstOne
atcoder_educational_dp_problems/Q_Flowers.cpp:113
Method
findFirstOneTree
cses/range_queries/Pizzeria_Queries.cpp:87
Method
findFirstOneTree
cses/range_queries/Dynamic_Range_Minimum_Queries.cpp:90
Method
findFirstOneTree
cses/range_queries/List_Removals.cpp:93
Method
findFirstOneTree
cses/range_queries/Hotel_Queries.cpp:90
Method
findFirstOneTree
cses/tree/Subtree_Queries.cpp:91
Method
findFirstOneTree
cses/tree/dfs_numbering.cpp:91
Method
findFirstOneTree
atcoder_educational_dp_problems/Q_Flowers.cpp:93
Function
findGcd
cses/introductory/Bit_Strings.cpp:55
Function
findGcd
cses/advanced/New_Roads_Queries.cpp:50
Function
findGcd
atcoder_educational_dp_problems/O_Matching.cpp:176
Function
findGcd
codeforces/round_edu_159/F_Trees_and_XOR_Queries_Again.cpp:56
Method
findKth
codeforces/round_907/F_A_Growing_Tree.cpp:68
Method
findSum
codeforces/round_907/F_A_Growing_Tree.cpp:63
Method
findSz
cses/tree/Finding_a_Centroid.cpp:71
Method
findSz
cses/tree/Fixed_Length_Paths_I.cpp:93
Method
find_set
cses/advanced/Dynamic_Connectivity.cpp:64
Function
gcd
youtube/maths_lec.cpp:199
Method
getMedian
youtube/mix_practice.cpp:146
Method
getMin
youtube/min_deque.cpp:54
Method
isNotNeeded
Function to check if line l3 is not needed, given l1 and l2
cses/advanced/Monster_Game_I.cpp:52
Method
item
cses/advanced/Cut_and_Paste.cpp:45
Method
item
cses/advanced/Substring_Reversals.cpp:45
← previous
next →
701–800 of 2,330, ranked by callers