DSA Doctor
Verified Company Vault
Expedia DSA Interview Questions
59 curated coding interview questions directly asked in Expedia technical rounds, sorted by frequency with recency and difficulty diagnostics.
59
Total Questions
13 (22%)
Easy Problems
38 (64%)
Medium Problems
8 (14%)
Hard Problems
🔥 Most Tested Topics:
Strings (22)Arrays (17)Core DSA (12)Trees (6)Stack / Queue (3)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 724 | Find Pivot Index | Easy | Core DSA | Implementation / Reasoning | 62.7% | 100.0% | 3m |
| 1962 | Remove Stones to Minimize the Total | Medium | Core DSA | Implementation / Reasoning | 65.7% | 100.0% | 3m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 100.0% | 3m |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 100.0% | 3m |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 100.0% | 3m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 100.0% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | 3m |
| 895 | Maximum Frequency Stack | Hard | Arrays; Stack / Queue | Sorting / Prefix / Scan; Monotonic Stack / Simulation | 66.8% | 100.0% | 3m |
| 38 | Count and Say | Medium | Core DSA | Implementation / Reasoning | 62.9% | 100.0% | 6m |
| 1492 | The kth Factor of n | Medium | Heap | Priority Queue | 70.4% | 100.0% | all |
| 611 | Valid Triangle Number | Medium | Strings | Hashing / Sliding Window | 56.9% | 100.0% | all |
| 1101 | The Earliest Moment When Everyone Become Friends | Medium | Core DSA | Implementation / Reasoning | 66.1% | 87.5% | all |
| 1151 | Minimum Swaps to Group All 1's Together | Medium | Arrays | Sorting / Prefix / Scan | 61.2% | 87.5% | all |
| 1328 | Break a Palindrome | Medium | Strings | Hashing / Sliding Window | 51.6% | 87.5% | all |
| 2168 | Unique Substrings With Equal Digit Frequency | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 64.6% | 87.5% | all |
| 3136 | Valid Word | Easy | Strings | Hashing / Sliding Window | 50.9% | 87.5% | all |
| 2366 | Minimum Replacements to Sort the Array | Hard | Arrays | Sorting / Prefix / Scan | 53.1% | 87.5% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 87.5% | all |
| 2491 | Divide Players Into Teams of Equal Skill | Medium | Core DSA | Implementation / Reasoning | 68.9% | 87.5% | all |
| 1451 | Rearrange Words in a Sentence | Medium | Strings | Hashing / Sliding Window | 67.1% | 87.5% | all |
| 2533 | Number of Good Binary Strings | Medium | Strings | Hashing / Sliding Window | 52.9% | 87.5% | all |
| 1560 | Most Visited Sector in a Circular Track | Easy | Core DSA | Implementation / Reasoning | 60.0% | 87.5% | all |
| 1611 | Minimum One Bit Operations to Make Integers Zero | Hard | Arrays | Sorting / Prefix / Scan | 78.4% | 87.5% | all |
| 316 | Remove Duplicate Letters | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 53.2% | 87.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 75.0% | 6m |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 75.0% | 6m |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 75.0% | 6m |
| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Medium | Arrays | Sorting / Prefix / Scan | 41.4% | 75.0% | 6m |
| 695 | Max Area of Island | Medium | Graphs | BFS / DFS / Topological Sort | 74.0% | 75.0% | 6m |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | Core DSA | Implementation / Reasoning | 65.9% | 75.0% | 6m |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 75.0% | all |
| 3168 | Minimum Number of Chairs in a Waiting Room | Easy | Arrays | Sorting / Prefix / Scan | 79.4% | 75.0% | all |
| 3035 | Maximum Palindromes After Operations | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 46.5% | 75.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 62.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 62.5% | all |
| 1944 | Number of Visible People in a Queue | Hard | Stack / Queue | Monotonic Stack / Simulation | 73.1% | 62.5% | all |
| 2062 | Count Vowel Substrings of a String | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 73.2% | 62.5% | all |
| 926 | Flip String to Monotone Increasing | Medium | Strings | Hashing / Sliding Window | 61.9% | 62.5% | all |
| 767 | Reorganize String | Medium | Strings | Hashing / Sliding Window | 57.1% | 62.5% | all |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 78.0% | 50.0% | all |
| 28 | Find the Index of the First Occurrence in a String | Easy | Strings | Hashing / Sliding Window | 46.7% | 50.0% | all |
| 697 | Degree of an Array | Easy | Arrays | Sorting / Prefix / Scan | 58.4% | 50.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 50.0% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 50.0% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | all |
| 255 | Verify Preorder Sequence in Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 51.8% | 50.0% | all |
| 230 | Kth Smallest Element in a BST | Medium | Trees; Heap | DFS / BFS; Priority Queue | 76.8% | 50.0% | all |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 50.0% | all |
| 787 | Cheapest Flights Within K Stops | Medium | Heap | Priority Queue | 41.8% | 50.0% | all |
| 1413 | Minimum Value to Get Positive Step by Step Sum | Easy | Arrays | Sorting / Prefix / Scan | 64.7% | 50.0% | all |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 50.0% | all |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 50.0% | all |
| 532 | K-diff Pairs in an Array | Medium | Arrays | Sorting / Prefix / Scan | 45.9% | 50.0% | all |
| 1507 | Reformat Date | Easy | Core DSA | Implementation / Reasoning | 68.5% | 50.0% | all |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | Arrays | Sorting / Prefix / Scan | 39.0% | 50.0% | all |
| 98 | Validate Binary Search Tree | Medium | Strings; Trees; Binary Search | Hashing / Sliding Window; DFS / BFS; Binary Search | 35.8% | 50.0% | all |