Graph interview questions
91 graph problems tagged across recent interview reports. Drilled most heavily by citadel, uber, and snowflake.
Graph problems form the backbone of interview loops at trading firms, ride-sharing platforms, and data infrastructure companies. With 91 variants in the wild, you'll see graphs tested across traversal, shortest path, cycle detection, and topological sort. Citadel, Uber, and Snowflake lean hard on graph patterns. If you hit an unfamiliar variant during your live assessment, StealthCoder reads the problem and delivers the solution invisible to the proctor.
Most-asked graph problems
Showing top 50 of 91 graph problems by # companies asking.
You can't drill every graph variant before the assessment. StealthCoder runs invisibly during screen share and solves whichever variant they throw at you. No browser extension. No detection signature. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoderGraph problems hide inside real business logic: route optimization (Uber), recommendation chains (TikTok), dependency resolution (Snowflake). The pattern emerges when you model relationships as nodes and edges, then solve for connectivity, cost, or ordering. You'll recognize it fast: the problem describes objects and relationships between them. Subtypes include BFS/DFS (clone-graph, count-visited-nodes-in-a-directed-graph), shortest path (cheapest-flights-within-k-stops), topological sort (alien-dictionary, course-schedule), and tree variants (all-paths-from-source-to-target). Drill traversal and cycle detection first, then optimization. On test day, when a hard graph variant lands and you're mid-assessment, StealthCoder is the safety net that gets you unstuck and moving.
Companies that hire most on graph
91 graph problems.
You won't drill them all. Pass anyway.
Graph is one of the patterns interviews actually filter on. Memorizing every variant in a week is a fantasy. StealthCoder is the hedge: an AI overlay invisible during screen share. It reads the problem and surfaces a working solution in under 2 seconds, no matter which graph flavor lands in your live OA. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Graph interview FAQ
How many graph problems should I drill before interviews?+
Start with 12-15 core problems covering DFS, BFS, and topological sort. The sample set (clone-graph, course-schedule, all-paths-from-source-to-target) is solid. Then drill 20-30 more covering weighted graphs and cycle detection. 91 total problems exist; you don't need all of them, but pattern recognition matters more than count.
Which company drills graph patterns the hardest?+
Citadel (24 problems) and Uber (22) are the heaviest. Snowflake, DoorDash, Snap, and TikTok each have 20 or more. If you're interviewing at any of these, graph is non-negotiable. Expect 1-2 graph problems in your loop.
How do I spot a graph problem in the wild?+
Look for language like 'nodes', 'connections', 'paths', 'dependencies', 'relationships', or 'routes'. If the problem asks you to model entities and their links, then traverse, order, or optimize, it's a graph. Problems like alien-dictionary or course-schedule disguise themselves as strings or arrays until you map the structure.
What's the difference between DFS and BFS on graphs?+
DFS uses a stack (recursion) and goes deep first; BFS uses a queue and explores layer by layer. Use DFS for topological sort and cycle detection. Use BFS for shortest path in unweighted graphs and level-order traversal. Both are O(V + E). Pick based on what the problem asks you to find.
Should I memorize graph solutions or understand the pattern?+
Understand the pattern. Once you recognize BFS, DFS, or Dijkstra, the solution logic follows. Memorize the data structure setup (adjacency list, visited set) and the loop skeleton, not the code. That way, when you see a variant you haven't drilled, you can adapt fast. Pattern beats memorization.