11 curated coding interview questions directly asked in Ozon technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 100.0% | 6m |
| 896 | Monotonic Array | Easy | Arrays | Sorting / Prefix / Scan | 62.3% | 100.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 87.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 87.5% | all |
| 977 | Squares of a Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 73.8% | 87.5% | all |
| 185 | Department Top Three Salaries | Hard | Core DSA | Implementation / Reasoning | 60.5% | 87.5% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 87.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 75.0% | all |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 75.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 75.0% | all |