Problem database last updated: June 20, 2025
5 problems · 3 Easy, 2 Medium, 0 Hard · Ranked #254 of 458
3 Easy
60% · avg 23%
2 Medium
40% · avg 59%
0 Hard
0% · avg 18%
Based on 5 reported problems, Mercari interviews are easier than average - only 0% Hard compared to 18% across all companies.
Compared to the industry average, Mercari puts unusual emphasis on greedy (60% of problems, 7.1x the industry average), math (60% of problems, 4.8x the industry average), hash-table (40% of problems, 1.8x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (60%), math (60%), greedy (60%), hash-table (40%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Smallest Missing Non-negative Integer After Operations You are given a 0-indexed integer array nums and an integer value. | Medium | Very Likely | arrayhash-tablemath | Solve |
Crawler Log Folder The Leetcode file system keeps a log each time some user performs a change folder operation. | Easy | Very Likely | arraystringstack | Solve |
Count Largest Group You are given an integer n. | Easy | Very Likely | hash-tablemathcounting | Solve |
Minimum Subsequence in Non-Increasing Order Given the array nums, obtain a subsequence of the array whose sum of elements is strictly greater than the sum of the non included elements in such subsequence. | Easy | Very Likely | arraygreedysorting | Solve |
Max Difference You Can Get From Changing an Integer You are given an integer num. You will apply the following steps to num two separate times: | Medium | Very Likely | mathgreedy | Solve |
Smallest Missing Non-negative Integer After Operations
SolveYou are given a 0-indexed integer array nums and an integer value.
Crawler Log Folder
SolveThe Leetcode file system keeps a log each time some user performs a change folder operation.
Minimum Subsequence in Non-Increasing Order
SolveGiven the array nums, obtain a subsequence of the array whose sum of elements is strictly greater than the sum of the non included elements in such subsequence.
Max Difference You Can Get From Changing an Integer
SolveYou are given an integer num. You will apply the following steps to num two separate times:
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Mercari interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Mercari interviews focus heavily on array, math, greedy 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. Mercari 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.
Mercari has been reported to ask 5 distinct coding problems. The most common topics are array, math, greedy. 3 are Easy difficulty, 2 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 5 reported problems, Mercari interviews are easier than average - only 0% Hard compared to 18% across all companies. 40% 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, math, greedy. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Mercari coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Mercari interview with AIarrow_forward
