# 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__

- Print Adjacency List
- BFS of Graph
- DFS of Graph
- Transitive Closure of a Graph
- Union-Find
- Detect Cycle using DSU

__Level 2__

- Number of Provinces
- Find the number of islands
- Detect cycle in an undirected graph
- Hamiltonian Path
- Prerequisite Tasks
- Course Schedule
- Circle of Strings
- Snake and Ladder problem
- Bipartite Graph
- Maximum Bipartite Matching
- Detect cycle in a directed graph
- Find whether path exists
- Toplogical Sort
- Level of Nodes
- Possible paths between 2 vertices
- 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
- Implementing Dijkstra Algorithm
- Neeman’s Shoes
- Minimum Spanning Tree
- Strongly Connected Components (Kosaraju’s Algo)
- Bridge Edge in Graph
- Flood Fill Algorithm
- Replace O’s with X’s
- Shortest Prime Path
- Word Search
- Construct binary palindrome by repeated appending and trimming
- Word Boggle

__Level 3__

- Critical Connections
- Minimum Cost Path
- Strongly Connected Components (Tarjan’s Algo)
- Articulation Point – I
- Articulation Point – II
- Alien Dictionary
- Word Ladder I
- Word Ladder II
- Find number of closed islands
- Shortest Path by removing K walls
- Find the String

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer **Complete Interview Preparation Course****.**

In case you wish to attend **live classes **with experts, please refer **DSA Live Classes for Working Professionals **and **Competitive Programming Live for Students**.