Roblox coding interview
questions, leaked.
53 problems reported across recent Roblox interviews. Top patterns: array, hash table, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Roblox's assessment is 60% medium difficulty, heavy on arrays, and light on graph theory. You're looking at 53 problems in reports, with array patterns dominating two-thirds of what gets asked. Hash tables and strings fill the gaps. The easy problems are few, so don't expect a warm-up. Most candidates stumble on the medium tier because it requires both pattern recognition and clean implementation under pressure. If you blank mid-assessment, StealthCoder runs invisibly and solves the problem in seconds. But first, you need to know what's actually coming.
Top problems at Roblox
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Reorganize String | MEDIUM | 100.0 | 56% | Hash Table · String · Greedy |
| 02 | Design Browser History | MEDIUM | 86.3 | 78% | Array · Linked List · Stack |
| 03 | Task Scheduler | MEDIUM | 85.4 | 62% | Array · Hash Table · Greedy |
| 04 | Maximize Distance to Closest Person | MEDIUM | 81.5 | 49% | Array |
| 05 | Design Hit Counter | MEDIUM | 81.5 | 69% | Array · Binary Search · Design |
| 06 | Merge Intervals | MEDIUM | 75.1 | 49% | Array · Sorting |
| 07 | Text Justification | HARD | 73.5 | 48% | Array · String · Simulation |
| 08 | Convert Binary Number in a Linked List to Integer | EASY | 69.9 | 81% | Linked List · Math |
| 09 | Students and Examinations | EASY | 69.9 | 60% | Database |
| 10 | Group the People Given the Group Size They Belong To | MEDIUM | 69.9 | 87% | Array · Hash Table · Greedy |
| 11 | Subdomain Visit Count | MEDIUM | 69.9 | 77% | Array · Hash Table · String |
| 12 | Count Number of Nice Subarrays | MEDIUM | 69.9 | 73% | Array · Hash Table · Math |
| 13 | Maximum Number of Occurrences of a Substring | MEDIUM | 69.9 | 53% | Hash Table · String · Sliding Window |
| 14 | Magnetic Force Between Two Balls | MEDIUM | 69.9 | 71% | Array · Binary Search · Sorting |
| 15 | Number of Trusted Contacts of a Customer | MEDIUM | 69.9 | 75% | Database |
| 16 | Valid Parentheses | EASY | 67.8 | 42% | String · Stack |
| 17 | Integer to English Words | HARD | 67.8 | 34% | Math · String · Recursion |
| 18 | Implement Trie (Prefix Tree) | MEDIUM | 62.9 | 68% | Hash Table · String · Design |
| 19 | Rotate Image | MEDIUM | 59.8 | 78% | Array · Math · Matrix |
| 20 | Rotating the Box | MEDIUM | 56.2 | 79% | Array · Two Pointers · Matrix |
| 21 | Number of Flowers in Full Bloom | HARD | 56.2 | 57% | Array · Hash Table · Binary Search |
| 22 | Trapping Rain Water | HARD | 51.9 | 65% | Array · Two Pointers · Dynamic Programming |
| 23 | Spiral Matrix | MEDIUM | 51.9 | 54% | Array · Matrix · Simulation |
| 24 | Split Message Based on Limit | HARD | 51.9 | 43% | String · Binary Search · Enumeration |
| 25 | Block Placement Queries | HARD | 51.9 | 17% | Array · Binary Search · Binary Indexed Tree |
| 26 | Number of Adjacent Elements With the Same Color | MEDIUM | 46.2 | 56% | Array |
| 27 | Find the Length of the Longest Common Prefix | MEDIUM | 46.2 | 56% | Array · Hash Table · String |
| 28 | Largest Rectangle in Histogram | HARD | 46.2 | 47% | Array · Stack · Monotonic Stack |
| 29 | Subarrays with K Different Integers | HARD | 46.2 | 66% | Array · Hash Table · Sliding Window |
| 30 | First Missing Positive | HARD | 46.2 | 41% | Array · Hash Table |
| 31 | Minimum Falling Path Sum II | HARD | 46.2 | 64% | Array · Dynamic Programming · Matrix |
| 32 | Longest Common Prefix | EASY | 46.2 | 45% | String · Trie |
| 33 | Longest Substring Without Repeating Characters | MEDIUM | 38.3 | 37% | Hash Table · String · Sliding Window |
| 34 | Spiral Matrix II | MEDIUM | 38.3 | 73% | Array · Matrix · Simulation |
| 35 | Brightest Position on Street | MEDIUM | 38.3 | 61% | Array · Sorting · Prefix Sum |
| 36 | Longest Consecutive Sequence | MEDIUM | 38.3 | 47% | Array · Hash Table · Union Find |
| 37 | Rotting Oranges | MEDIUM | 38.3 | 57% | Array · Breadth-First Search · Matrix |
| 38 | Employee Free Time | HARD | 38.3 | 73% | Array · Line Sweep · Sorting |
| 39 | Remove Colored Pieces if Both Neighbors are the Same Color | MEDIUM | 38.3 | 63% | Math · String · Greedy |
| 40 | Minimum Number of Frogs Croaking | MEDIUM | 38.3 | 51% | String · Counting |
| 41 | Best Time to Buy and Sell Stock | EASY | 38.3 | 55% | Array · Dynamic Programming |
| 42 | Unique Paths | MEDIUM | 38.3 | 66% | Math · Dynamic Programming · Combinatorics |
| 43 | Word Search II | HARD | 38.3 | 37% | Array · String · Backtracking |
| 44 | Minimum Absolute Difference Between Elements With Constraint | MEDIUM | 38.3 | 34% | Array · Binary Search · Ordered Set |
| 45 | Accounts Merge | MEDIUM | 38.3 | 60% | Array · Hash Table · String |
| 46 | Two Sum | EASY | 38.3 | 56% | Array · Hash Table |
| 47 | Candy Crush | MEDIUM | 38.3 | 77% | Array · Two Pointers · Matrix |
| 48 | Basic Calculator IV | HARD | 38.3 | 49% | Hash Table · Math · String |
| 49 | Number of Recent Calls | EASY | 38.3 | 77% | Design · Queue · Data Stream |
| 50 | Diagonal Traverse | MEDIUM | 38.3 | 63% | Array · Matrix · Simulation |
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 Roblox 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- array36 · 68%
- hash table16 · 30%
- string16 · 30%
- matrix10 · 19%
- sorting8 · 15%
- math7 · 13%
- binary search6 · 11%
- greedy5 · 9%
- counting5 · 9%
- dynamic programming5 · 9%
Arrays account for 68% of Roblox problems, which means your first week is array-heavy: sliding windows, two-pointer, interval merging, subarray logic. Hash tables and strings each show up in 30% of reports, often paired with arrays in design and counting problems like Reorganize String and Subdomain Visit Count. The medium tier (60 of 53) is where the real gatekeeping happens. Sorting, greedy, and heap patterns appear frequently in top problems but less often overall, so they're higher-signal prep targets. Simulation and matrix problems are lower frequency but show up as hard problems, which means they're the tiebreaker. If you hit a wall on a design problem like Task Scheduler or text parsing during your live assessment, StealthCoder surfaces a working solution while the proctor sees nothing. Spend your prep time on array manipulation and hash-table patterns first.
Companies with similar patterns
If you prepped for Roblox, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Roblox.
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.
Roblox interview FAQ
How many array problems should I solve before the Roblox assessment?+
Roblox asks array problems in nearly 7 of 10 cases. Solve at least 20 to 25 distinct array patterns: sliding windows, prefix sums, interval merging, two-pointer, subarray logic. The medium tier is where most array problems live, so focus there. You can't afford to skip arrays.
Is studying hash tables enough, or do I need strings too?+
Both appear equally in Roblox reports (around 30% each), and they often overlap. Problems like Reorganize String and Subdomain Visit Count blend hash tables, strings, and counting. Study them together, not separately. A week of hash-table-only prep will leave gaps.
Should I learn dynamic programming for Roblox?+
DP appears in only 9% of Roblox problems and doesn't dominate any top problem. It's a lower-priority topic. Master arrays, hash tables, and strings first. DP is the hedge, not the main event.
What's the hardest topic I'll face in the assessment?+
Simulation and matrix problems appear as hard-difficulty questions. They're infrequent but high-stakes when they land. Text Justification is a known hard problem here. Leave two to three days for these edge cases, not two weeks.
How much time should I spend on sorting and binary search?+
Sorting shows up in 15% of problems, binary search in 11%. They're secondary enablers, not primary topics. Master them as tools for array and interval problems, not as standalone focus areas. A few days of combined prep is enough.