Suryanand
Resources
Sky
Emerald
Database
Home
← All DSA topics
·
System design
Graphs
20 problems in this topic. Select one to open the tabbed viewer.
Problems
1.
200. Number of Islands
2.
207. Course Schedule — detect cycle in directed graph.
3.
210. Course Schedule II
4.
133. Clone Graph
5.
743. Network Delay Time — Dijkstra from k.
6.
994. Rotting Oranges — multi-source BFS.
7.
130. Surrounded Regions — flip O's not connected to border.
8.
417. Pacific Atlantic Water Flow
9.
399. Evaluate Division — weighted union / DFS on factor graph.
10.
787. Cheapest Flights Within K Stops — Bellman-Ford k+1 relaxations.
11.
752. Open the Lock — BFS on 4-digit wheels with deadends.
12.
127. Word Ladder — BFS shortest transformation sequence length.
13.
684. Redundant Connection — undirected graph, return last edge that creates cycle.
14.
1192. Critical Connections — Tarjan bridges.
15.
841. Keys and Rooms
16.
785. Is Graph Bipartite?
17.
310. Minimum Height Trees — leaf peeling / topological trim.
18.
1020. Number of Enclaves — flood border 1's, count remaining.
19.
934. Shortest Bridge — BFS between two islands.
20.
329. Longest Increasing Path in a Matrix — memoized DFS.