How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Ozon interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
14 problems · 9 Easy, 4 Medium, 1 Hard · Ranked #116 of 458
9 Easy
64% · avg 23%
4 Medium
29% · avg 59%
1 Hard
7% · avg 18%
Based on 14 reported problems, Ozon interviews are easier than average - only 7% Hard compared to 18% across all companies.
Compared to the industry average, Ozon puts unusual emphasis on database (14.3% of problems, 12.7x the industry average), recursion (14.3% of problems, 3.2x the industry average), stack (14.3% of problems, 1.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (42.9%), string (28.6%), stack (14.3%), two-pointers (14.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Very Likely | stringstack | Solve |
Squares of a Sorted Array Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order. | Easy | Very Likely | arraytwo-pointerssorting | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Very Likely | arraysorting | Solve |
Department Top Three Salaries Table: Employee | Hard | Very Likely | database | Solve |
Monotonic Array An array is monotonic if it is either monotone increasing or monotone decreasing. | Easy | Very Likely | array | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
First Unique Character in a String Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1. | Easy | Likely | hash-tablestringqueue | Solve |
Invert Binary Tree Given the root of a binary tree, invert the tree, and return its root. | Easy | Likely | treedepth-first-searchbreadth-first-search | Solve |
Department Highest Salary Table: Employee | Medium | Likely | database | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Likely | hash-tablestringsliding-window | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Likely | arraydynamic-programming | Solve |
Reverse Linked List Given the head of a singly linked list, reverse the list, and return the reversed list. | Easy | Likely | linked-listrecursion | Solve |
Decode String Given an encoded string, return its decoded string. | Medium | Likely | stringstackrecursion | Solve |
Move Zeroes Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. | Easy | Likely | arraytwo-pointers | Solve |
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Squares of a Sorted Array
SolveGiven an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Monotonic Array
SolveAn array is monotonic if it is either monotone increasing or monotone decreasing.
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
First Unique Character in a String
SolveGiven a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1.
Invert Binary Tree
SolveGiven the root of a binary tree, invert the tree, and return its root.
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Reverse Linked List
SolveGiven the head of a singly linked list, reverse the list, and return the reversed list.
Decode String
SolveGiven an encoded string, return its decoded string.
Move Zeroes
SolveGiven an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Ozon interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Ozon interviews focus heavily on array, string, stack problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Ozon interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Ozon has been reported to ask 14 distinct coding problems. The most common topics are array, string, stack. 9 are Easy difficulty, 4 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 14 reported problems, Ozon interviews are easier than average - only 7% Hard compared to 18% across all companies. 29% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, stack. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Ozon coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Ozon interview with AIarrow_forward