Compass coding interview
questions, leaked.
6 problems reported across recent Compass interviews. Top patterns: string, array, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Compass gets a small candidate pool, which means they can afford to be thorough. Six problems reported total, all easy or medium. Strings dominate the signal here: four of the six problems lean on string patterns, manipulation, or matching. If you're prepping the live assessment, string and array work is the primary drill. Hash tables show up twice, stacks and recursion appear once each. The gap is real: if you hit an unfamiliar string-matching or decode problem mid-OA, StealthCoder runs invisibly and surfaces a working solution in seconds while the proctor sees only your screen.
Top problems at Compass
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Total Distance Traveled | EASY | 100.0 | 40% | Math · Simulation |
| 02 | Decode String | MEDIUM | 89.4 | 61% | String · Stack · Recursion |
| 03 | Group Anagrams | MEDIUM | 89.4 | 71% | Array · Hash Table · String |
| 04 | Camelcase Matching | MEDIUM | 89.4 | 64% | Array · Two Pointers · String |
| 05 | Subtree of Another Tree | EASY | 89.4 | 50% | Tree · Depth-First Search · String Matching |
| 06 | Time Based Key-Value Store | MEDIUM | 89.4 | 49% | Hash Table · String · Binary Search |
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 Compass 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- string4 · 67%
- array2 · 33%
- hash table2 · 33%
- string matching2 · 33%
- stack1 · 17%
- recursion1 · 17%
- math1 · 17%
- simulation1 · 17%
- sorting1 · 17%
- two pointers1 · 17%
String problems at Compass aren't about memorizing variants. They're about pattern recognition: anagram grouping, camelcase matching, substring decoding. Four string-tagged problems means you'll almost certainly see one. Array and hash-table work follows behind, each appearing twice. The two easy problems (Total Distance Traveled and Subtree of Another Tree) establish the floor: basic simulation and tree traversal with a string-matching twist. The medium tier scales up to problems like Decode String and Camelcase Matching, which require you to hold state through recursion or iteration. Stack knowledge matters for Decode String; trie or two-pointer logic matters for Camelcase. If you drill strings first, hash tables second, and trees third, you're covering the signal. When you hit the live OA, StealthCoder is your hedge for whatever pattern didn't stick in practice.
Companies with similar patterns
If you prepped for Compass, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Compass.
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.
Compass interview FAQ
How many string problems should I expect from Compass?+
Four of six reported problems involve strings in some form: Group Anagrams, Decode String, Camelcase Matching, and Subtree of Another Tree. String manipulation and pattern matching dominate the interview signal. Spend more prep time on strings than any other topic.
Do I need to know tries and two-pointers for Compass?+
Camelcase Matching touches both. Tries optimize string-prefix queries; two-pointers help with efficient traversal. You don't need mastery, but understanding the tools helps. If you're pressed for time, focus on string and hash-table fundamentals first.
Is recursion a major focus?+
Recursion appears once, in Decode String. It's one of six problems, so not the primary focus. That said, Decode String is medium difficulty and requires solid recursion or stack logic. Practice it, but don't overweight it against string and array drills.
What's the difficulty spread at Compass?+
Two easy, four medium, zero hard. The bar is approachable: most candidates can solve an easy problem. The medium tier is where the filter happens. You're not facing hard algorithmic puzzles. Solid fundamentals cover the range.
Should I drill trees first or strings first?+
Strings first. Four problems touch strings; only one touches trees. Subtree of Another Tree is easy, so it's lower risk. Spend your prep week on string patterns, then move to hash tables and trees if time allows.