Problem database last updated: June 20, 2025

CCoupang logo

Coupang Coding Interview Questions

41 problems · 2 Easy, 27 Medium, 12 Hard · Ranked #52 of 458

Difficulty breakdown

2 Easy

5% · avg 23%

27 Medium

66% · avg 59%

12 Hard

29% · avg 18%

Top topics

array
51.2%
string
36.6%
hash-table
26.8%
dynamic-programming
19.5%
breadth-first-search
19.5%2.4x
heap-priority-queue
17.1%2.8x

Interview profile

Based on 41 reported problems, Coupang interviews are significantly harder than average - 29% Hard vs 18% across all companies. The majority (66%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.

Compared to the industry average, Coupang puts unusual emphasis on monotonic-queue (4.9% of problems, 7x the industry average), queue (4.9% of problems, 3.4x the industry average), memoization (4.9% of problems, 3x the industry average). If you're short on time, these are the categories to double down on.

The most common topics are array (51.2%), string (36.6%), hash-table (26.8%), dynamic-programming (19.5%). Problems below are sorted by frequency, the ones at the top are asked most often.

All 41 problems

Subsets

Solve

Given an integer array nums of unique elements, return all possible subsets (the power set).

MediumVery Likely
arraybacktrackingbit-manipulation

Word Break

Solve

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.

MediumVery Likely
arrayhash-tablestring

Decode String

Solve

Given an encoded string, return its decoded string.

MediumVery Likely
stringstackrecursion

LFU Cache

Solve

Design and implement a data structure for a Least Frequently Used (LFU) cache.

HardVery Likely
hash-tablelinked-listdesign

Find Pivot Index

Solve

Given an array of integers nums, calculate the pivot index of this array.

EasyVery Likely
arrayprefix-sum

Range Module

Solve

A Range Module is a module that tracks ranges of numbers. Design a data structure to track the ranges represented as half-open intervals and query about them.

HardVery Likely
designsegment-treeordered-set

LRU Cache

Solve

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.

MediumVery Likely
hash-tablelinked-listdesign

Course Schedule

Solve

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b...

MediumVery Likely
depth-first-searchbreadth-first-searchgraph

Unique Paths II

Solve

You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r...

MediumVery Likely
arraydynamic-programmingmatrix

Design Twitter

Solve

Design a simplified version of Twitter where users can post tweets, follow/unfollow another user, and is able to see the 10 most recent tweets in the user's new...

MediumVery Likely
hash-tablelinked-listdesign

Possible Bipartition

Solve

We want to split a group of n people (labeled from 1 to n) into two groups of any size. Each person may dislike some other people, and they should not go into t...

MediumVery Likely
depth-first-searchbreadth-first-searchunion-find

Unique Paths

Solve

There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner...

MediumVery Likely
mathdynamic-programmingcombinatorics

Shopping Offers

Solve

In LeetCode Store, there are n items to sell. Each item has a price. However, there are some special offers, and a special offer consists of one or more differe...

MediumVery Likely
arraydynamic-programmingbacktracking

Regular Expression Matching

Solve

Given an input string s and a pattern p, implement regular expression matching with support for '.' and '' where:

HardVery Likely
stringdynamic-programmingrecursion

Longest Substring Without Repeating Characters

Solve

Given a string s, find the length of the longest substring without duplicate characters.

MediumLikely
hash-tablestringsliding-window

Longest Duplicate Substring

Solve

Given a string s, consider all duplicated substrings: (contiguous) substrings of s that occur 2 or more times. The occurrences may overlap.

HardLikely
stringbinary-searchsliding-window

Shortest Bridge

Solve

You are given an n x n binary matrix grid where 1 represents land and 0 represents water.

MediumLikely
arraydepth-first-searchbreadth-first-search

Remove K Digits

Solve

Given string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num.

MediumLikely
stringstackgreedy

Find K Closest Elements

Solve

Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order.

MediumLikely
arraytwo-pointersbinary-search

Snapshot Array

Solve

Implement a SnapshotArray that supports the following interface:

MediumLikely
arrayhash-tablebinary-search

Search a 2D Matrix

Solve

You are given an m x n integer matrix matrix with the following two properties:

MediumLikely
arraybinary-searchmatrix

Basic Calculator II

Solve

Given a string s which represents an expression, evaluate this expression and return its value.

MediumLikely
mathstringstack

Group Anagrams

Solve

Given an array of strings strs, group the anagrams together. You can return the answer in any order.

MediumLikely
arrayhash-tablestring

Wildcard Matching

Solve

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '' where:

HardLikely
stringdynamic-programminggreedy

Cheapest Flights Within K Stops

Solve

There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight...

MediumLikely
dynamic-programmingdepth-first-searchbreadth-first-search

Number of Islands

Solve

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.

MediumLikely
arraydepth-first-searchbreadth-first-search

Single Element in a Sorted Array

Solve

You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.

MediumLikely
arraybinary-search

Sliding Window Maximum

Solve

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...

HardLikely
arrayqueuesliding-window

Reorganize String

Solve

Given a string s, rearrange the characters of s so that any two adjacent characters are not the same.

MediumLikely
hash-tablestringgreedy

Number of Atoms

Solve

Given a string formula representing a chemical formula, return the count of each atom.

HardLikely
hash-tablestringstack

Search a 2D Matrix II

Solve

Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties:

MediumLikely
arraybinary-searchdivide-and-conquer

Open the Lock

Solve

You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely...

MediumLikely
arrayhash-tablestring

Bus Routes

Solve

You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever.

HardLikely
arrayhash-tablebreadth-first-search

Basic Calculator

Solve

Given a string s representing a valid expression, implement a basic calculator to evaluate it, and return the result of the evaluation.

HardLikely
mathstringstack

Find Median from Data Stream

Solve

The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two midd...

HardLikely
two-pointersdesignsorting

Kth Largest Element in an Array

Solve

Given an integer array nums and an integer k, return the kth largest element in the array.

MediumLikely
arraydivide-and-conquersorting

Distinct Subsequences

Solve

Given two strings s and t, return the number of distinct subsequences of s which equals t.

HardLikely
stringdynamic-programming

Maximum Number of Tasks You Can Assign

Solve

You have n tasks and m workers. Each task has a strength requirement stored in a 0-indexed integer array tasks, with the ith task requiring tasks[i] strength to...

HardLikely
arraytwo-pointersbinary-search

Split Strings by Separator

Solve

Given an array of strings words and a character separator, split each string in words by separator.

EasyLikely
arraystring

Pacific Atlantic Water Flow

Solve

There is an m x n rectangular island that borders both the Pacific Ocean and Atlantic Ocean. The Pacific Ocean touches the island's left and top edges, and the...

MediumLikely
arraydepth-first-searchbreadth-first-search

Increasing Triplet Subsequence

Solve

Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices e...

MediumLikely
arraygreedy

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 Coupang interviews.

Very Likely

75-100%

Likely

50-74%

Sometimes

25-49%

Rare

0-24%

Preparing for your Coupang coding interview

Coupang interviews focus heavily on array, string, hash-table 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. Coupang 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.

Frequently Asked Questions

What coding problems does Coupang ask in interviews?add

Coupang has been reported to ask 41 distinct coding problems. The most common topics are array, string, hash-table. 2 are Easy difficulty, 27 are Medium, and 12 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.

How hard are Coupang coding interviews?add

Based on 41 reported problems, Coupang interviews are significantly harder than average - 29% Hard vs 18% across all companies. 66% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.

How should I prepare for a Coupang coding interview?add

Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.

Other companies to explore

Ready to ace your Coupang interview?

Simulate a real Coupang coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.

Simulate a Coupang interview with AIarrow_forward