Coupang Interview Questions — 49 DSA Problems

41 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Coupang LeetCode questions for software engineering interviews.

• Subsets (MEDIUM) — Array, Backtracking, Bit Manipulation
• Word Break (MEDIUM) — Array, Hash Table, String, Dynamic Programming, Trie, Memoization
• Decode String (MEDIUM) — String, Stack, Recursion
• Longest Substring with At Most K Distinct Characters (MEDIUM) — Hash Table, String, Sliding Window
• LFU Cache (HARD) — Hash Table, Linked List, Design, Doubly-Linked List
• Range Module (HARD) — Design, Segment Tree, Ordered Set
• Split BST (MEDIUM) — Tree, Binary Search Tree, Recursion, Binary Tree
• Find Pivot Index (EASY) — Array, Prefix Sum
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Design In-Memory File System (HARD) — Hash Table, String, Design, Trie, Sorting
• Unique Paths II (MEDIUM) — Array, Dynamic Programming, Matrix
• Design Twitter (MEDIUM) — Hash Table, Linked List, Design, Heap (Priority Queue)
• Possible Bipartition (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Shopping Offers (MEDIUM) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask
• Longest Repeating Substring (MEDIUM) — String, Binary Search, Dynamic Programming, Rolling Hash, Suffix Array, Hash Function
• Unique Paths (MEDIUM) — Math, Dynamic Programming, Combinatorics
• Regular Expression Matching (HARD) — String, Dynamic Programming, Recursion
• Find K Closest Elements (MEDIUM) — Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue)
• Remove K Digits (MEDIUM) — String, Stack, Greedy, Monotonic Stack
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Shortest Bridge (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Matrix
• Longest Duplicate Substring (HARD) — String, Binary Search, Sliding Window, Rolling Hash, Suffix Array, Hash Function
• Design Hit Counter (MEDIUM) — Array, Binary Search, Design, Queue, Data Stream
• Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
• Search a 2D Matrix (MEDIUM) — Array, Binary Search, Matrix
• Snapshot Array (MEDIUM) — Array, Hash Table, Binary Search, Design
• Single Element in a Sorted Array (MEDIUM) — Array, Binary Search
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Number of Distinct Islands (MEDIUM) — Hash Table, Depth-First Search, Breadth-First Search, Union Find, Hash Function
• Basic Calculator II (MEDIUM) — Math, String, Stack
• Cheapest Flights Within K Stops (MEDIUM) — Dynamic Programming, Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Wildcard Matching (HARD) — String, Dynamic Programming, Greedy, Recursion
• Distinct Subsequences (HARD) — String, Dynamic Programming
• Buildings With an Ocean View (MEDIUM) — Array, Stack, Monotonic Stack
• Maximum Number of Tasks You Can Assign (HARD) — Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queue
• Reorganize String (MEDIUM) — Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting
• Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• Bus Routes (HARD) — Array, Hash Table, Breadth-First Search
• Split Strings by Separator (EASY) — Array, String
• Number of Atoms (HARD) — Hash Table, String, Stack, Sorting
• Find Median from Data Stream (HARD) — Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream
• Open the Lock (MEDIUM) — Array, Hash Table, String, Breadth-First Search
• Pacific Atlantic Water Flow (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Matrix
• Search a 2D Matrix II (MEDIUM) — Array, Binary Search, Divide and Conquer, Matrix
• Basic Calculator III (HARD) — Math, String, Stack, Recursion
• Increasing Triplet Subsequence (MEDIUM) — Array, Greedy
• Basic Calculator (HARD) — Math, String, Stack, Recursion