Graphs

No questions match those filters.

1. 01 Clone Graph Medium
2. 02 Course Schedule Medium
3. 03 Pacific Atlantic Water Flow Medium
4. 04 Number of Islands Medium
5. 05 Alien Dictionary Hard
6. 06 Graph Valid Tree Medium
7. 07 Number of Connected Components in an Undirected Graph Medium
8. 08 Rotting Oranges Medium
9. 09 Network Delay Time Medium
10. 10 Cheapest Flights Within K Stops Medium
11. 11 Redundant Connection Medium
12. 12 Word Ladder Hard
13. 13 Accounts Merge Medium
14. 14 Surrounded Regions Medium
15. 15 Reconstruct Itinerary Hard
16. 16 Max Area of Island Medium
17. 17 Walls and Gates Medium
18. 18 Course Schedule II Medium
19. 19 Min Cost to Connect All Points Medium
20. 20 Swim in Rising Water Hard
21. 21 Flood Fill Easy
22. 22 Graph Representation (Adjacency List/Matrix) Easy
23. 23 BFS Traversal of Graph Easy
24. 24 DFS Traversal of Graph Easy
25. 25 Number of Provinces (Connected Components) Medium
26. 26 Rotten Oranges (Multi-source BFS) Medium
27. 27 Flood Fill Algorithm Easy
28. 28 Cycle Detection in Undirected Graph (BFS/DFS) Medium
29. 29 Cycle Detection in Directed Graph (DFS) Medium
30. 30 Topological Sort (BFS - Kahn's Algorithm) Medium
31. 31 Bipartite Graph Check Medium
32. 32 Shortest Path in Undirected Graph with Unit Weights Medium
33. 33 Shortest Path in Directed Acyclic Graph Medium
34. 34 Dijkstra's Algorithm Medium
35. 35 Bellman Ford Algorithm Medium
36. 36 Floyd Warshall Algorithm Medium
37. 37 Minimum Spanning Tree (Prim's Algorithm) Medium
38. 38 Disjoint Set (Union by Rank/Size) Medium
39. 39 Kruskal's Algorithm Medium
40. 40 Number of Islands II (Online Queries) Hard
41. 41 Strongly Connected Components (Kosaraju's Algorithm) Hard
42. 42 Bridges in Graph Hard
43. 43 Rotting Oranges (Minimum Time) Medium
44. 44 Create a Graph and Print It Easy
45. 45 Implement BFS and DFS Easy
46. 46 Detect Cycle in a Directed Graph Medium
47. 47 Detect Cycle in an Undirected Graph Medium
48. 48 Alien Dictionary Character Order Hard
49. 49 Implement Dijkstra's Algorithm Medium
50. 50 Implement Kruskal's Algorithm Medium
51. 51 Implement Prim's Algorithm Medium
52. 52 Implement Bellman-Ford Algorithm Medium
53. 53 Implement Floyd-Warshall Algorithm Medium
54. 54 Check Whether a Graph is Bipartite Medium
55. 55 Check if a given graph is a tree or not Medium
56. 56 Check if it is possible to survive on an island Medium
57. 57 Implement the BFS algorithm Easy
58. 58 Implement the DFS algorithm Easy
59. 59 Detect a cycle in a directed graph using BFS/DFS Medium
60. 60 Detect a cycle in an undirected graph using BFS/DFS Medium
61. 61 Clone a graph Medium
62. 62 Implement Topological Sort Medium
63. 63 Minimum time for each job to be completed given by a Directed Acyclic Graph Hard
64. 64 Find the number of islands Medium
65. 65 Total number of spanning trees in a graph Hard
66. 66 Graph Colouring Problem Hard
67. 67 Find bridges in a graph Hard
68. 68 Count strongly connected components (Kosaraju's Algorithm) Hard
69. 69 Check whether a graph is bipartite or not Medium
70. 70 Detect a negative cycle in a graph Medium
71. 71 Longest path in a Directed Acyclic Graph Hard
72. 72 Journey to the Moon Medium
73. 73 Water Jug problem using BFS Medium
74. 74 Number of triangles in a directed and undirected graph Hard
75. 75 Number of Connected Components Medium