DevRev coding interview
questions, leaked.
4 problems reported across recent DevRev interviews. Top patterns: array, dynamic programming, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
DevRev's coding interview pulls from a tight pool of four problems, and array manipulation is the entire game. You're looking at two easy problems, one medium, and one hard, all centered on array fundamentals. The easy questions test whether you can handle stock trading logic and zero-shifting in linear time. The medium and hard problems add complexity through hash tables, counting, and string simulation. If you're solid on array traversal and dynamic programming, you'll recognize the patterns immediately. If you hit a wall mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds.
Top problems at DevRev
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Best Time to Buy and Sell Stock | EASY | 100.0 | 55% | Array · Dynamic Programming |
| 02 | Check If Array Pairs Are Divisible by k | MEDIUM | 100.0 | 46% | Array · Hash Table · Counting |
| 03 | Text Justification | HARD | 89.1 | 48% | Array · String · Simulation |
| 04 | Move Zeroes | EASY | 89.1 | 63% | Array · Two Pointers |
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 DevRev OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array4 · 100%
- dynamic programming1 · 25%
- hash table1 · 25%
- counting1 · 25%
- string1 · 25%
- simulation1 · 25%
- two pointers1 · 25%
Every problem DevRev asks involves arrays, which means the interview is fundamentally testing your ability to manipulate sequences efficiently. The distribution is heavy on easy to medium difficulty, suggesting the screening focuses on clean implementation and problem-solving clarity rather than algorithmic wizardry. Best Time to Buy and Sell Stock appears straightforward on the surface but demands you think in terms of state (min price seen so far); that's where candidates slip. Move Zeroes is a pointer-manipulation warm-up. The medium problem layers hash tables and counting on top of arrays, and the hard problem forces you to think about array indexing while building justified text output. You should drill the easy problems until you code them without thinking, then spend time understanding why hash-table counting works for divisibility. When you sit down for the actual assessment, StealthCoder is your safety net if the hard problem's string-simulation logic doesn't click immediately.
Companies with similar patterns
If you prepped for DevRev, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass DevRev.
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 a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
DevRev interview FAQ
What should I study first for DevRev's interview?+
Start with array traversal and two-pointer patterns. Both easy problems test this directly. Once you're confident moving through arrays and tracking state (like minimum price), move to hash-table counting, which appears in the medium problem. This sequence matches the difficulty distribution DevRev actually uses.
How much dynamic programming do I need to know?+
One problem uses it, so it's not heavy. Focus on the Best Time to Buy and Sell Stock pattern: track the minimum value as you iterate forward, then compute max profit. That's the DP flavor DevRev tests. You don't need to memorize memoization or complex recurrence relations.
Is the hard problem actually likely to appear?+
It's one of four in the pool, so yes, it could show up. Text Justification tests your ability to manage array indexing while building formatted output. Practice handling edge cases like single-word lines and exact spacing. It's harder than the others, but it's still array-based, so the fundamentals carry over.
Do I need to know advanced string algorithms?+
No. String appears only in the hard problem, and it's paired with array simulation. You're not dealing with pattern matching or substring search. Focus on character iteration, concatenation, and spacing logic within the context of array-building.
How many practice problems should I solve before the assessment?+
You've got four problems to target. Solve each one at least three times without looking at your solution, then review. That repetition builds muscle memory for the patterns. Since the pool is this small, thorough drilling beats breadth. If you blank on any during the live assessment, you have a real-time backup.