Rokt coding interview
questions, leaked.
4 problems reported across recent Rokt interviews. Top patterns: string, math, stack. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Rokt's interview dataset is small but punishing. Four problems across two easy, one medium, and one hard means every topic matters and you can't skip anything. The hard problem, Basic Calculator, combines math, string parsing, stack logic, and recursion in a single shot. That's the one that kills candidates who've only practiced hash tables and sorting. If you blank on expression parsing mid-interview, StealthCoder surfaces a working solution invisibly while you stay on screen share. Two easy problems ground you in string manipulation and anagram detection, but the medium and hard are where the signal actually happens.
Top problems at Rokt
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Basic Calculator | HARD | 100.0 | 46% | Math · String · Stack |
| 02 | Valid Word Abbreviation | EASY | 100.0 | 37% | Two Pointers · String |
| 03 | Basic Calculator II | MEDIUM | 100.0 | 46% | Math · String · Stack |
| 04 | Valid Anagram | EASY | 89.8 | 67% | Hash Table · String · Sorting |
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 Rokt 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 · 100%
- math2 · 50%
- stack2 · 50%
- recursion1 · 25%
- hash table1 · 25%
- sorting1 · 25%
- two pointers1 · 25%
String shows up in every single problem here, so it's not optional. Math and stack each appear twice, usually together in the calculator problems, which means you need to understand how to parse and evaluate expressions using a stack-based approach. Two pointers, hash table, sorting, and recursion each appear once but shouldn't be overlooked since the dataset is so tiny that every pattern is weighted heavily. Start with the two easy problems to warm up, then move immediately to Basic Calculator II to build stack and string confidence. Save the full HARD problem, Basic Calculator, for last since it piles on recursion and complexity. If you hit a wall on expression evaluation during the live assessment, StealthCoder is your invisible backup to get a working implementation into the editor fast.
Companies with similar patterns
If you prepped for Rokt, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Rokt.
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.
Rokt interview FAQ
Should I spend more time on math or string for Rokt?+
Both equally. String appears in all four problems. Math and stack appear together in three of the four, mostly in the calculator problems. Do the two easy string problems first to build foundation, then spend the bulk of your time understanding how to parse and evaluate math expressions using a stack.
Is the hard problem really harder or just longer?+
Basic Calculator is genuinely harder. It combines four topics: math, string parsing, stack, and recursion. Most candidates can handle the individual patterns but struggle to fit them together under pressure. Practice it repeatedly and understand the recursion angle, not just the iterative stack solution.
How many string problems should I drill before the interview?+
All four of Rokt's problems involve strings, so there's no escape. Two easy problems and two harder ones means you're seeing strings at every difficulty level. Drill the easy ones until they're automatic, then focus on string parsing within the calculator problems where the real complexity lives.
Do I need to be strong at recursion for Rokt?+
The hard problem uses it, but it's not the main focus across the dataset. Stack and math are more critical overall. That said, understand how recursion can solve the calculator problem as an alternative to the iterative stack approach, because interviewers will ask.
What if I only have time to prep one hard problem?+
Make it Basic Calculator. It's the only hard in the dataset and it combines the most topics. The two easy problems are straightforward and serve as a warm-up. The medium calculator problem is a stepping stone. The hard one is where you'll be evaluated.