Ozon LeetCode Interview Questions
Practice 47 real coding problems frequently asked in Ozon technical interviews. Master these questions to ace your next Ozon software engineering interview.
Top Topics at Ozon
Ace your Ozon interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Ozon Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Move Zeroes 100% | EasyE | Solve→ |
Task Scheduler 90% | MediumM | Solve→ |
Insert Delete GetRandom O(1) 87% | MediumM | Solve→ |
Valid Parentheses 83% | EasyE | Solve→ |
Rotate Image 82% | MediumM | Solve→ |
First Unique Character in a String 79% | EasyE | Solve→ |
Minimum Time to Visit a Cell In a Grid 76% | HardH | Solve→ |
Median of Two Sorted Arrays 76% | HardH | Solve→ |
Search a 2D Matrix 71% | MediumM | Solve→ |
Remove Element 70% | EasyE | Solve→ |
Two Best Non-Overlapping Events 70% | MediumM | Solve→ |
Minimum Area Rectangle 68% | MediumM | Solve→ |
Maximum Subarray 68% | MediumM | Solve→ |
Valid Number 65% | HardH | Solve→ |
Find the Celebrity 62% | MediumM | Solve→ |
Ways to Make a Fair Array 62% | MediumM | Solve→ |
Trapping Rain Water 61% | HardH | Solve→ |
Copy List with Random Pointer 59% | MediumM | Solve→ |
Integer to English Words 58% | HardH | Solve→ |
Container With Most Water 58% | MediumM | Solve→ |
Toeplitz Matrix 55% | EasyE | Solve→ |
Check if One String Swap Can Make Strings Equal 53% | EasyE | Solve→ |
LRU Cache 52% | MediumM | Solve→ |
Merge k Sorted Lists 52% | HardH | Solve→ |
Split Array Largest Sum 50% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Simplify Path 49% | MediumM | Solve→ |
Add Two Numbers 49% | MediumM | Solve→ |
Diameter of Binary Tree 47% | EasyE | Solve→ |
Vertical Order Traversal of a Binary Tree 46% | HardH | Solve→ |
The Earliest Moment When Everyone Become Friends 42% | MediumM | Solve→ |
Palindromic Substrings 41% | MediumM | Solve→ |
Implement Queue using Stacks 40% | EasyE | Solve→ |
Letter Combinations of a Phone Number 40% | MediumM | Solve→ |
Alien Dictionary 40% | HardH | Solve→ |
Asteroid Collision 39% | MediumM | Solve→ |
Longest Increasing Subsequence 39% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 37% | MediumM | Solve→ |
Move Pieces to Obtain a String 36% | MediumM | Solve→ |
Random Pick Index 36% | MediumM | Solve→ |
Maximum Number of Occurrences of a Substring 35% | MediumM | Solve→ |
Valid Palindrome 35% | EasyE | Solve→ |
Subsets II 30% | MediumM | Solve→ |
Minimum Difference in Sums After Removal of Elements 27% | HardH | Solve→ |
Find K Closest Elements 27% | MediumM | Solve→ |
Add Strings 27% | EasyE | Solve→ |
Squares of a Sorted Array 21% | EasyE | Solve→ |
Nested List Weight Sum 20% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Ozon ask in interviews?
Ozon commonly asks 47 coding problems in technical interviews, including Move Zeroes, Task Scheduler, Insert Delete GetRandom O(1). The difficulty breakdown is 11 Easy, 26 Medium, and 10 Hard problems.
How should I prepare for a Ozon coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Ozon interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Ozon coding interviews?
Based on our data, Ozon interviews include 11 Easy (23%), 26 Medium (55%), and 10 Hard (21%) problems.
Ready to ace your Ozon interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required