Problem database last updated: June 20, 2025
7 problems · 0 Easy, 5 Medium, 2 Hard · Ranked #189 of 458
0 Easy
0% · avg 23%
5 Medium
71% · avg 59%
2 Hard
29% · avg 18%
Based on 7 reported problems, Graviton interviews are significantly harder than average - 29% Hard vs 18% across all companies. The majority (71%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Graviton puts unusual emphasis on topological-sort (28.6% of problems, 24.3x the industry average), graph (42.9% of problems, 14.5x the industry average), breadth-first-search (42.9% of problems, 5.2x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are depth-first-search (42.9%), breadth-first-search (42.9%), graph (42.9%), array (42.9%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Course Schedule There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b... | Medium | Very Likely | depth-first-searchbreadth-first-searchgraph | Solve |
01 Matrix Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell. | Medium | Very Likely | arraydynamic-programmingbreadth-first-search | Solve |
Decode Ways You have intercepted a secret message encoded as a string of numbers. The message is decoded via the following mapping: | Medium | Very Likely | stringdynamic-programming | Solve |
Largest Number Given a list of non-negative integers nums, arrange them such that they form the largest number and return it. | Medium | Very Likely | arraystringgreedy | Solve |
Keys and Rooms There are n rooms labeled from 0 to n - 1 and all the rooms are locked except for room 0. Your goal is to visit all the rooms. However, you cannot enter a locke... | Medium | Very Likely | depth-first-searchbreadth-first-searchgraph | Solve |
Collect Coins in a Tree There exists an undirected and unrooted tree with n nodes indexed from 0 to n - 1. You are given an integer n and a 2D integer array edges of length n - 1, wher... | Hard | Very Likely | arraytreegraph | Solve |
Binary Tree Cameras You are given the root of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate chil... | Hard | Very Likely | dynamic-programmingtreedepth-first-search | Solve |
Course Schedule
SolveThere are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b...
01 Matrix
SolveGiven an m x n binary matrix mat, return the distance of the nearest 0 for each cell.
Decode Ways
SolveYou have intercepted a secret message encoded as a string of numbers. The message is decoded via the following mapping:
Largest Number
SolveGiven a list of non-negative integers nums, arrange them such that they form the largest number and return it.
Keys and Rooms
SolveThere are n rooms labeled from 0 to n - 1 and all the rooms are locked except for room 0. Your goal is to visit all the rooms. However, you cannot enter a locke...
Collect Coins in a Tree
SolveThere exists an undirected and unrooted tree with n nodes indexed from 0 to n - 1. You are given an integer n and a 2D integer array edges of length n - 1, wher...
Binary Tree Cameras
SolveYou are given the root of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate chil...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Graviton interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Graviton interviews focus heavily on depth-first-search, breadth-first-search, graph problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Graviton interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Graviton has been reported to ask 7 distinct coding problems. The most common topics are depth-first-search, breadth-first-search, graph. 0 are Easy difficulty, 5 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 7 reported problems, Graviton interviews are significantly harder than average - 29% Hard vs 18% across all companies. 71% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: depth-first-search, breadth-first-search, graph. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Graviton coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Graviton interview with AIarrow_forward
