Avito coding interview
questions, leaked.
9 problems reported across recent Avito interviews. Top patterns: array, sorting, math. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Avito's assessment hits you with 9 problems split between easy and medium, no hard questions to waste your energy on. The pattern is clear: arrays dominate six of those nine, and sorting plus math problems fill the remaining slots. If you haven't touched a heap or quickselect approach to finding the kth largest element, or you're fuzzy on monotonic stacks, you'll feel it mid-assessment. That's where StealthCoder comes in. It runs invisibly during the live OA, reads the problem, and surfaces a working solution in seconds. You drill the patterns below; StealthCoder is the safety net if you blank on execution.
Top problems at Avito
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Top K Frequent Elements | MEDIUM | 100.0 | 65% | Array · Hash Table · Divide and Conquer |
| 02 | Add Two Numbers | MEDIUM | 82.8 | 46% | Linked List · Math · Recursion |
| 03 | Add Strings | EASY | 75.0 | 52% | Math · String · Simulation |
| 04 | Merge Sorted Array | EASY | 61.6 | 53% | Array · Two Pointers · Sorting |
| 05 | Generate Parentheses | MEDIUM | 61.6 | 77% | String · Dynamic Programming · Backtracking |
| 06 | Sum of Subarray Minimums | MEDIUM | 53.8 | 38% | Array · Dynamic Programming · Stack |
| 07 | Add to Array-Form of Integer | EASY | 53.8 | 45% | Array · Math |
| 08 | Two Sum | EASY | 53.8 | 56% | Array · Hash Table |
| 09 | Kth Largest Element in an Array | MEDIUM | 53.8 | 68% | Array · Divide and Conquer · Sorting |
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 Avito OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- array6 · 67%
- sorting3 · 33%
- math3 · 33%
- dynamic programming2 · 22%
- hash table2 · 22%
- divide and conquer2 · 22%
- heap priority queue2 · 22%
- quickselect2 · 22%
- string2 · 22%
- two pointers1 · 11%
Arrays and sorting are your foundation here. Top K Frequent Elements and Kth Largest Element in an Array are the crown jewels, both testing whether you can move beyond brute force into heap or quickselect logic. Math and string problems like Add Two Numbers and Generate Parentheses sit just below, requiring you to think beyond simple iteration. The distribution tells you Avito cares less about graph or tree traversal and more about whether you can optimize space and time on linear structures. Dynamic programming shows up twice, but both appear paired with array or stack mechanics, not as standalone DP problems. Start with the two-pointer and hash-table foundations (Two Sum, Merge Sorted Array), then push into heap-based selection problems. If you hit a wall on sum-of-subarray-minimums or monotonic-stack logic during the OA, StealthCoder solves it in real time while the proctor sees nothing.
Companies with similar patterns
If you prepped for Avito, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Avito.
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 for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Avito interview FAQ
Should I spend more time on arrays or sorting for Avito?+
Arrays. Six of the nine problems use them. Sorting appears in three, but it's almost always paired with array operations. Master array manipulation with two pointers and hash tables first. Sorting techniques like quickselect and heap operations come next, and they're tested primarily through array problems like Top K Frequent Elements.
Do I need to be strong in dynamic programming for this assessment?+
Not heavily. DP appears in only two problems here, and both are intermediate difficulty. Generate Parentheses uses backtracking more than pure DP. Sum of Subarray Minimums combines DP with monotonic stacks. Focus on arrays, sorting, and basic math first. DP is a tiebreaker, not the foundation.
How many heap or quickselect problems should I drill before the OA?+
Both Top K Frequent Elements and Kth Largest Element in an Array test these patterns, so you're looking at two medium-difficulty problems that demand heap or quickselect fluency. Practice both approaches on each problem. If you're tight on time, prioritize heap-based solutions. They're more intuitive for most people and appear in more real-world scenarios.
Is hash table knowledge essential, or can I skip it?+
Don't skip it. Hash tables appear in Top K Frequent Elements and Two Sum, both on the assessment. Two Sum is easy, but it's the warmup for the hash-table concept. Top K uses hash tables to count frequencies before you optimize with a heap. Master hash-table indexing early.
What should I tackle first on test day?+
Hit the easy problems immediately: Add Strings, Add to Array-Form of Integer, Merge Sorted Array, Two Sum. These build confidence and establish array and math muscle memory in the first 15 minutes. Then move to medium problems with a clear head. Save monotonic-stack or complex DP problems for when you've warmed up.