Coupang Interview Questions

Showing 50 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Coupang. The higher the ranking, the more likely you'll encounter it in a Coupang interview.

Question

Frequency

Difficulty

Largest Rectangle in Histogram

Find the largest rectangular area that can fit within a histogram defined by an array of bar heights. You are given an array representing the height of bars, where each bar has a width of 1.

If you have a Coupang interview, it's very likely that you will get this question

#1. Largest Rectangle in Histogram

Find the largest rectangular area that can fit within a histogram defined by an array of bar heights. You are given an array representing the height of bars, where each bar has a width of 1.

This question is very likely to be asked in your Coupang interview

LRU Cache

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked ListsDynamic Programming

If you have a Coupang interview, it's very likely that you will get this question

#2. LRU Cache

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked ListsDynamic Programming

This question is very likely to be asked in your Coupang interview

Decode String

The problem involves decoding a string that follows a specific encoding rule: k[encoded_string], where the encoded_string inside the square brackets is repeated exactly k times. Your task is to decode the string and return the decoded string.

StringsStacksRecursion

If you have a Coupang interview, it's very likely that you will get this question

#3. Decode String

The problem involves decoding a string that follows a specific encoding rule: k[encoded_string], where the encoded_string inside the square brackets is repeated exactly k times. Your task is to decode the string and return the decoded string.

StringsStacksRecursion

This question is very likely to be asked in your Coupang interview

Subsets

Given a set of distinct integers, your task is to generate all possible subsets (the power set). The solution should not contain duplicate subsets.

ArraysRecursion

If you have a Coupang interview, it's very likely that you will get this question

#4. Subsets

Given a set of distinct integers, your task is to generate all possible subsets (the power set). The solution should not contain duplicate subsets.

ArraysRecursion

This question is very likely to be asked in your Coupang interview

Word Break

Determine if a given string can be segmented into a space-separated sequence of words from a dictionary. You are given a string and a dictionary of words; can you break the string down using words from the dictionary?

StringsDynamic Programming

If you have a Coupang interview, it's very likely that you will get this question

#5. Word Break

Determine if a given string can be segmented into a space-separated sequence of words from a dictionary. You are given a string and a dictionary of words; can you break the string down using words from the dictionary?

StringsDynamic Programming

This question is very likely to be asked in your Coupang interview

LFU Cache

Design and implement a Least Frequently Used (LFU) cache. The cache should allow you to get and put key-value pairs, evicting the least frequently used key when the cache is full.

ArraysLinked ListsDynamic Programming

Somewhat likely

If you have a Coupang interview, you might get this question

#6. LFU Cache

Design and implement a Least Frequently Used (LFU) cache. The cache should allow you to get and put key-value pairs, evicting the least frequently used key when the cache is full.

ArraysLinked ListsDynamic Programming

This question is somewhat likely to be asked in your Coupang interview

Longest Substring with At Most K Distinct Characters

Find the longest substring within a given string that contains at most K distinct characters. You need to determine the length of this substring.

StringsSliding Windows

Somewhat likely

If you have a Coupang interview, you might get this question

#7. Longest Substring with At Most K Distinct Characters

Find the longest substring within a given string that contains at most K distinct characters. You need to determine the length of this substring.

StringsSliding Windows

This question is somewhat likely to be asked in your Coupang interview

Range Module

Design a data structure to track ranges of numbers and efficiently add, remove, or query if a number is covered by any of the tracked ranges.

Somewhat likely

If you have a Coupang interview, you might get this question

#8. Range Module

Design a data structure to track ranges of numbers and efficiently add, remove, or query if a number is covered by any of the tracked ranges.

This question is somewhat likely to be asked in your Coupang interview

Split BST

Given a binary search tree and a target value, split the tree into two BSTs. One BST should contain nodes with values less than or equal to the target, and the other should contain nodes with values greater than the target.

Somewhat likely

If you have a Coupang interview, you might get this question

#9. Split BST

Given a binary search tree and a target value, split the tree into two BSTs. One BST should contain nodes with values less than or equal to the target, and the other should contain nodes with values greater than the target.

This question is somewhat likely to be asked in your Coupang interview

Find Pivot Index

Given an array of numbers, find the index where the sum of numbers to the left equals the sum of numbers to the right. If no such index exists, return -1.

Somewhat likely

If you have a Coupang interview, you might get this question

#10. Find Pivot Index

Given an array of numbers, find the index where the sum of numbers to the left equals the sum of numbers to the right. If no such index exists, return -1.

This question is somewhat likely to be asked in your Coupang interview

Course Schedule

