MCPcopy Create free account

hub / github.com/MohamedAfifii/ProblemSolving--Arabic / functions

Functions94 in github.com/MohamedAfifii/ProblemSolving--Arabic

↓ 11 callersFunctionsol
Material/19.cpp:43
↓ 9 callersFunctionloop
Solutions/Codeforces/828A.cpp:25
↓ 6 callersFunctionfind
Solutions/HackerRank/RoadsAndLibraries_dsu.cpp:16
↓ 3 callersFunctionBFS
Returns a vector containing the shortest distances from the src node to all the nodes in the (unweighted) graph. */
Solutions/Codeforces/101149L.cpp:40
↓ 3 callersFunctionloop
Material/9.cpp:52
↓ 2 callersMethodfind
Solutions/Codeforces/791B.cpp:24
↓ 2 callersFunctionloop
Solutions/Codeforces/100814I.cpp:71
↓ 1 callersFunctionBFS
Solutions/Codeforces/101147E.cpp:9
↓ 1 callersFunctionBFS
Material/16.cpp:8
↓ 1 callersFunctionEQ
Solutions/Codeforces/761B (Another sol).cpp:34
↓ 1 callersFunctionFlipEdges
This function assumes that the nodes are numbered from 0 to N-1 If the nodes are numbered from 1 to N, a small change has to be made.
Solutions/Codeforces/101149L.cpp:16
↓ 1 callersFunctionbinaryOf
Solutions/Codeforces/100814I.cpp:35
↓ 1 callersMethodcomponent_size
Solutions/Codeforces/791B.cpp:16
↓ 1 callersFunctiondfs
Solutions/Codeforces/580C.cpp:11
↓ 1 callersFunctiondfs
Solutions/HackerRank/RoadsAndLibraries_dfs.cpp:15
↓ 1 callersFunctiondfs
Material/14.cpp:14
↓ 1 callersFunctiondfs
Material/15.cpp:13
↓ 1 callersFunctiondijkstra
Solutions/UVA/10986.cpp:6
↓ 1 callersFunctiondist
Solutions/Codeforces/100814I.cpp:48
↓ 1 callersFunctionsolution
Material/1.cpp:93
↓ 1 callersFunctionsolve
Solutions/geeksforgeeks/0-1 Knapsack.cpp:11
↓ 1 callersFunctiontreeHeight
Material/15.cpp:96
↓ 1 callersFunctionunite
Solutions/HackerRank/RoadsAndLibraries_dsu.cpp:20
↓ 1 callersMethodunite
Solutions/Codeforces/791B.cpp:28
Methoddsu
Solutions/Codeforces/791B.cpp:8
Methodis_representative
Solutions/Codeforces/791B.cpp:20
Functionloop
Solutions/Codeforces/637B.cpp:25
Functionloop
Solutions/Codeforces/231A.cpp:17
Functionloop
Material/10.cpp:60
Functionloop
Material/11.cpp:58
Functionloop
Construct the graph
Material/17.cpp:24
Functionmain
Solutions/UVA/10986.cpp:38
Functionmain
Solutions/UVA/10282.cpp:15
Functionmain
Solutions/SPOJ/QUEUEEZ.cpp:11
Functionmain
Solutions/geeksforgeeks/0-1 Knapsack.cpp:34
Functionmain
Solutions/Codeforces/791B.cpp:38
Functionmain
Solutions/Codeforces/828B.cpp:34
Functionmain
Solutions/Codeforces/102B.cpp:31
Functionmain
Solutions/Codeforces/100814I.cpp:56
Functionmain
Solutions/Codeforces/776A.cpp:6
Functionmain
Solutions/Codeforces/101147E.cpp:40
Functionmain
Solutions/Codeforces/580C.cpp:28
Functionmain
Solutions/Codeforces/677A.cpp:6
Functionmain
Solutions/Codeforces/520A.cpp:8
Functionmain
Solutions/Codeforces/368B.cpp:8
Functionmain
Solutions/Codeforces/66B.cpp:37
Functionmain
Solutions/Codeforces/101149L.cpp:72
Functionmain
Solutions/Codeforces/825A.cpp:29
Functionmain
Solutions/Codeforces/433B.cpp:8
Functionmain
Solutions/Codeforces/112A.cpp:11
Functionmain
Solutions/Codeforces/268A.cpp:12
Functionmain
Solutions/Codeforces/828A.cpp:18
Functionmain
Solutions/Codeforces/101149I.cpp:15
Functionmain
Solutions/Codeforces/761B.cpp:33
Functionmain
Solutions/Codeforces/791A.cpp:6
Functionmain
Solutions/Codeforces/768A.cpp:5
Functionmain
Solutions/Codeforces/821A.cpp:34
Functionmain
Solutions/Codeforces/263A.cpp:11
Functionmain
Solutions/Codeforces/734A.cpp:6
Functionmain
Solutions/Codeforces/637B.cpp:15
Functionmain
Solutions/Codeforces/834B(Another sol).cpp:34
Functionmain
Solutions/Codeforces/834B.cpp:35
Functionmain
Solutions/Codeforces/767A.cpp:6
Functionmain
Solutions/Codeforces/59A.cpp:9
Functionmain
Solutions/Codeforces/761B (Another sol).cpp:41
Functionmain
Solutions/Codeforces/231A.cpp:8
Functionmain
Solutions/Codeforces/825B.cpp:29
Functionmain
Solutions/Codeforces/820A.cpp:49
Functionmain
Solutions/HackerRank/RoadsAndLibraries_dfs.cpp:26
Functionmain
Solutions/HackerRank/RoadsAndLibraries_dsu.cpp:30
Functionmain
Solutions/HackerRank/BFSShortReach.cpp:15
Functionmain
Material/10.cpp:18
Functionmain
Material/14.cpp:23
Functionmain
Material/11.cpp:15
Functionmain
Material/12.cpp:19
Functionmain
Material/13.cpp:9
Functionmain
Material/6.cpp:19
Functionmain
Material/16.cpp:84
Functionmain
Material/15.cpp:22
Functionmain
Material/17.cpp:9
Methodoperator<
Material/11.cpp:85
Functionpreceed
Material/11.cpp:10
Functionprint
Material/19.cpp:112
Functionsolution
Solutions/Codillity/Lesson 4 - Counting elements/MissingInteger.c:4
Functionsolution
Solutions/Codillity/Lesson 4 - Counting elements/FrogRiverOne (Using frequency array).c:4
Functionsolution
Solutions/Codillity/Lesson 4 - Counting elements/Max counters.c:6
Functionsolution
Solutions/Codillity/Lesson 4 - Counting elements/Perm check.c:9
Functionsolution
Solutions/Codillity/Lesson 4 - Counting elements/FrogRiverOne (Using set) .cpp:5
Functionsolution
Solutions/Codillity/Lesson 3 - Time complexity/PermMissingElem.c:5
Functionsolution
Solutions/Codillity/Lesson 3 - Time complexity/Tape Equilibrium .c:4
Functionsolution
Solutions/Codillity/Lesson 5 - Prefix sums/Passing cars.c:5
Functionsolution
Solutions/Codillity/Lesson 5 - Prefix sums/GenomicRangeQuery.c:4
Functionsolution
Solutions/Codillity/Lesson 7 - Stacks and Queues/Nesting.cpp:10
Functionsolution
Solutions/Codillity/Lesson 7 - Stacks and Queues/Brackets.cpp:11