Graph Coding Problems for Interviews
Last Updated :
20 Sep, 2025
Improve
Here is the collection of the Top 50 list of frequently asked interview questions on Graph. Problems in this Article are divided into three Levels so that readers can practice according to the difficulty level step by step.
Easy Problems
- BFS of Graph
- DFS of Graph
- Number of islands
- Detect cycle in an undirected graph
- Bipartite Graph
- Snake and Ladder problem
- Flood Fill Algorithm
- Replace O’s with X’s
Medium Problems
- Cycle in a Directed Graph
- Union-Find
- Kruskal's Minimum Spanning Tree
- Prim's Minimum Spanning Tree
- Dijkstra's Shortest Path
- Bellman Ford Algorithm
- Floyd's Algorithm
- Toplogical Sort
- Prerequisite Tasks
- Course Schedule
- Circle of Strings
- Maximum Bipartite Matching
- Detect cycle in a directed graph
- Find whether path exists
- Possible paths between 2 vertices
- Find the number of ‘X’ total shapes
- Distance of nearest cell having 1
- Mother Vertex
- Unit Area of largest region of 1’s
- Rotten Oranges
- Minimum Swaps to Sort
- Steps by Knight
- Dijkstra Algorithm
- Word Search
- Word Boggle
Hard Problems
- Minimum Weight Cycle
- Bridge Edge in Graph
- Strongly Connected Components (Kosaraju’s Algo)
- Minimum Cost Path
- Strongly Connected Components (Tarjan’s Algo)
- Articulation Point
- Alien Dictionary
- Word Ladder I
- Word Ladder II
- Number of closed islands
- Shortest Path by removing K walls
- Min Length String with All Substrings of Size N
- Hamiltonian Path
Related Articles
- Array Coding Problems for Interviews
- String Coding Problems for Interviews
- Tree Coding Problems for Interviews
- Dynamic Programming Coding Problems for Interviews
- Sorting Coding Problems for Interviews
- Searching Coding Problems for Interviews
- Binary Search Tree Coding Problems for Interviews
Related Tutorials
Graph Practice Problems | Graph Data Structure | DSA Course
Article Tags :
