•PRACTICE

DSA Question Tracker & Breakdowns

28 problems tagged Graph with full breakdowns.

433problems
32companies
39topics
3languages each
Graph✕Clear all
210.Course Schedule II
Depth-First SearchBreadth-First SearchGraph
Medium+3▶ Mock
207.Course Schedule
Depth-First SearchBreadth-First SearchGraph
Medium+4▶ Mock
269.Alien Dictionary
GraphTopological SortDepth-First Search
Hard+2▶ Mock
133.Clone Graph
Depth-First SearchBreadth-First SearchGraph
Medium+1▶ Mock
399.Evaluate Division
ArrayStringDepth-First Search
Medium▶ Mock
2858.Minimum Edge Reversals So Every Node Is Reachable
Dynamic ProgrammingDepth-First SearchBreadth-First Search
2477.Minimum Fuel Cost to Report to the Capital
TreeDepth-First SearchBreadth-First Search
Medium▶ Mock
631.Design Excel Sum Formula
ArrayHash TableString
797.All Paths From Source to Target
BacktrackingDepth-First SearchBreadth-First Search
Medium▶ Mock
2204.Distance to a Cycle in Undirected Graph
Depth-First SearchBreadth-First SearchGraph
785.Is Graph Bipartite?
Depth-First SearchBreadth-First SearchUnion Find
Medium▶ Mock
802.Find Eventual Safe States
Depth-First SearchBreadth-First SearchGraph
Medium▶ Mock
1136.Parallel Courses
GraphTopological SortDirected Acyclic Graph
Medium▶ Mock
743.Network Delay Time
Depth-First SearchBreadth-First SearchGraph
Medium▶ Mock
547.Number of Provinces
Depth-First SearchBreadth-First SearchUnion Find
Medium▶ Mock
2039.The Time When the Network Becomes Idle
ArrayBreadth-First SearchGraph
Medium▶ Mock
332.Reconstruct Itinerary
ArrayStringDepth-First Search
787.Cheapest Flights Within K Stops
Dynamic ProgrammingDepth-First SearchBreadth-First Search
Medium▶ Mock
851.Loud and Rich
ArrayDepth-First SearchGraph
Medium▶ Mock
886.Possible Bipartition
Depth-First SearchBreadth-First SearchUnion Find
Medium▶ Mock
928.Minimize Malware Spread II
ArrayHash TableDepth-First Search
1298.Maximum Candies You Can Get from Boxes
ArrayBreadth-First SearchGraph
2050.Parallel Courses III
ArrayDynamic ProgrammingGraph
2097.Valid Arrangement of Pairs
Depth-First SearchGraphEulerian Circuit
2101.Detonate the Maximum Bombs
ArrayMathDepth-First Search
Medium▶ Mock
2360.Longest Cycle in a Graph
Depth-First SearchBreadth-First SearchGraph

Practice with a Mock Interview

Solve these problems under real interview pressure with our AI interviewer.

Start Mock Interview →