Yelp Coding Interview Questions
25 Yelp coding interview problems with full optimal solutions — 15 easy, 7 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 Yelp interviewer values, and a FAQ section.
Showing 3 problems of 25
- #23hardfoundational
23. Median of Two Sorted Arrays
Find the median of two sorted arrays in O(log(min(m,n))) — Yelp uses this binary-search-on-partition trick to test whether candidates can find log-time medians in merged review-score streams.
- #24hardfoundational
24. Merge k Sorted Lists
Merge k sorted linked lists into one — Yelp uses min-heap-of-heads to test whether candidates can scale a streaming merge to fanned-in review-event shards.
- #25hardfoundational
25. Trapping Rain Water
Compute how much water can be trapped between elevation bars — Yelp uses the two-pointer max-tracking solution to test whether candidates can compress prefix/suffix max into one pass for recommendation-score smoothing.