Yelp Interview Questions — 29 DSA Problems
28 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Yelp LeetCode questions for software engineering interviews.
- Destination City (EASY) — Array, Hash Table, String
- Filter Restaurants by Vegan-Friendly, Price and Distance (MEDIUM) — Array, Sorting
- Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
- Two Sum (EASY) — Array, Hash Table
- Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
- Letter Case Permutation (MEDIUM) — String, Backtracking, Bit Manipulation
- Top K Frequent Words (MEDIUM) — Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting
- Minimum Index Sum of Two Lists (EASY) — Array, Hash Table, String
- Find the Closest Palindrome (HARD) — Math, String
- Check If a Word Occurs As a Prefix of Any Word in a Sentence (EASY) — Two Pointers, String, String Matching
- String Compression (MEDIUM) — Two Pointers, String
- Decode String (MEDIUM) — String, Stack, Recursion
- Insert Delete GetRandom O(1) - Duplicates allowed (HARD) — Array, Hash Table, Math, Design, Randomized
- Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
- Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
- Valid Anagram (EASY) — Hash Table, String, Sorting
- The Skyline Problem (HARD) — Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Line Sweep, Heap (Priority Queue), Ordered Set
- Reverse Linked List (EASY) — Linked List, Recursion
- Active Businesses (MEDIUM) — Database
- Reverse Words in a String (MEDIUM) — Two Pointers, String
- Word Ladder (HARD) — Hash Table, String, Breadth-First Search
- Word Ladder II (HARD) — Hash Table, String, Backtracking, Breadth-First Search
- Merge Intervals (MEDIUM) — Array, Sorting
- Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
- Longest Common Prefix (EASY) — String, Trie
- Remove Colored Pieces if Both Neighbors are the Same Color (MEDIUM) — Math, String, Greedy, Game Theory
- Random Pick with Weight (MEDIUM) — Array, Math, Binary Search, Prefix Sum, Randomized
- Minimum String Length After Removing Substrings (EASY) — String, Stack, Simulation
- Shortest and Lexicographically Smallest Beautiful String (MEDIUM) — String, Sliding Window
Y
Yelp
29 questions tracked28 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 29 of 29 questions
2MediumFilter Restaurants by Vegan-Friendly, Price and Distance✓ Our Solution ArraySorting
3Depth-First SearchBreadth-First SearchGraphTopological Sort
5Hash TableStringSliding Window
6StringBacktrackingBit Manipulation
7ArrayHash TableStringTrie+4
10EasyCheck If a Word Occurs As a Prefix of Any Word in a Sentence✓ Our Solution Two PointersStringString Matching
13ArrayHash TableMathDesign+1
14ArrayHash TableMathDesign+1
15ArrayHash TableDivide and ConquerSorting+4
17ArrayDivide and ConquerBinary Indexed TreeSegment Tree+3
19MediumActive Businesses
Database
21Hash TableStringBreadth-First Search
22Hash TableStringBacktrackingBreadth-First Search
24ArrayHash TableStringSorting
26MediumRemove Colored Pieces if Both Neighbors are the Same Color✓ Our Solution MathStringGreedyGame Theory
27ArrayMathBinary SearchPrefix Sum+1
29MediumShortest and Lexicographically Smallest Beautiful String✓ Our Solution StringSliding Window