Graviton coding interview
questions, leaked.
7 problems reported across recent Graviton interviews. Top patterns: array, depth first search, breadth first search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Graviton's coding interview is graph-heavy and built for speed. You're looking at seven problems across five mediums and two hards, with almost every question touching arrays, DFS, BFS, or dynamic programming. The good news: patterns repeat. The hard part: you need to recognize them fast. If you blank mid-interview and can't see the DP angle on a string problem, or if the graph traversal stalls, StealthCoder runs invisibly during your live assessment and surfaces a working solution in seconds. That's your net.
Top problems at Graviton
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Largest Number | MEDIUM | 100.0 | 41% | Array · String · Greedy |
| 02 | Keys and Rooms | MEDIUM | 100.0 | 75% | Depth-First Search · Breadth-First Search · Graph |
| 03 | Decode Ways | MEDIUM | 100.0 | 37% | String · Dynamic Programming |
| 04 | 01 Matrix | MEDIUM | 100.0 | 51% | Array · Dynamic Programming · Breadth-First Search |
| 05 | Course Schedule | MEDIUM | 100.0 | 49% | Depth-First Search · Breadth-First Search · Graph |
| 06 | Binary Tree Cameras | HARD | 89.5 | 47% | Dynamic Programming · Tree · Depth-First Search |
| 07 | Collect Coins in a Tree | HARD | 89.5 | 36% | Array · Tree · Graph |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Graviton OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- array3 · 43%
- depth first search3 · 43%
- breadth first search3 · 43%
- graph3 · 43%
- dynamic programming3 · 43%
- string2 · 29%
- topological sort2 · 29%
- tree2 · 29%
- greedy1 · 14%
- sorting1 · 14%
Three problems sit at the intersection of graph traversal and topological sort, which means understanding dependency ordering is non-negotiable here. Course Schedule and Collect Coins in a Tree will dominate your prep. DFS and BFS appear in three problems each, and you must be fluent in both by interview day. Dynamic programming also hits three times, but it's tied to strings and trees rather than standing alone, so context matters. Arrays show up in four of seven problems, but usually paired with another pattern. Start with Keys and Rooms to nail graph basics, then move to Course Schedule for topological intuition. Binary Tree Cameras is the hardest problem reported and blends DP with DFS on trees. If you haven't solved it twice before the interview, StealthCoder is your hedge on the live assessment.
Companies with similar patterns
If you prepped for Graviton, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Graviton.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Graviton interview FAQ
Should I drill all graph and DP problems equally for Graviton?+
No. Course Schedule and Collect Coins in a Tree appear in the reported problems and combine graphs with topological sort. Start there. Keys and Rooms is simpler but teaches you DFS and BFS patterns you'll recognize in harder problems. DP is present but always paired with something else (string, tree, array), so study it in context.
How many medium problems should I solve before the interview?+
Five mediums are reported for Graviton. You should solve all of them at least once, ideally twice. Focus on Largest Number, Keys and Rooms, Decode Ways, 01 Matrix, and Course Schedule. Repetition is what locks in the pattern recognition you need when you're live.
Is topological sort really that important for Graviton?+
Yes. Two of seven problems explicitly use it: Course Schedule and Collect Coins in a Tree. Both are higher difficulty. If topological sort feels shaky, prioritize it in your last few days. Kahn's algorithm and DFS-based topo sort should both be muscle memory.
What's the hardest problem Graviton reportedly asks?+
Binary Tree Cameras is rated hard and combines DP with tree traversal and DFS. It's a real stumper. Solve it multiple times before interview day. If you hit it live and freeze, StealthCoder will have a solution ready to unblock you invisibly.
Should I worry about string and sorting problems?+
String appears twice and sorting once. Largest Number mixes both with arrays and greedy logic. Decode Ways pairs string with DP. They're secondary to graph and DP prep, but don't skip them. They're on the list for a reason and show up in the tail of the reported problems.