Top 50 Graph Coding Problems for Interviews

Here is the collection of the Top 50 list of frequently asked interviews question on Graph. Problems in this Article are divided into three Levels so that readers can practice according to the difficulty level step by step.

Level 1

1. Print Adjacency List
2. BFS of Graph
3. DFS of Graph
4. Transitive Closure of a Graph
5. Union-Find
6. Detect Cycle using DSU

Level 2

1. Number of Provinces
2. Find the number of islands
3. Detect cycle in an undirected graph
4. Hamiltonian Path
5. Prerequisite Tasks
6. Course Schedule
7. Circle of Strings
8. Snake and Ladder problem
9. Bipartite Graph
10. Maximum Bipartite Matching
11. Detect cycle in a directed graph
12. Find whether path exists
13. Toplogical Sort
14. Level of Nodes
15. Possible paths between 2 vertices
16. X Total Shapes
17. Distance of nearest cell having 1
18. Mother Vertex
19. Unit Area of largest region of 1’s
20. Rotten Oranges
21. Minimum Swaps to Sort
22. Steps by Knight
23. Implementing Dijkstra Algorithm
24. Neeman’s Shoes
25. Minimum Spanning Tree
26. Strongly Connected Components (Kosaraju’s Algo)
27. Bridge Edge in Graph
28. Flood Fill Algorithm
29. Replace O’s with X’s
30. Shortest Prime Path
31. Word Search
32. Construct binary palindrome by repeated appending and trimming
33. Word Boggle

Level 3

1. Critical Connections
2. Minimum Cost Path
3. Strongly Connected Components (Tarjan’s Algo)
4. Articulation Point – I
5. Articulation Point – II
6. Alien Dictionary
7. Word Ladder I
8. Word Ladder II
9. Find number of closed islands
10. Shortest Path by removing K walls
11. Find the String