Monzo Coding Interview Questions
25 Monzo coding interview problems with full optimal solutions — 14 easy, 8 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Monzo interviewer values, and a FAQ section.
Showing 1 problem of 25
- #24hardsometimes
24. Median of Two Sorted Arrays
Two already-sorted arrays, one combined median, and a hard O(log) requirement that forbids merging them — this is the partition binary search at its purest. Monzo candidates report it appearing in senior backend loops, where the banking flavor is genuine: ledger snapshots arrive pre-sorted from storage, and percentile questions over two of them ('median transaction amount across both accounts') reward exactly this no-merge thinking. The interview is won or lost on whether you can DEFEND the partition condition, not type it.