Booking.com LeetCode Questions
14 questions all-time · 2 easy · 8 medium · 4 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Reward Top K Students Array, Hash Table, String, Sorting, Heap (Priority Queue) | Medium | 100 | 0.5% |
| 2 | Delete Duplicate Folders in System Array, Hash Table, String, Depth-First Search, Trie, Sorting, Hash Function | Hard | 86 | 0.8% |
| 3 | Two Out of Three Array, Hash Table, Bit Manipulation | Easy | 86 | 0.8% |
| 4 | Coloring A Border Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 84 | 0.5% |
| 5 | K Highest Ranked Items Within a Price Range Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrix | Medium | 84 | 0.5% |
| 6 | Order Two Columns Independently Database | Medium | 84 | 0.6% |
| 7 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 73 | 0.5% |
| 8 | Maximal Square Array, Dynamic Programming, Matrix | Medium | 65 | 0.5% |
| 9 | Reconstruct Itinerary Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit | Hard | 65 | 0.4% |
| 10 | Integer to Roman Hash Table, Math, String | Medium | 65 | 0.7% |
| 11 | Permutations Array, Backtracking | Medium | 65 | 0.8% |
| 12 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 59 | 0.5% |
| 13 | Roman to Integer Hash Table, Math, String | Easy | 51 | 0.7% |
| 14 | Longest Valid Parentheses String, Dynamic Programming, Stack | Hard | 51 | 0.4% |
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.