Expedia coding interview
questions, leaked.
49 problems reported across recent Expedia interviews. Top patterns: array, string, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Expedia's online assessment hits you with 49 problems across arrays, strings, and hash tables. Most are medium difficulty, which means you'll face tighter time pressure and fewer gimmes than you'd expect. Arrays dominate the problem set (26 out of 49), followed by strings and hash tables. Two-pointers, sliding windows, and binary search show up constantly as modifiers to array problems. If you freeze mid-OA on a sliding-window or greedy array problem, StealthCoder runs invisibly behind your screen and surfaces the solution in seconds. You need to walk in knowing the core patterns cold.
Top problems at Expedia
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Find the Smallest Divisor Given a Threshold | MEDIUM | 100.0 | 64% | Array · Binary Search |
| 02 | Minimum Swaps to Group All 1's Together | MEDIUM | 97.7 | 61% | Array · Sliding Window |
| 03 | The kth Factor of n | MEDIUM | 97.7 | 70% | Math · Number Theory |
| 04 | Valid Triangle Number | MEDIUM | 97.7 | 52% | Array · Two Pointers · Binary Search |
| 05 | Minimum Replacements to Sort the Array | HARD | 95.2 | 53% | Array · Math · Greedy |
| 06 | Unique Substrings With Equal Digit Frequency | MEDIUM | 95.2 | 64% | Hash Table · String · Rolling Hash |
| 07 | The Earliest Moment When Everyone Become Friends | MEDIUM | 95.2 | 66% | Array · Union Find · Sorting |
| 08 | String Compression | MEDIUM | 95.2 | 58% | Two Pointers · String |
| 09 | Rearrange Words in a Sentence | MEDIUM | 95.2 | 66% | String · Sorting |
| 10 | Divide Players Into Teams of Equal Skill | MEDIUM | 95.2 | 69% | Array · Hash Table · Two Pointers |
| 11 | Most Visited Sector in a Circular Track | EASY | 95.2 | 59% | Array · Simulation |
| 12 | Number of Good Binary Strings | MEDIUM | 95.2 | 52% | Dynamic Programming |
| 13 | Break a Palindrome | MEDIUM | 95.2 | 52% | String · Greedy |
| 14 | Valid Word | EASY | 95.2 | 39% | String |
| 15 | Minimum One Bit Operations to Make Integers Zero | HARD | 95.2 | 73% | Dynamic Programming · Bit Manipulation · Memoization |
| 16 | Valid Parentheses | EASY | 85.9 | 42% | String · Stack |
| 17 | Remove Duplicate Letters | MEDIUM | 81.9 | 51% | String · Stack · Greedy |
| 18 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | MEDIUM | 71.3 | 70% | Dynamic Programming · Graph · Shortest Path |
| 19 | Best Time to Buy and Sell Stock | EASY | 71.3 | 55% | Array · Dynamic Programming |
| 20 | Capacity To Ship Packages Within D Days | MEDIUM | 71.3 | 72% | Array · Binary Search |
| 21 | Minimum Number of Swaps to Make the String Balanced | MEDIUM | 71.3 | 78% | Two Pointers · String · Stack |
| 22 | Longest Substring Without Repeating Characters | MEDIUM | 71.3 | 37% | Hash Table · String · Sliding Window |
| 23 | Trapping Rain Water | HARD | 71.3 | 65% | Array · Two Pointers · Dynamic Programming |
| 24 | Set Matrix Zeroes | MEDIUM | 71.3 | 61% | Array · Hash Table · Matrix |
| 25 | Group Anagrams | MEDIUM | 71.3 | 71% | Array · Hash Table · String |
| 26 | Roman to Integer | EASY | 63.8 | 65% | Hash Table · Math · String |
| 27 | Number of Islands | MEDIUM | 63.8 | 62% | Array · Depth-First Search · Breadth-First Search |
| 28 | Jump Game II | MEDIUM | 63.8 | 42% | Array · Dynamic Programming · Greedy |
| 29 | House Robber | MEDIUM | 63.8 | 52% | Array · Dynamic Programming |
| 30 | Max Consecutive Ones III | MEDIUM | 63.8 | 66% | Array · Binary Search · Sliding Window |
| 31 | Merge Intervals | MEDIUM | 53.3 | 49% | Array · Sorting |
| 32 | Number of Visible People in a Queue | HARD | 53.3 | 71% | Array · Stack · Monotonic Stack |
| 33 | LRU Cache | MEDIUM | 53.3 | 45% | Hash Table · Linked List · Design |
| 34 | Keys and Rooms | MEDIUM | 53.3 | 75% | Depth-First Search · Breadth-First Search · Graph |
| 35 | Two Sum | EASY | 53.3 | 56% | Array · Hash Table |
| 36 | Add Two Numbers | MEDIUM | 53.3 | 46% | Linked List · Math · Recursion |
| 37 | Subarray Sums Divisible by K | MEDIUM | 53.3 | 56% | Array · Hash Table · Prefix Sum |
| 38 | Least Number of Unique Integers after K Removals | MEDIUM | 53.3 | 63% | Array · Hash Table · Greedy |
| 39 | Count Number of Pairs With Absolute Difference K | EASY | 53.3 | 85% | Array · Hash Table · Counting |
| 40 | Reverse Linked List | EASY | 53.3 | 79% | Linked List · Recursion |
| 41 | Permutation in String | MEDIUM | 53.3 | 47% | Hash Table · Two Pointers · String |
| 42 | Rotting Oranges | MEDIUM | 53.3 | 57% | Array · Breadth-First Search · Matrix |
| 43 | Minimum Number of Chairs in a Waiting Room | EASY | 53.3 | 78% | String · Simulation |
| 44 | Merge Sorted Array | EASY | 53.3 | 53% | Array · Two Pointers · Sorting |
| 45 | Longest Increasing Subsequence | MEDIUM | 53.3 | 58% | Array · Binary Search · Dynamic Programming |
| 46 | Reformat Date | EASY | 53.3 | 67% | String |
| 47 | Find the Index of the First Occurrence in a String | EASY | 53.3 | 45% | Two Pointers · String · String Matching |
| 48 | Climbing Stairs | EASY | 53.3 | 54% | Math · Dynamic Programming · Memoization |
| 49 | Degree of an Array | EASY | 53.3 | 57% | Array · Hash Table |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Expedia OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoder- array26 · 53%
- string15 · 31%
- hash table13 · 27%
- dynamic programming9 · 18%
- two pointers8 · 16%
- sorting8 · 16%
- greedy7 · 14%
- stack5 · 10%
- binary search5 · 10%
- math5 · 10%
The difficulty distribution is deceptive. Only 14 problems are easy; 31 are medium, 4 are hard. That's a 63 percent medium base, which means the assessment is designed to stress-test pattern recognition under time limits, not raw coding speed. Arrays are the backbone of Expedia's assessment. Study sliding-window subproblems (like Minimum Swaps to Group All 1's Together), two-pointer tactics (Valid Triangle Number), and greedy array manipulation (Minimum Replacements to Sort the Array). Strings and hash tables come second. Dynamic programming appears less often but shows up on hard problems, so it's a lower-priority drill unless you're aiming for the outlier. If you hit a wall on an unfamiliar greedy or DP variant during the live assessment, StealthCoder is your safety net, solving it invisible to the proctor while you stay calm.
Companies with similar patterns
If you prepped for Expedia, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Expedia.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Expedia interview FAQ
How many array problems should I solve before the assessment?+
Array problems make up more than half of Expedia's assessment (26 of 49). Drill at least 20 to 25 array patterns, prioritizing sliding window, two-pointers, and binary search variants. You can't avoid arrays here. Spend 60 percent of your prep time on them.
Is dynamic programming a must-know for Expedia?+
DP appears 9 times across the problem set, mostly on harder problems. It's not primary. If you're solid on arrays, strings, and hash tables, DP can be your final 10 to 15 percent of prep. Skip deep DP optimization unless you're targeting a strong performance.
What string problems should I focus on?+
String problems (15 total) often combine with hash tables or two-pointers. Problems like String Compression and Rearrange Words in a Sentence test string iteration and manipulation. Drill string reversal, character frequency counting, and pointer-based traversal. Don't overthink regex or parsing.
How should I structure my week of prep?+
Days 1 to 3: arrays and sliding window (Minimum Swaps to Group All 1's Together, Valid Triangle Number). Days 4 to 5: strings and hash tables. Days 6 to 7: greedy, two-pointers, and binary search edge cases. Run through 3 to 4 full mock assessments in your final two days.
Should I worry about monotonic stack or union find?+
Monotonic stack appears 3 times; union find once. Both are low-frequency. If you see a stack problem during your prep, learn it, but don't spend hours on it. Expedia's assessment leans on array and string fundamentals, not exotic data structures.