Shopee coding interview
questions, leaked.
10 problems reported across recent Shopee interviews. Top patterns: array, hash table, linked list. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Shopee's assessment leans hard on arrays. Five of ten problems center on array manipulation, and half the test is easy difficulty, which means speed and accuracy matter more than algorithmic heroics. You'll see two-pointers, hash-tables, and linked-list work mixed in, but the backbone is array patterns: sorting, binary search, prefix sums, greedy logic. If you blank mid-assessment on a tricky array problem, StealthCoder runs invisibly and surfaces a working solution in seconds, invisible to the proctor. That's your safety net for whatever you didn't drill in time.
Top problems at Shopee
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Count Pairs in Two Arrays | MEDIUM | 100.0 | 60% | Array · Two Pointers · Binary Search |
| 02 | LRU Cache | MEDIUM | 88.4 | 45% | Hash Table · Linked List · Design |
| 03 | Jump Game | MEDIUM | 79.1 | 39% | Array · Dynamic Programming · Greedy |
| 04 | Valid Parentheses | EASY | 72.6 | 42% | String · Stack |
| 05 | Merge Two Sorted Lists | EASY | 72.6 | 67% | Linked List · Recursion |
| 06 | Best Time to Buy and Sell Stock | EASY | 63.4 | 55% | Array · Dynamic Programming |
| 07 | Random Pick with Weight | MEDIUM | 63.4 | 48% | Array · Math · Binary Search |
| 08 | Valid Palindrome | EASY | 63.4 | 51% | Two Pointers · String |
| 09 | Memoize | MEDIUM | 63.4 | 64% | |
| 10 | Two Sum | EASY | 63.4 | 56% | Array · Hash Table |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Shopee OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array5 · 50%
- hash table2 · 20%
- linked list2 · 20%
- string2 · 20%
- dynamic programming2 · 20%
- two pointers2 · 20%
- binary search2 · 20%
- design1 · 10%
- doubly linked list1 · 10%
- stack1 · 10%
The distribution is front-loaded: five easy problems means Shopee expects you to nail fundamentals fast, then spend remaining time on the five medium problems. Arrays dominate the topic list, but they're not isolated. Count Pairs uses arrays with two-pointers and binary search. Jump Game mixes arrays with dynamic programming and greedy. Valid Parentheses and Valid Palindrome are string work, but both are easy and test pattern matching, not creativity. LRU Cache is the design outlier and arguably the hardest conceptually. Prioritize array methods first: sorting, binary search, prefix sums, two-pointers. Hash-tables and linked-lists come second. If you hit an array problem you don't recognize mid-OA, StealthCoder's the hedge that solves it in real time while you stay calm and move forward.
Companies with similar patterns
If you prepped for Shopee, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Shopee.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Shopee interview FAQ
Should I focus on arrays first or spread my prep evenly across all topics?+
Focus arrays first. Half the test is array problems, and half of those are easy. Drilling Two Sum, Best Time to Buy and Sell Stock, and Merge Two Sorted Lists gets you quick wins. Once you're confident on arrays, spend time on hash-tables and linked-lists. That covers most of the remaining test.
Is five easy problems actually easier, or is Shopee just hiding the difficulty?+
They're genuinely easier, but speed kills you. Valid Parentheses and Two Sum are straightforward, but you have to solve them in minutes, not hours. Know your stack syntax, hash-table lookups, and two-pointers cold. Easy doesn't mean slow.
What should I study if I only have a few days left?+
Solve Count Pairs, Two Sum, Jump Game, and LRU Cache in that order. Count Pairs hits four topics at once. Two Sum is a gimme if you know hash-tables. Jump Game is medium but tests greedy logic you'll see elsewhere. LRU Cache is hard and worth understanding the design pattern.
How important is dynamic programming for this assessment?+
Moderate. Two problems explicitly tag DP: Jump Game and Best Time to Buy and Sell Stock. Both are medium or easy, so the DP required isn't heavy. Know basic subproblem definition and memoization. Memoize as a standalone problem also reinforces this.
Will I see linked-list problems and should I practice recursion separately?+
Yes and mostly no. Merge Two Sorted Lists and LRU Cache both touch linked-lists. Merge Two Sorted Lists explicitly uses recursion. Recursion is a tool here, not a standalone topic. Study it in context of the problems, not in isolation.