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 WinZO interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
4 problems · 0 Easy, 1 Medium, 3 Hard · Ranked #297 of 458
0 Easy
0% · avg 23%
1 Medium
25% · avg 59%
3 Hard
75% · avg 18%
Based on 4 reported problems, WinZO interviews are significantly harder than average - 75% Hard vs 18% across all companies.
Compared to the industry average, WinZO puts unusual emphasis on heap-priority-queue (50% of problems, 8.3x the industry average), greedy (50% of problems, 5.9x the industry average), sorting (50% of problems, 3.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (50%), greedy (50%), sorting (50%), heap-priority-queue (50%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Smallest Range Covering Elements from K Lists You have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists. | Hard | Very Likely | arrayhash-tablegreedy | Solve |
Regular Expression Matching Given an input string s and a pattern p, implement regular expression matching with support for '.' and '' where: | Hard | Very Likely | stringdynamic-programmingrecursion | Solve |
IPO Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increa... | Hard | Very Likely | arraygreedysorting | Solve |
Domino and Tromino Tiling You have two types of tiles: a 2 x 1 domino shape and a tromino shape. You may rotate these shapes. | Medium | Very Likely | dynamic-programming | Solve |
Smallest Range Covering Elements from K Lists
SolveYou have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists.
Regular Expression Matching
SolveGiven an input string s and a pattern p, implement regular expression matching with support for '.' and '' where:
IPO
SolveSuppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increa...
Domino and Tromino Tiling
SolveYou have two types of tiles: a 2 x 1 domino shape and a tromino shape. You may rotate these shapes.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent WinZO interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
WinZO interviews focus heavily on array, greedy, sorting 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. WinZO 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.
WinZO has been reported to ask 4 distinct coding problems. The most common topics are array, greedy, sorting. 0 are Easy difficulty, 1 are Medium, and 3 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 4 reported problems, WinZO interviews are significantly harder than average - 75% Hard vs 18% across all companies. 25% 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, greedy, sorting. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real WinZO coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a WinZO interview with AIarrow_forward