Determine if it is possible to finish all courses given prerequisites. Some courses must be taken before others; can you find a valid order?

GraphsRecursionDynamic Programming

Somewhat likely

If you have a Coupang interview, you might get this question

#11. Course Schedule

Determine if it is possible to finish all courses given prerequisites. Some courses must be taken before others; can you find a valid order?

GraphsRecursionDynamic Programming

This question is somewhat likely to be asked in your Coupang interview

Design In-Memory File System

Implement an in-memory file system with basic operations like creating directories, adding files, and listing contents. The file system should support path-based navigation.

Somewhat likely

If you have a Coupang interview, you might get this question

#12. Design In-Memory File System

Implement an in-memory file system with basic operations like creating directories, adding files, and listing contents. The file system should support path-based navigation.

This question is somewhat likely to be asked in your Coupang interview

Unique Paths II

Find the number of unique paths from the top-left to the bottom-right corner of a grid, but with obstacles blocking some paths. You need to navigate the grid avoiding the obstacles.

ArraysDynamic Programming

Somewhat likely

If you have a Coupang interview, you might get this question

#13. Unique Paths II

Find the number of unique paths from the top-left to the bottom-right corner of a grid, but with obstacles blocking some paths. You need to navigate the grid avoiding the obstacles.

ArraysDynamic Programming

This question is somewhat likely to be asked in your Coupang interview

Longest Repeating Substring

Find the longest substring that appears more than once in a given string. Overlapping occurrences are allowed.

Somewhat likely

If you have a Coupang interview, you might get this question

#14. Longest Repeating Substring

Find the longest substring that appears more than once in a given string. Overlapping occurrences are allowed.

This question is somewhat likely to be asked in your Coupang interview

Shortest Bridge

Imagine two islands represented by ones in a grid of zeros and ones. Find the shortest path to connect the two islands by changing zeros to ones.

Somewhat likely

If you have a Coupang interview, you might get this question

#15. Shortest Bridge

Imagine two islands represented by ones in a grid of zeros and ones. Find the shortest path to connect the two islands by changing zeros to ones.

This question is somewhat likely to be asked in your Coupang interview

Unique Paths

Find the number of unique paths from the top-left corner to the bottom-right corner of a grid, moving only down or right.

Dynamic Programming

Somewhat likely

If you have a Coupang interview, you might get this question

#16. Unique Paths

Find the number of unique paths from the top-left corner to the bottom-right corner of a grid, moving only down or right.

Dynamic Programming

This question is somewhat likely to be asked in your Coupang interview

Possible Bipartition

Determine if a group of people can be divided into two sets such that no two people who dislike each other are in the same set. You're given a list of dislikes; can you split the group?

Somewhat likely

If you have a Coupang interview, you might get this question

#17. Possible Bipartition

Determine if a group of people can be divided into two sets such that no two people who dislike each other are in the same set. You're given a list of dislikes; can you split the group?

This question is somewhat likely to be asked in your Coupang interview

Regular Expression Matching

Determine if an input string matches a given regular expression that supports '.' and '*' characters. The '.' matches any single character, and '*' matches zero or more occurrences of the preceding element.

StringsDynamic ProgrammingRecursion

Somewhat likely

If you have a Coupang interview, you might get this question

#18. Regular Expression Matching

Determine if an input string matches a given regular expression that supports '.' and '*' characters. The '.' matches any single character, and '*' matches zero or more occurrences of the preceding element.

StringsDynamic ProgrammingRecursion

This question is somewhat likely to be asked in your Coupang interview

Longest Duplicate Substring

Find the longest substring that appears at least twice in a given string. The occurrences may overlap.

ArraysStringsBinary SearchSliding Windows

If you have a Coupang interview, it's unlikely that you will get this question

#19. Longest Duplicate Substring

Find the longest substring that appears at least twice in a given string. The occurrences may overlap.

ArraysStringsBinary SearchSliding Windows

This question is not likely to be asked in your Coupang interview

Shopping Offers

Imagine you're buying items and have special offers that combine multiple items for a cheaper price. Your goal is to find the minimum cost to purchase a specific list of items, using a combination of individual prices and special offers.

ArraysDynamic ProgrammingRecursion

If you have a Coupang interview, it's unlikely that you will get this question

#20. Shopping Offers

Imagine you're buying items and have special offers that combine multiple items for a cheaper price. Your goal is to find the minimum cost to purchase a specific list of items, using a combination of individual prices and special offers.

ArraysDynamic ProgrammingRecursion

This question is not likely to be asked in your Coupang interview

Copyright © Taro