EarnIn coding interview
questions, leaked.
4 problems reported across recent EarnIn interviews. Top patterns: array, linked list, math. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
EarnIn's interview loop is tight, but the problem set is smaller and manageable. You're looking at four core questions spanning arrays, linked lists, strings, and graph traversal. The bar is medium overall: one easy problem to build momentum, three mediums that test whether you can apply classic patterns under pressure. Arrays appear twice, signaling that's where they'll probe first. If you blank on "Add Two Numbers" or "Number of Islands" mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds, keeping you moving. The real edge is knowing which pattern fits before the timer ticks.
Top problems at EarnIn
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Add Two Numbers | MEDIUM | 100.0 | 46% | Linked List · Math · Recursion |
| 02 | Longest Palindromic Substring | MEDIUM | 100.0 | 36% | Two Pointers · String · Dynamic Programming |
| 03 | Number of Islands | MEDIUM | 100.0 | 62% | Array · Depth-First Search · Breadth-First Search |
| 04 | Two Sum | EASY | 100.0 | 56% | Array · Hash Table |
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 EarnIn OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code.
Get StealthCoder- array2 · 50%
- linked list1 · 25%
- math1 · 25%
- recursion1 · 25%
- two pointers1 · 25%
- string1 · 25%
- dynamic programming1 · 25%
- depth first search1 · 25%
- breadth first search1 · 25%
- union find1 · 25%
The distribution here is forgiving. One easy warm-up means you'll likely start confident. The three mediums cluster around two core patterns: linked-list arithmetic and graph/array traversal. Array problems show up twice, so your first week should be array and hash-table fundamentals, then move to linked-list manipulation and DFS/BFS on grids. "Number of Islands" is the heaviest lift technically, demanding both graph traversal and matrix indexing. "Longest Palindromic Substring" tests dynamic programming chaining and two-pointer optimization, but it's a distant second priority given the problem counts. If you hit a wall on any medium during the live assessment, StealthCoder hedges your preparation gaps by solving it in real time while staying invisible to the proctor.
Companies with similar patterns
If you prepped for EarnIn, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass EarnIn.
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 realized the OA tests how well you memorized 200 problems, not how well you code. Works on HackerRank, CodeSignal, CoderPad, and Karat.
EarnIn interview FAQ
Should I spend more time on arrays or linked lists for EarnIn?+
Arrays. They appear twice in the reported problem set, versus linked lists once. Master two-pointer techniques and hash-table lookups first, then move to linked-list reversal and arithmetic. Arrays are your entry point and your safety zone.
Is one easy problem enough to warm up during the assessment?+
Probably not. One easy gives you momentum, but the three mediums follow quickly. Spend your prep week on the easy (Two Sum), then tackle mediums in order of frequency. You won't have time to re-learn patterns during the OA.
Do I need to master DFS, BFS, and union-find before the interview?+
For EarnIn, DFS and BFS matter more. Number of Islands tests both, so drill grid traversal hard. Union-find shows up once in that same problem but isn't a separate question. BFS and DFS are your primary focus.
How much dynamic programming do I need to know?+
Just enough for Longest Palindromic Substring. That's the only DP problem in the set. Learn expand-around-center and basic DP chaining, but don't waste time on complex DP patterns. Two-pointer and string fundamentals matter more.
What's the order I should drill these problems?+
Two Sum first (easy, hash-table foundation). Then Add Two Numbers (linked-list, recursion). Then Number of Islands (graph traversal, most complex). Longest Palindromic Substring last (DP refinement). This order builds skills sequentially.