Revolut coding interview
questions, leaked.
11 problems reported across recent Revolut interviews. Top patterns: string, math, linked list. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Revolut's coding assessment is heavy on strings and math, with linked-list work sprinkled throughout. You're looking at 11 problems across easy and medium difficulty, which means they're testing pattern recognition and clean implementation under time pressure. Most candidates drill arrays and trees. Revolut wants strings, hashing, and list manipulation. If you hit a wall on the live assessment, StealthCoder runs invisibly during screen share and pulls a working solution in seconds, so you don't stall on a string or linked-list problem you haven't rehearsed.
Top problems at Revolut
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Longest Common Prefix | EASY | 100.0 | 45% | String · Trie |
| 02 | Perfect Squares | MEDIUM | 90.2 | 56% | Math · Dynamic Programming · Breadth-First Search |
| 03 | Reverse Linked List II | MEDIUM | 86.9 | 50% | Linked List |
| 04 | Binary Tree Paths | EASY | 83.0 | 67% | String · Backtracking · Tree |
| 05 | Find All Anagrams in a String | MEDIUM | 78.2 | 52% | Hash Table · String · Sliding Window |
| 06 | Remove Duplicates from Sorted List | EASY | 78.2 | 55% | Linked List |
| 07 | Permutation in String | MEDIUM | 63.2 | 47% | Hash Table · Two Pointers · String |
| 08 | Binary Tree Level Order Traversal II | MEDIUM | 63.2 | 66% | Tree · Breadth-First Search · Binary Tree |
| 09 | Random Pick with Weight | MEDIUM | 63.2 | 48% | Array · Math · Binary Search |
| 10 | Merge Two Sorted Lists | EASY | 63.2 | 67% | Linked List · Recursion |
| 11 | Missing Number | EASY | 63.2 | 70% | Array · Hash Table · Math |
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 Revolut OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- string4 · 36%
- math3 · 27%
- linked list3 · 27%
- hash table3 · 27%
- breadth first search2 · 18%
- tree2 · 18%
- binary tree2 · 18%
- sliding window2 · 18%
- array2 · 18%
- binary search2 · 18%
String problems dominate the list (4 core appearances), followed by math, linked lists, and hash tables at 3 each. The distribution is front-loaded on easier patterns: Longest Common Prefix, Remove Duplicates from Sorted List, Merge Two Sorted Lists, and Binary Tree Paths are all easy wins if you know the moves. The medium problems cluster around sliding windows and hash-table work (Find All Anagrams, Permutation in String) and tree traversal (Binary Tree Level Order Traversal II). Math shows up in Perfect Squares and Random Pick with Weight, which are medium-difficulty curveballs. Drill string manipulation first, then nail linked-list reversal and merging. Hash-table sliding-window combos (Anagrams, Permutation in String) are your second wave. If you blank on a math or BFS pattern live, StealthCoder is the hedge that surfaces a solution invisible to the proctor.
Companies with similar patterns
If you prepped for Revolut, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Revolut.
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. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Revolut interview FAQ
Should I focus on strings first for Revolut?+
Yes. Strings appear in 4 distinct problems here, more than any other topic. Start with Longest Common Prefix and the anagram/permutation problems. They test trie logic, sliding windows, and hash-table thinking all at once. Master those and you cover 40% of the expected surface area.
How much linked-list work do I need?+
Revolut includes 3 linked-list problems: Reverse Linked List II, Remove Duplicates, and Merge Two Sorted Lists. They're all medium or easy. You need fast pointer manipulation and recursion comfort. Spend 2 hours drilling these three to be confident.
What's the hardest problem I'll see?+
All 11 problems top out at medium difficulty. Nothing hard. That means the assessment tests execution speed and edge-case handling, not novel algorithms. You won't need dynamic programming or heavy backtracking. Focus on clean code and fast implementation.
Do I need to prepare for tree problems?+
Trees appear in 4 problems total (tree, binary-tree, BFS overlap), but they're mostly easy to medium. Binary Tree Paths is easy. Binary Tree Level Order Traversal II is the medium curveball. Learn level-order BFS and you're set. This is not a tree-heavy assessment.
How should I spend my last 12 hours before the assessment?+
Drill Permutation in String and Find All Anagrams back-to-back. They're the hardest patterns here and combine hash tables, sliding windows, and string logic. Then run through Reverse Linked List II and Random Pick with Weight once each. Skip easy problems unless you're shaky.