Functions — github.com/LeadCoding/3-weeks-Google-Prep

CodeHub MCPcopy Create free account

hub / github.com/LeadCoding/3-weeks-Google-Prep / functions

Functions71 in github.com/LeadCoding/3-weeks-Google-Prep

⨍ Functions 71 ◇ Types & classes 10

↓ 12 callersFunctionfind

01. Graphs/06. MST/1. Kruskals.cpp:14

↓ 11 callersMethodfind

01. Graphs/07. DSU/1. DSUSnippetClass.cpp:16

↓ 4 callersFunctiondfs

Learnings We made the (DAG) using BFS traversal. then applied DFS to find all (source to destination paths) */

01. Graphs/02. BFS/2. WordLadder2.cpp:6

↓ 3 callersFunctionunite

01. Graphs/06. MST/1. Kruskals.cpp:18

↓ 3 callersFunctionwtMst

01. Graphs/06. MST/1. Kruskals.cpp:33

↓ 2 callersFunctionfunc

02. Dynamic Programming/3. Digit DP-MagicNumbers.cpp:6

↓ 2 callersFunctionpoly_hash

04. Rolling hash/1. Rabin_carp.cpp:9

↓ 2 callersFunctionpowr

04. Rolling hash/1. Rabin_carp.cpp:24

↓ 1 callersMethodbuild

03. SegmentTree/2. Xenia.cpp:8

↓ 1 callersMethodbuildSegmentTree

03. SegmentTree/1. SegmentTreeSnippetClass.cpp:9

↓ 1 callersFunctiondetectCycle

01. Graphs/04. CycleDetection/1. DetectCycleUndirectedGraph.cpp:4

↓ 1 callersFunctiondetectCycle

01. Graphs/04. CycleDetection/2. DetectCycleDirectedGraph.cpp:4

↓ 1 callersFunctiondfs

01. Graphs/03. DFS/3. ConnectedComponents.cpp:21

↓ 1 callersFunctiondfs

https://www.hackerrank.com/challenges/journey-to-the-moon/problem the people in 1 component cant go together but thet can go with rest of the peo

01. Graphs/03. DFS/1. JourneyToTheMoon.cpp:8

↓ 1 callersFunctiondfs

01. Graphs/03. DFS/2. DFSwithStoppingCondition.cpp:9

↓ 1 callersFunctiondfs

01. Graphs/03. DFS/4. ReconstructItinerary.cpp:6

↓ 1 callersFunctiondfs

01. Graphs/05. Topological Sort/2. TopologicalDFS.cpp:1

↓ 1 callersFunctiondfs

01. Graphs/05. Topological Sort/4. LargestColorValueInADirectedGraph.cpp:3

↓ 1 callersFunctiondfs

01. Graphs/04. CycleDetection/5. DetectCyclesin2DGrid.cpp:1

↓ 1 callersFunctiondfs

