Coupang LeetCode Questions
49 questions all-time · 2 easy · 33 medium · 14 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Subsets Array, Backtracking, Bit Manipulation | Medium | 100 | 80.9% |
| 2 | Word Break Array, Hash Table, String, Dynamic Programming, Trie, Memoization | Medium | 100 | 48.3% |
| 3 | Decode String String, Stack, Recursion | Medium | 98 | 61.2% |
| 4 | Longest Substring with At Most K Distinct Characters Hash Table, String, Sliding Window | Medium | 96 | 49.5% |
| 5 | LFU Cache Hash Table, Linked List, Design, Doubly-Linked List | Hard | 96 | 46.6% |
| 6 | Range Module Design, Segment Tree, Ordered Set | Hard | 93 | 44.2% |
| 7 | Split BST Tree, Binary Search Tree, Recursion, Binary Tree | Medium | 93 | 82.4% |
| 8 | Find Pivot Index Array, Prefix Sum | Easy | 93 | 60.6% |
| 9 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 93 | 45.2% |
| 10 | Course Schedule Depth-First Search, Breadth-First Search, Graph, Topological Sort | Medium | 91 | 49.2% |
| 11 | Design In-Memory File System Hash Table, String, Design, Trie, Sorting | Hard | 91 | 48.2% |
| 12 | Unique Paths II Array, Dynamic Programming, Matrix | Medium | 81 | 43.2% |
| 13 | Design Twitter Hash Table, Linked List, Design, Heap (Priority Queue) | Medium | 81 | 42.7% |
| 14 | Possible Bipartition Depth-First Search, Breadth-First Search, Union Find, Graph | Medium | 76 | 51.5% |
| 15 | Shopping Offers Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask | Medium | 76 | 51.9% |
| 16 | Longest Repeating Substring String, Binary Search, Dynamic Programming, Rolling Hash, Suffix Array, Hash Function | Medium | 76 | 63.1% |
| 17 | Unique Paths Math, Dynamic Programming, Combinatorics | Medium | 76 | 65.8% |
| 18 | Regular Expression Matching String, Dynamic Programming, Recursion | Hard | 76 | 29.3% |
| 19 | Find K Closest Elements Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue) | Medium | 70 | 48.7% |
| 20 | Remove K Digits String, Stack, Greedy, Monotonic Stack | Medium | 70 | 34.9% |
| 21 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 70 | 36.9% |
| 22 | Shortest Bridge Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 70 | 58.6% |
| 23 | Longest Duplicate Substring String, Binary Search, Sliding Window, Rolling Hash, Suffix Array, Hash Function | Hard | 70 | 30.8% |
| 24 | Design Hit Counter Array, Binary Search, Design, Queue, Data Stream | Medium | 63 | 69.2% |
| 25 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 63 | 47.6% |
| 26 | Search a 2D Matrix Array, Binary Search, Matrix | Medium | 63 | 52.3% |
| 27 | Snapshot Array Array, Hash Table, Binary Search, Design | Medium | 63 | 36.7% |
| 28 | Single Element in a Sorted Array Array, Binary Search | Medium | 63 | 59.2% |
| 29 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 63 | 70.9% |
| 30 | Number of Distinct Islands Hash Table, Depth-First Search, Breadth-First Search, Union Find, Hash Function | Medium | 63 | 62.3% |
| 31 | Basic Calculator II Math, String, Stack | Medium | 63 | 45.8% |
| 32 | Cheapest Flights Within K Stops Dynamic Programming, Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path | Medium | 63 | 40.4% |
| 33 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union Find, Matrix | Medium | 63 | 62.3% |
| 34 | Wildcard Matching String, Dynamic Programming, Greedy, Recursion | Hard | 63 | 29.9% |
| 35 | Distinct Subsequences String, Dynamic Programming | Hard | 53 | 50.1% |
| 36 | Buildings With an Ocean View Array, Stack, Monotonic Stack | Medium | 53 | 80.8% |
| 37 | Maximum Number of Tasks You Can Assign Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queue | Hard | 53 | 50.6% |
| 38 | Reorganize String Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 53 | 56.2% |
| 39 | Kth Largest Element in an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect | Medium | 53 | 68.0% |
| 40 | Bus Routes Array, Hash Table, Breadth-First Search | Hard | 53 | 47.0% |
| 41 | Split Strings by Separator Array, String | Easy | 53 | 74.9% |
| 42 | Number of Atoms Hash Table, String, Stack, Sorting | Hard | 53 | 65.0% |
| 43 | Find Median from Data Stream Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream | Hard | 53 | 53.3% |
| 44 | Open the Lock Array, Hash Table, String, Breadth-First Search | Medium | 53 | 60.7% |
| 45 | Pacific Atlantic Water Flow Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 53 | 57.5% |
| 46 | Search a 2D Matrix II Array, Binary Search, Divide and Conquer, Matrix | Medium | 53 | 55.2% |
| 47 | Basic Calculator III Math, String, Stack, Recursion | Hard | 53 | 52.5% |
| 48 | Increasing Triplet Subsequence Array, Greedy | Medium | 53 | 39.1% |
| 49 | Basic Calculator Math, String, Stack, Recursion | Hard | 53 | 45.6% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.