9 curated coding interview questions directly asked in Avito technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 100.0% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 87.5% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 87.5% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 87.5% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 75.0% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 75.0% | all |
| 907 | Sum of Subarray Minimums | Medium | Arrays | Sorting / Prefix / Scan | 38.6% | 75.0% | all |
| 104 | Maximum Depth of Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 78.2% | 62.5% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 62.5% | all |