Problem database last updated: June 20, 2025
11 problems · 5 Easy, 6 Medium, 0 Hard · Ranked #138 of 458
5 Easy
45% · avg 23%
6 Medium
55% · avg 59%
0 Hard
0% · avg 18%
Based on 11 reported problems, Revolut interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (55%) 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, Revolut puts unusual emphasis on sliding-window (18.2% of problems, 3.9x the industry average), linked-list (27.3% of problems, 3.8x the industry average), binary-tree (18.2% of problems, 3.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are string (36.4%), array (27.3%), math (27.3%), linked-list (27.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. | Easy | Very Likely | arraystringtrie | Solve |
Perfect Squares Given an integer n, return the least number of perfect square numbers that sum to n. | Medium | Very Likely | mathdynamic-programmingbreadth-first-search | Solve |
Reverse Linked List II Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right,... | Medium | Very Likely | linked-list | Solve |
Binary Tree Paths Given the root of a binary tree, return all root-to-leaf paths in any order. | Easy | Very Likely | stringbacktrackingtree | Solve |
Find All Anagrams in a String Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. | Medium | Very Likely | hash-tablestringsliding-window | Solve |
Remove Duplicates from Sorted List Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well. | Easy | Very Likely | linked-list | Solve |
Binary Tree Level Order Traversal II Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root). | Medium | Likely | treebreadth-first-searchbinary-tree | Solve |
Merge Two Sorted Lists You are given the heads of two sorted linked lists list1 and list2. | Easy | Likely | linked-listrecursion | Solve |
Permutation in String Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. | Medium | Likely | hash-tabletwo-pointersstring | Solve |
Random Pick with Weight You are given a 0-indexed array of positive integers w where w[i] describes the weight of the ith index. | Medium | Likely | arraymathbinary-search | Solve |
Missing Number Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array. | Easy | Likely | arrayhash-tablemath | Solve |
Longest Common Prefix
SolveWrite a function to find the longest common prefix string amongst an array of strings.
Perfect Squares
SolveGiven an integer n, return the least number of perfect square numbers that sum to n.
Reverse Linked List II
SolveGiven the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right,...
Binary Tree Paths
SolveGiven the root of a binary tree, return all root-to-leaf paths in any order.
Find All Anagrams in a String
SolveGiven two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order.
Remove Duplicates from Sorted List
SolveGiven the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.
Binary Tree Level Order Traversal II
SolveGiven the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).
Merge Two Sorted Lists
SolveYou are given the heads of two sorted linked lists list1 and list2.
Permutation in String
SolveGiven two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
Random Pick with Weight
SolveYou are given a 0-indexed array of positive integers w where w[i] describes the weight of the ith index.
Missing Number
SolveGiven an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Revolut interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Revolut interviews focus heavily on string, array, math 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. Revolut 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.
Revolut has been reported to ask 11 distinct coding problems. The most common topics are string, array, math. 5 are Easy difficulty, 6 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 11 reported problems, Revolut interviews are easier than average - only 0% Hard compared to 18% across all companies. 55% 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: string, array, math. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Revolut coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Revolut interview with AIarrow_forward
