Revolut Coding Interview Questions
25 Revolut coding interview problems with full optimal solutions — 10 easy, 11 medium, 4 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Revolut interviewer values, and a FAQ section.
Showing 4 problems of 25
- #22hardfoundational
22. Median of Two Sorted Arrays
Find the median of two sorted arrays in O(log(min(m,n))), a Revolut hard-screen that mirrors finding the median quote across two sorted FX-rate feeds in microseconds.
- #23hardfoundational
23. Merge k Sorted Lists
Merge k sorted linked lists via a min-heap, a Revolut hard-screen that mirrors fan-in merging of k pre-sorted FX-rate streams into a single ordered tape.
- #24hardfoundational
24. Trapping Rain Water
Compute the total water trapped between bars of varying height, a Revolut hard-screen that mirrors computing total locked-up reserves between peaks in a time-series of balance snapshots.
- #25hardfoundational
25. Sliding Window Maximum
Return the max of every length-k window via a monotonic deque, a Revolut hard-screen that mirrors computing rolling peak FX volatility over a sliding minute window.