Airbnb LeetCode Questions
63 questions all-time · 11 easy · 31 medium · 21 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Text Justification Array, String, Simulation | Hard | 100 | 0.5% |
| 2 | Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming, Sorting | Hard | 92 | 0.5% |
| 3 | Flatten 2D Vector Array, Two Pointers, Design, Iterator | Medium | 86 | 0.5% |
| 4 | Smallest Common Region Array, Hash Table, String, Tree, Depth-First Search, Breadth-First Search | Medium | 85 | 0.7% |
| 5 | Palindrome Pairs Array, Hash Table, String, Trie, Hash Function | Hard | 85 | 0.4% |
| 6 | Maximum Candies You Can Get from Boxes Array, Breadth-First Search, Graph Theory | Hard | 84 | 0.7% |
| 7 | Pour Water Array, Simulation | Medium | 79 | 0.5% |
| 8 | Sliding Puzzle Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix | Hard | 78 | 0.7% |
| 9 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 76 | 0.7% |
| 10 | Intersection of Two Linked Lists Hash Table, Linked List, Two Pointers | Easy | 76 | 0.6% |
| 11 | Design Excel Sum Formula Array, Hash Table, String, Graph Theory, Design, Topological Sort, Matrix | Hard | 76 | 0.4% |
| 12 | Alien Dictionary Array, String, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Hard | 75 | 0.4% |
| 13 | Contains Duplicate II Array, Hash Table, Sliding Window | Easy | 73 | 0.5% |
| 14 | Two Sum Array, Hash Table | Easy | 71 | 0.6% |
| 15 | Add Two Numbers Linked List, Math, Recursion | Medium | 71 | 0.5% |
| 16 | Simple Bank System Array, Hash Table, Design, Simulation | Medium | 71 | 0.7% |
| 17 | Word Search II Array, String, Backtracking, Trie, Matrix | Hard | 71 | 0.4% |
| 18 | IP to CIDR String, Bit Manipulation | Medium | 71 | 0.5% |
| 19 | Employee Free Time Array, Sweep Line, Sorting, Heap (Priority Queue) | Hard | 71 | 0.7% |
| 20 | Cheapest Flights Within K Stops Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 71 | 0.4% |
| 21 | Regular Expression Matching String, Dynamic Programming, Recursion | Hard | 69 | 0.3% |
| 22 | Valid Parentheses String, Stack | Easy | 69 | 0.4% |
| 23 | Merge k Sorted Lists Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard | 69 | 0.6% |
| 24 | Minimize Rounding Error to Meet Target Array, Math, String, Greedy, Sorting | Medium | 69 | 0.5% |
| 25 | Convert to Base -2 Math | Medium | 69 | 0.6% |
| 26 | Design File System Hash Table, String, Design, Trie | Medium | 69 | 0.7% |
| 27 | Convert Sorted Array to Binary Search Tree Array, Divide and Conquer, Tree, Binary Search Tree, Binary Tree | Easy | 69 | 0.8% |
| 28 | Single Number Array, Bit Manipulation | Easy | 69 | 0.8% |
| 29 | Reverse Bits Divide and Conquer, Bit Manipulation | Easy | 69 | 0.7% |
| 30 | House Robber Array, Dynamic Programming | Medium | 69 | 0.5% |
| 31 | Happy Number Hash Table, Math, Two Pointers | Easy | 69 | 0.6% |
| 32 | Contains Duplicate Array, Hash Table, Sorting | Easy | 69 | 0.6% |
| 33 | Contains Duplicate III Array, Sliding Window, Sorting, Bucket Sort, Ordered Set | Hard | 69 | 0.2% |
| 34 | Maximal Square Array, Dynamic Programming, Matrix | Medium | 69 | 0.5% |
| 35 | Basic Calculator II Math, String, Stack | Medium | 69 | 0.5% |
| 36 | Number of Ways to Build House of Cards Math, Dynamic Programming | Medium | 69 | 0.6% |
| 37 | Mini Parser String, Stack, Depth-First Search | Medium | 69 | 0.4% |
| 38 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix | Hard | 69 | 0.7% |
| 39 | Add Strings Math, String, Simulation | Easy | 69 | 0.5% |
| 40 | Robot Bounded In Circle Math, String, Simulation | Medium | 69 | 0.6% |
| 41 | Minimum Number of Vertices to Reach All Nodes Graph Theory | Medium | 69 | 0.8% |
| 42 | Strings Differ by One Character Hash Table, String, Rolling Hash, Hash Function | Medium | 69 | 0.4% |
| 43 | Pyramid Transition Matrix Hash Table, String, Backtracking, Bit Manipulation | Medium | 69 | 0.6% |
| 44 | Combination Sum Array, Backtracking | Medium | 67 | 0.8% |
| 45 | Shortest Uncommon Substring in an Array Array, Hash Table, String, Trie | Medium | 67 | 0.5% |
| 46 | Minimum Window Substring Hash Table, String, Sliding Window | Hard | 65 | 0.5% |
| 47 | Shopping Offers Array, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask | Medium | 65 | 0.5% |
| 48 | Design Tic-Tac-Toe Array, Hash Table, Design, Matrix, Simulation | Medium | 55 | 0.6% |
| 49 | Subarray Product Less Than K Array, Binary Search, Sliding Window, Prefix Sum | Medium | 55 | 0.5% |
| 50 | Accounts Merge Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting | Medium | 55 | 0.6% |
| 51 | Shortest Path to Get All Keys Array, Bit Manipulation, Breadth-First Search, Matrix | Hard | 50 | 0.5% |
| 52 | All O`one Data Structure Hash Table, Linked List, Design, Doubly-Linked List | Hard | 44 | 0.4% |
| 53 | Time Based Key-Value Store Hash Table, String, Binary Search, Design | Medium | 36 | 0.5% |
| 54 | Shortest Path in Binary Matrix Array, Breadth-First Search, Matrix | Medium | 36 | 0.5% |
| 55 | Making A Large Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Hard | 36 | 0.6% |
| 56 | Can Place Flowers Array, Greedy | Easy | 36 | 0.3% |
| 57 | Nth Digit Math, Binary Search | Medium | 36 | 0.4% |
| 58 | Maximum Subarray Array, Divide and Conquer, Dynamic Programming | Medium | 36 | 0.5% |
| 59 | Minimum Window Subsequence String, Dynamic Programming, Sliding Window | Hard | 36 | 0.4% |
| 60 | Consecutive Numbers Sum Math, Enumeration | Hard | 36 | 0.4% |
| 61 | Minimum Cost to Reach Destination in Time Array, Dynamic Programming, Graph Theory | Hard | 36 | 0.4% |
| 62 | Flatten Nested List Iterator Stack, Tree, Depth-First Search, Design, Queue, Iterator | Medium | 36 | 0.7% |
| 63 | Detonate the Maximum Bombs Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometry | Medium | 36 | 0.5% |
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.