Expedia Coding Interview Questions
31 Expedia coding interview problems with full optimal solutions — 19 easy, 11 medium, 1 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Expedia interviewer values, and a FAQ section.
Showing 11 problems of 31
- #19mediumfoundational
19. Number of Islands
Count connected land masses in a grid — Expedia applies the same BFS/DFS region-counting logic when clustering geographically adjacent hotel markets into a single search region.
- #20mediumfoundational
20. Network Delay Time
Find the time for a signal to reach all nodes from a source — Expedia uses the same Dijkstra logic to compute earliest-arrival flight connections across their global route graph.
- #21mediumfoundational
21. Meeting Rooms II
Find the minimum number of rooms to hold all meetings — the same min-heap interval logic Expedia uses to determine the minimum hotel inventory needed to cover overlapping check-in/check-out windows.
- #22mediumfoundational
22. Coin Change
Find the fewest coins to reach a target amount — Expedia's dynamic-pricing engine applies the same bottom-up DP when assembling minimum-cost fare combinations from discrete price buckets.
- #23mediumfoundational
23. Top K Frequent Elements
Return the k most frequent elements — Expedia's search-ranking pipeline uses the same frequency-heap pattern to surface the top-k destinations by booking volume without sorting the full catalog.
- #24mediumfoundational
24. Group Anagrams
Cluster strings that are anagrams of each other — Expedia applies the same canonical-key grouping to cluster airport code aliases and alternate-spelling city names into a single inventory bucket.
- #25mediumfoundational
25. Non-overlapping Intervals
Find the minimum number of intervals to remove so none overlap — Expedia uses this greedy pruning to eliminate conflicting layover windows when building the tightest valid itinerary.
- #26mediumfoundational
26. Cheapest Flights Within K Stops
Find the cheapest flight from src to dst with at most k stops — this is one of Expedia's most direct algorithm-to-product problems, modeling their core flight search with a layover constraint.
- #27mediumfoundational
27. Merge Intervals
Merge all overlapping intervals into the fewest continuous ranges — Expedia applies this to consolidate adjacent layover windows in an itinerary into a single unbroken block.
- #29mediumfoundational
29. Word Break
Determine whether a string can be segmented into dictionary words — Expedia applies this DP to validate that a raw destination-name string can be cleanly decomposed into known city and region tokens.
- #31mediumfoundational
31. Course Schedule
Detect whether a set of task dependencies contains a cycle — Expedia's booking-pipeline team uses the same topological-sort check to verify that booking-step dependencies never create a deadlock.