Coupang coding interview
questions, leaked.
49 problems reported across recent Coupang interviews. Top patterns: array, string, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Coupang's assessment hits you with 49 problems split heavily toward medium difficulty: 33 out of 49. You're looking at arrays and strings dominating the mix, 23 and 19 problems respectively. Hash tables, BFS, and dynamic programming form the next tier. The problem set is front-loaded with design questions like LRU Cache and LFU Cache alongside classic medium-difficulty patterns. If you're prepping for their online assessment, you need to nail array and string mechanics first, then chain those into hash-table optimizations. StealthCoder runs invisibly during the live assessment as your real-time backup if you hit a wall on design or DP mid-screen-share.
Top problems at Coupang
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Word Break | MEDIUM | 100.0 | 48% | Array · Hash Table · String |
| 02 | Subsets | MEDIUM | 100.0 | 81% | Array · Backtracking · Bit Manipulation |
| 03 | Decode String | MEDIUM | 98.0 | 61% | String · Stack · Recursion |
| 04 | LFU Cache | HARD | 95.8 | 47% | Hash Table · Linked List · Design |
| 05 | Longest Substring with At Most K Distinct Characters | MEDIUM | 95.8 | 49% | Hash Table · String · Sliding Window |
| 06 | LRU Cache | MEDIUM | 93.4 | 45% | Hash Table · Linked List · Design |
| 07 | Split BST | MEDIUM | 93.4 | 82% | Tree · Binary Search Tree · Recursion |
| 08 | Range Module | HARD | 93.4 | 44% | Design · Segment Tree · Ordered Set |
| 09 | Find Pivot Index | EASY | 93.4 | 61% | Array · Prefix Sum |
| 10 | Course Schedule | MEDIUM | 90.7 | 49% | Depth-First Search · Breadth-First Search · Graph |
| 11 | Design In-Memory File System | HARD | 90.7 | 48% | Hash Table · String · Design |
| 12 | Unique Paths II | MEDIUM | 80.5 | 43% | Array · Dynamic Programming · Matrix |
| 13 | Design Twitter | MEDIUM | 80.5 | 43% | Hash Table · Linked List · Design |
| 14 | Shopping Offers | MEDIUM | 75.9 | 52% | Array · Dynamic Programming · Backtracking |
| 15 | Longest Repeating Substring | MEDIUM | 75.9 | 63% | String · Binary Search · Dynamic Programming |
| 16 | Unique Paths | MEDIUM | 75.9 | 66% | Math · Dynamic Programming · Combinatorics |
| 17 | Possible Bipartition | MEDIUM | 75.9 | 52% | Depth-First Search · Breadth-First Search · Union Find |
| 18 | Regular Expression Matching | HARD | 75.9 | 29% | String · Dynamic Programming · Recursion |
| 19 | Shortest Bridge | MEDIUM | 70.2 | 59% | Array · Depth-First Search · Breadth-First Search |
| 20 | Remove K Digits | MEDIUM | 70.2 | 35% | String · Stack · Greedy |
| 21 | Find K Closest Elements | MEDIUM | 70.2 | 49% | Array · Two Pointers · Binary Search |
| 22 | Longest Substring Without Repeating Characters | MEDIUM | 70.2 | 37% | Hash Table · String · Sliding Window |
| 23 | Longest Duplicate Substring | HARD | 70.2 | 31% | String · Binary Search · Sliding Window |
| 24 | Snapshot Array | MEDIUM | 63.0 | 37% | Array · Hash Table · Binary Search |
| 25 | Design Hit Counter | MEDIUM | 63.0 | 69% | Array · Binary Search · Design |
| 26 | Wildcard Matching | HARD | 63.0 | 30% | String · Dynamic Programming · Greedy |
| 27 | Number of Distinct Islands | MEDIUM | 63.0 | 62% | Hash Table · Depth-First Search · Breadth-First Search |
| 28 | Basic Calculator II | MEDIUM | 63.0 | 46% | Math · String · Stack |
| 29 | Number of Islands | MEDIUM | 63.0 | 62% | Array · Depth-First Search · Breadth-First Search |
| 30 | Single Element in a Sorted Array | MEDIUM | 63.0 | 59% | Array · Binary Search |
| 31 | Search a 2D Matrix | MEDIUM | 63.0 | 52% | Array · Binary Search · Matrix |
| 32 | Sliding Window Maximum | HARD | 63.0 | 48% | Array · Queue · Sliding Window |
| 33 | Group Anagrams | MEDIUM | 63.0 | 71% | Array · Hash Table · String |
| 34 | Cheapest Flights Within K Stops | MEDIUM | 63.0 | 40% | Dynamic Programming · Depth-First Search · Breadth-First Search |
| 35 | Find Median from Data Stream | HARD | 52.8 | 53% | Two Pointers · Design · Sorting |
| 36 | Number of Atoms | HARD | 52.8 | 65% | Hash Table · String · Stack |
| 37 | Open the Lock | MEDIUM | 52.8 | 61% | Array · Hash Table · String |
| 38 | Pacific Atlantic Water Flow | MEDIUM | 52.8 | 58% | Array · Depth-First Search · Breadth-First Search |
| 39 | Basic Calculator III | HARD | 52.8 | 52% | Math · String · Stack |
| 40 | Increasing Triplet Subsequence | MEDIUM | 52.8 | 39% | Array · Greedy |
| 41 | Bus Routes | HARD | 52.8 | 47% | Array · Hash Table · Breadth-First Search |
| 42 | Maximum Number of Tasks You Can Assign | HARD | 52.8 | 51% | Array · Two Pointers · Binary Search |
| 43 | Search a 2D Matrix II | MEDIUM | 52.8 | 55% | Array · Binary Search · Divide and Conquer |
| 44 | Distinct Subsequences | HARD | 52.8 | 50% | String · Dynamic Programming |
| 45 | Buildings With an Ocean View | MEDIUM | 52.8 | 81% | Array · Stack · Monotonic Stack |
| 46 | Reorganize String | MEDIUM | 52.8 | 56% | Hash Table · String · Greedy |
| 47 | Kth Largest Element in an Array | MEDIUM | 52.8 | 68% | Array · Divide and Conquer · Sorting |
| 48 | Split Strings by Separator | EASY | 52.8 | 75% | Array · String |
| 49 | Basic Calculator | HARD | 52.8 | 46% | Math · String · Stack |
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 Coupang OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- array23 · 47%
- string19 · 39%
- hash table14 · 29%
- breadth first search9 · 18%
- dynamic programming9 · 18%
- binary search9 · 18%
- design8 · 16%
- sorting8 · 16%
- depth first search7 · 14%
- stack7 · 14%
The distribution tells a clear story. Arrays and strings are nearly 43 percent of the problem set, so your first week should be array mechanics (prefix sums, subarrays, two-pointer) and string sliding windows. Hash tables appear in 14 problems and often pair with arrays or strings to cut time complexity, especially in substring and subarray tasks. Design problems are concentrated but heavy (LRU Cache, LFU Cache, Twitter, In-Memory File System) and require both data structure knowledge and implementation stamina. Binary search and DP each hit 9 problems, making them tiebreaker skills. Graph problems (BFS, DFS, topological sort) are lower frequency but non-negotiable when they appear. Your weakness is likely design at scale or DP state transitions under time pressure. That's exactly where StealthCoder hedges you on the live OA: if you start overthinking an LFU Cache or Range Module and burn 15 minutes, the tool surfaces a working solution in seconds, keeping your momentum.
Companies with similar patterns
If you prepped for Coupang, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Coupang.
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. Built by a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Coupang interview FAQ
How many array problems should I solve before the assessment?+
Array appears in 23 of 49 problems, nearly 47 percent. Solve at least 12-15 core array problems covering prefix sums, subarrays, two-pointer, and matrix traversal. That covers the easy and most medium patterns. Coupang includes Find Pivot Index and Unique Paths II in their set.
Is design experience required for Coupang?+
Yes. Design problems make up 8 of 49 and Coupang's set includes LRU Cache, LFU Cache, Twitter feed, and in-memory file system. These are hard or medium with heavy linked-list and trie dependencies. Spend 4-5 days on design patterns alone.
Should I learn binary search before the OA?+
Binary search appears in 9 problems at Coupang, same frequency as DP and BFS. If you're weak on it, drill 5-6 problems on it. But prioritize arrays and strings first since they represent 43 percent of the set. Binary search is a tiebreaker skill.
What's the hardest topic to cram in one week?+
Design. 8 problems involve LRU, LFU, file systems, and heaps. These require both understanding and coding under pressure. Hash tables and linked lists must be automatic. Start design first, not last, and allocate 40 percent of your prep week to it.
How important is graph knowledge for Coupang?+
Moderate. BFS and DFS appear in 9 and 7 problems respectively. Course Schedule (topological sort) is in the set. If you're not comfortable with graph traversal, drill 3-4 graph problems. It's lower priority than arrays, strings, and design.