Coupang
Coupang is South Korea's dominant e-commerce platform, famous for Rocket Delivery — next-day delivery before 7am.
- Rounds
- 4 rounds
- Focus
- DSA + Coding
- System Design
- No
- Timeline
- 2–4 weeks to offer
Rounds 1–2 are fully visible · Round 3+ unlocked with a free account
Online Assessment
Two medium-hard coding problems on HackerRank with strict time limits. Coupang's OA skews harder than peer e-commerce companies — one problem typically requires a non-obvious graph or DP insight, not just pattern recall. Reported problems include island-detection variants and subsequence-counting with constraints, both of which echo the spatial and logistics reasoning Coupang does at scale.
What to expect
- Problem 1 (Medium-Hard): e.g., 'Count the number of distinct island shapes in a binary grid' — BFS/DFS with shape normalization to handle rotations and reflections
- Problem 2 (Hard): e.g., 'Count ways to match a source pattern as a non-consecutive subsequence in a target string' — DFS + memoization, not a textbook DP template
- Time is the main killer — one problem can easily eat 50 minutes; submit a brute-force early before optimizing
- Partial scoring is real: a clean O(n²) solution that handles edge cases scores better than a broken O(n log n) attempt
Practice on KnowEase.AI
Coding Round 1
One medium-hard problem with an emphasis on clean, production-quality code. Coupang interviewers have explicitly said they weigh approach and thinking over pure outcome — narrate your reasoning as you go, not after. Problems often involve grid traversal or spatial reasoning (Best Meeting Point, multi-source BFS for island distance), which mirrors delivery zone routing logic.
What to expect
- e.g., 'Find the point in a grid that minimizes the sum of Manhattan distances to all occupied cells' — weighted median, not Euclidean centroid; common trap is using BFS instead of sorting
- e.g., 'Find the minimum distance between two distinct islands in a binary grid' — multi-source BFS, requires handling the 'same island' boundary condition explicitly
- Follow-up: 'What if the grid is 10M×10M and sparse — how does your approach change?'
- Settling for a brute-force O(n²) grid scan without flagging it as suboptimal is a red flag; say it before they ask
Practice on KnowEase.AI
Coding Round 2
Culture Fit Screen
About Coupang SDE-1 Interviews
Coupang SDE-1 interviews prioritize algorithmic depth over breadth — expect medium-hard problems drawn from graph traversal, island detection, and grid-based search, all domains that map directly to Rocket Delivery's spatial logistics. The bar is noticeably higher than comparable e-commerce companies, with 60-minute windows that leave no time for re-reading fundamentals.
See interview loops for other companies:
Start your Coupang SDE-1 prep plan
Practice the exact topics tested in each round — DSA, system design, SQL, and LLD.
Start free →