Data Structures
graph

23 problems

#

Title

Acceptance

Difficulty

1

Find if Path Exists in Graph(easy)
graph
breadth-first search
depth-first search
+4 more

42.8%

easy

2

graph
depth-first search
graph algorithms
+1 more

0.0%

easy

3

graph
matrix
depth-first search
+2 more

41.5%

Med.

4

graph
topological sort
depth-first search
+2 more

64.2%

Med.

5

45.0%

Med.

6

0.0%

Med.

7

breadth-first search
graph algorithms
shortest path
+3 more

69.5%

hard

8

matrix traversal
graph
depth-first search
+4 more

49.1%

easy

9

depth-first search
breadth-first search
matrix traversal
+3 more

38.3%

easy

10

matrix
depth-first search
hash set
+3 more

62.5%

Med.

11

topological sort
graph algorithms
graph
+4 more

25.9%

Med.

12

topological sort
graph
graph algorithms
+3 more

46.3%

Med.

13

topological sort
graph algorithms
graph
+2 more

47.1%

Med.

14

topological sort
backtracking
graph
+3 more

20.0%

hard

15

topological sort
graph algorithms
string
+2 more

45.5%

hard

16

topological sort
graph
breadth-first search
+1 more

31.8%

hard

17

graph
topological sort
tree breadth first search
+2 more

29.1%

hard

18

graph
union-find
graph algorithms
+2 more

45.5%

Med.

19

graph
matrix
depth-first search
+2 more

41.5%

Med.

20

graph
graph algorithms
breadth-first search
+1 more

37.5%

Med.

21

clone
graph
depth-first search
+2 more

46.0%

Med.

22

31.7%

Med.

23

graph
union-find
depth-first search
+2 more

30.7%

Med.