61 curated coding interview questions directly asked in Airbnb technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 631 | Design Excel Sum Formula | Hard | Arrays; Design | Sorting / Prefix / Scan; Data Structure Design | 39.7% | 100.0% | 30d |
| 3076 | Shortest Uncommon Substring in an Array | Medium | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS | 50.6% | 100.0% | 30d |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 100.0% | 3m |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 100.0% | all |
| 721 | Accounts Merge | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 87.5% | 3m |
| 1298 | Maximum Candies You Can Get from Boxes | Hard | Arrays | Sorting / Prefix / Scan | 67.5% | 87.5% | 3m |
| 638 | Shopping Offers | Medium | Core DSA | Implementation / Reasoning | 52.5% | 87.5% | 3m |
| 251 | Flatten 2D Vector | Medium | Core DSA | Implementation / Reasoning | 50.5% | 87.5% | all |
| 336 | Palindrome Pairs | Hard | Strings | Hashing / Sliding Window | 37.2% | 87.5% | all |
| 1257 | Smallest Common Region | Medium | Core DSA | Implementation / Reasoning | 68.3% | 75.0% | 3m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 75.0% | all |
| 10 | Regular Expression Matching | Hard | Core DSA | Implementation / Reasoning | 31.0% | 75.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 75.0% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 75.0% | all |
| 1058 | Minimize Rounding Error to Meet Target | Medium | Core DSA | Implementation / Reasoning | 45.9% | 75.0% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 75.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 75.0% | all |
| 1017 | Convert to Base -2 | Medium | Core DSA | Implementation / Reasoning | 61.9% | 75.0% | all |
| 1166 | Design File System | Medium | Design | Data Structure Design | 65.1% | 75.0% | all |
| 108 | Convert Sorted Array to Binary Search Tree | Easy | Arrays; Trees; Binary Search | Sorting / Prefix / Scan; DFS / BFS; Binary Search | 75.6% | 75.0% | all |
| 2043 | Simple Bank System | Medium | Core DSA | Implementation / Reasoning | 69.7% | 75.0% | all |
| 136 | Single Number | Easy | Core DSA | Implementation / Reasoning | 77.7% | 75.0% | all |
| 190 | Reverse Bits | Easy | Core DSA | Implementation / Reasoning | 68.4% | 75.0% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 75.0% | all |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 75.0% | all |
| 212 | Word Search II | Hard | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 38.5% | 75.0% | all |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 75.0% | all |
| 219 | Contains Duplicate II | Easy | Arrays | Sorting / Prefix / Scan | 51.3% | 75.0% | all |
| 220 | Contains Duplicate III | Hard | Arrays | Sorting / Prefix / Scan | 24.8% | 75.0% | all |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 75.0% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 75.0% | all |
| 269 | Alien Dictionary | Hard | Graphs | BFS / DFS / Topological Sort | 37.2% | 75.0% | all |
| 2189 | Number of Ways to Build House of Cards | Medium | Core DSA | Implementation / Reasoning | 62.9% | 75.0% | all |
| 385 | Mini Parser | Medium | Core DSA | Implementation / Reasoning | 42.6% | 75.0% | all |
| 1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | Hard | Arrays | Sorting / Prefix / Scan | 72.7% | 75.0% | all |
| 415 | Add Strings | Easy | Strings | Hashing / Sliding Window | 52.2% | 75.0% | all |
| 1041 | Robot Bounded In Circle | Medium | Core DSA | Implementation / Reasoning | 56.5% | 75.0% | all |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 81.6% | 75.0% | all |
| 1554 | Strings Differ by One Character | Medium | Strings | Hashing / Sliding Window | 39.8% | 75.0% | all |
| 751 | IP to CIDR | Medium | Core DSA | Implementation / Reasoning | 53.6% | 75.0% | all |
| 755 | Pour Water | Medium | Core DSA | Implementation / Reasoning | 49.1% | 75.0% | all |
| 756 | Pyramid Transition Matrix | Medium | Arrays | Sorting / Prefix / Scan | 60.6% | 75.0% | all |
| 759 | Employee Free Time | Hard | Core DSA | Implementation / Reasoning | 72.9% | 75.0% | all |
| 773 | Sliding Puzzle | Hard | Core DSA | Implementation / Reasoning | 74.4% | 75.0% | all |
| 787 | Cheapest Flights Within K Stops | Medium | Heap | Priority Queue | 41.8% | 75.0% | all |
| 1928 | Minimum Cost to Reach Destination in Time | Hard | Arrays | Sorting / Prefix / Scan | 41.6% | 62.5% | 6m |
| 160 | Intersection of Two Linked Lists | Easy | Linked List | Two Pointers | 63.7% | 62.5% | 6m |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 62.5% | all |
| 348 | Design Tic-Tac-Toe | Medium | Design | Data Structure Design | 58.7% | 50.0% | all |
| 864 | Shortest Path to Get All Keys | Hard | Core DSA | Implementation / Reasoning | 54.6% | 50.0% | all |
| 713 | Subarray Product Less Than K | Medium | Arrays | Sorting / Prefix / Scan | 54.3% | 50.0% | all |
| 432 | All O`one Data Structure | Hard | Core DSA | Implementation / Reasoning | 44.3% | 50.0% | all |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 37.5% | all |
| 1091 | Shortest Path in Binary Matrix | Medium | Arrays | Sorting / Prefix / Scan | 51.5% | 37.5% | all |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 37.5% | all |
| 605 | Can Place Flowers | Easy | Core DSA | Implementation / Reasoning | 29.1% | 37.5% | all |
| 400 | Nth Digit | Medium | Core DSA | Implementation / Reasoning | 38.2% | 37.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 37.5% | all |
| 727 | Minimum Window Subsequence | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 43.8% | 37.5% | all |
| 829 | Consecutive Numbers Sum | Hard | Arrays | Sorting / Prefix / Scan | 42.7% | 37.5% | all |