Coupang Coding Interview Questions
26 Coupang coding interview problems with full optimal solutions — 13 easy, 10 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Coupang interviewer values, and a FAQ section.
Showing 3 problems of 26
- #24hardfoundational
24. Median of Two Sorted Arrays
Find the median of two sorted arrays in O(log) time, mirroring how Coupang's same-day delivery routing computes the median dispatch time across two pre-sorted regional batches without merging them.
- #25hardfoundational
25. Trapping Rain Water
Compute how much rainwater is trapped between bars, mirroring how Coupang's returns-processing pipeline estimates buffer capacity between fulfillment-center bottlenecks during peak-event throughput.
- #26hardfoundational
26. Merge k Sorted Lists
Merge k sorted linked lists into one sorted list, mirroring how Coupang's same-day delivery routing merges sorted dispatch streams from k regional warehouses during peak-event throughput.