Remitly coding interview
questions, leaked.
8 problems reported across recent Remitly interviews. Top patterns: array, hash table, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Remitly's technical assessment leans on arrays and hash tables, with a cluster of medium-difficulty problems that reward clean implementation. You're looking at eight total problems, most of them solvable with data structures and pattern recognition rather than advanced algorithms. The pressure is medium-depth search and simulation tasks that can trip up candidates who haven't practiced state management. If you blank on hash-table logic or array manipulation mid-assessment, StealthCoder runs invisibly and surfaces working code in seconds, giving you the margin to move forward.
Top problems at Remitly
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Isomorphic Strings | EASY | 100.0 | 47% | Hash Table · String |
| 02 | Task Scheduler II | MEDIUM | 70.6 | 54% | Array · Hash Table · Simulation |
| 03 | Course Schedule II | MEDIUM | 62.5 | 53% | Depth-First Search · Breadth-First Search · Graph |
| 04 | Evaluate the Bracket Pairs of a String | MEDIUM | 62.5 | 68% | Array · Hash Table · String |
| 05 | Design Search Autocomplete System | HARD | 62.5 | 49% | String · Depth-First Search · Design |
| 06 | Task Scheduler | MEDIUM | 62.5 | 62% | Array · Hash Table · Greedy |
| 07 | Best Time to Buy and Sell Stock | EASY | 62.5 | 55% | Array · Dynamic Programming |
| 08 | Random Pick with Weight | MEDIUM | 62.5 | 48% | Array · Math · Binary Search |
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 Remitly 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- array5 · 63%
- hash table4 · 50%
- string3 · 38%
- depth first search2 · 25%
- sorting2 · 25%
- heap priority queue2 · 25%
- breadth first search1 · 13%
- graph1 · 13%
- topological sort1 · 13%
- simulation1 · 13%
Arrays show up in five problems, hash tables in four. That's your foundation. Most of the assessment sits at medium difficulty, which means the difficulty curve is mild enough that you won't face a sudden cliff, but execution matters. The medium-tier problems cluster around task scheduling, string evaluation, and state tracking via simulation. Depth-first search appears twice and breadth-first search once, so be ready for graph traversal but don't expect it to dominate. The hard problem, Design Search Autocomplete System, combines trie and priority queue logic at a professional level. Your drill priority: array manipulation and hash-table patterns first, then simulation problems that force you to track state over multiple steps. If you hit a wall on a heap or topological-sort problem live, StealthCoder is the safety net that keeps you moving without the proctor seeing a pause.
Companies with similar patterns
If you prepped for Remitly, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Remitly.
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.
Remitly interview FAQ
How many array problems should I solve before the Remitly assessment?+
Array patterns appear in five of eight problems. Drill at least three core array patterns: linear scan, two-pointer, and prefix/suffix logic. Since most are medium difficulty, focus on clean implementations rather than exotic edge cases.
Is hash-table knowledge enough to pass this assessment?+
Hash tables appear in four problems, but they're paired with arrays and strings most of the time. You need both. Solve at least two hash-table problems that require collision handling or constraint validation before the OA.
What should I study first if I only have a few days?+
Start with array and hash-table combos, then move to simulation problems like Task Scheduler. Those account for the bulk of the assessment. Graph problems (DFS, topological sort) are lower frequency, so they're your secondary focus.
Is the Design Search Autocomplete problem a blocker?+
It's the only hard problem. It combines trie, heap, and sorting. If you're not confident in trie construction, don't spend all your prep time on it. Nail the five medium problems first and come back to this one if time allows.
Do I need to know topological sort for Remitly?+
It appears once, in Course Schedule II. You should understand DFS-based topological sort and Kahn's algorithm, but one problem doesn't make it critical. Know the basics and move on if you're short on time.