Notes 1-We can easily solve the problem of IsBipartite graph by DFS/BFS alternate colouring 2-Property to be Bipartite ( either no cyle ie Tre

01. Graphs/04. CycleDetection/3. IsBipartite.cpp:11

↓ 1 callersFunctionhelp

02. Dynamic Programming/1. Barcode.cpp:4

↓ 1 callersFunctioninv

04. Rolling hash/1. Rabin_carp.cpp:38

↓ 1 callersMethodquery

03. SegmentTree/1. SegmentTreeSnippetClass.cpp:22

↓ 1 callersFunctionsolve

01. Graphs/02. BFS/1. Boredom.cpp:4

↓ 1 callersMethodupdate

03. SegmentTree/1. SegmentTreeSnippetClass.cpp:38

↓ 1 callersMethodupdate

03. SegmentTree/2. Xenia.cpp:24

MethodSegmentTree

03. SegmentTree/1. SegmentTreeSnippetClass.cpp:53

MethodSegmentTree

03. SegmentTree/2. Xenia.cpp:57

MethodUnionFind

01. Graphs/07. DSU/1. DSUSnippetClass.cpp:6

01. Graphs/07. DSU/1. DSUSnippetClass.cpp:22

MethodcherryPickup

02. Dynamic Programming/2. CherryPick.cpp:16

FunctioncontainsCycle

01. Graphs/04. CycleDetection/5. DetectCyclesin2DGrid.cpp:16

01. Graphs/10.Articulation Point and Bridges/1. CutEdges.cpp:1

01. Graphs/10.Articulation Point and Bridges/2. CutVertex.cpp:1

Function to find number of strongly connected components in the graph.

01. Graphs/09. StronglyConnected/1. Kosarju.cpp:16

01. Graphs/08. Shortest Paths Algo/1. Dijkstras.cpp:20

01. Graphs/07. DSU/2. Redundant Connection II.cpp:17

FunctionfindCriticalAndPseudoCriticalEdges

01. Graphs/06. MST/1. Kruskals.cpp:61

FunctionfindItinerary

01. Graphs/03. DFS/4. ReconstructItinerary.cpp:19

FunctionfindLadders

01. Graphs/02. BFS/2. WordLadder2.cpp:17

FunctionfindOrder

01. Graphs/05. Topological Sort/2. TopologicalDFS.cpp:16

MethodfindOrder

01. Graphs/05. Topological Sort/1. TopologicalBFS.cpp:3

MethodfindRedundantDirectedConnection

01. Graphs/07. DSU/2. Redundant Connection II.cpp:33

FunctiongameRoutes

01. Graphs/05. Topological Sort/3. GameRoutes.cpp:1

01. Graphs/04. CycleDetection/6. Maximum Employees to Be Invited to a Meeting.cpp:15

02. Dynamic Programming/2. CherryPick.cpp:4

FunctionisBipartite

01. Graphs/04. CycleDetection/3. IsBipartite.cpp:29

FunctionjourneyToMoon

01. Graphs/03. DFS/1. JourneyToTheMoon.cpp:17

01. Graphs/09. StronglyConnected/1. Kosarju.cpp:25

FunctionlargestPathValue

01. Graphs/05. Topological Sort/4. LargestColorValueInADirectedGraph.cpp:25

04. Rolling hash/1. Rabin_carp.cpp:42

02. Dynamic Programming/3. Digit DP-MagicNumbers.cpp:32

02. Dynamic Programming/1. Barcode.cpp:31

03. SegmentTree/1. SegmentTreeSnippetClass.cpp:70

03. SegmentTree/2. Xenia.cpp:76

01. Graphs/02. BFS/4. ValidBFS.cpp:9

01. Graphs/02. BFS/1. Boredom.cpp:22

01. Graphs/01. Representation/1. List.cpp:4

01. Graphs/01. Representation/2. Matrix.cpp:4

FunctionmaximalPathQuality

01. Graphs/03. DFS/2. DFSwithStoppingCondition.cpp:30

MethodmaximumInvitations

01. Graphs/04. CycleDetection/6. Maximum Employees to Be Invited to a Meeting.cpp:24

FunctionminCostConnectPoints

01. Graphs/06. MST/2. Prims.cpp:20

FunctionminSwapsCouples

01. Graphs/03. DFS/3. ConnectedComponents.cpp:28

MethodminimumWeight

01. Graphs/08. Shortest Paths Algo/1. Dijkstras.cpp:40

MethodnetworkDelayTime

01. Graphs/08. Shortest Paths Algo/2. BellmanFord.cpp:13

03. SegmentTree/2. Xenia.cpp:45

FunctionshortestPathLength

01. Graphs/02. BFS/3. MultiSourceBFS.cpp:13

01. Graphs/04. CycleDetection/1. DetectCycleUndirectedGraph.cpp:17

01. Graphs/04. CycleDetection/2. DetectCycleDirectedGraph.cpp:17

01. Graphs/04. CycleDetection/4. LengthOfSmallestCycle.cpp:13

01. Graphs/07. DSU/2. Redundant Connection II.cpp:21