Expedia · OA → Onsite
In processExpedia New Grad SDE Interviews: 20 Experiences (Part 1 of 3)
Expedia new grad SDE hiring, 2025–2026: a HackerRank OA with two coding questions, then mixed finals of easy/medium coding plus about 20 minutes of BQs.
At a glance
- Process: HackerRank OA (two coding questions, sometimes with multiple-choice) → two or more interviews that mix coding and behavioral questions (entries 01–04).
- Asked recently: Jump Game, integer to Roman, bracket-swap and binary-window tasks for a fresher (entry 01); increasing stock periods and equal-frequency subsequences in a mobile OA (entry 04).
- Difficulty: finals were easy/medium with an extensibility follow-up (entry 02); a UK OA had two medium/hard questions that were hard to finish in time (entry 03).
- Practise first: Count Increasing Stock Periods, Count Equal-Frequency Subsequences and Shortest Substring with Exactly K Ones.
Coverage: 11 new grad, fresher and campus reports. Current: 4 reports from March 2025 to about October 2026 (SDE-I, full-time new grad SDE, UK new grad, graduate mobile). History: 7 reports from 2021–2022, including several campus loops and one in Shenzhen.
In this series: Part 1 (current) · Part 2 · Part 3
What came up
All four current reports describe coding, usually two questions per stage, and two describe behavioral questions inside the technical rounds. Strings and arrays are the common thread.
| Topic | Reports | Last seen |
|---|---|---|
| Algorithm coding | 4 of 4 | Oct 2026 (report date, approximate) |
| Behavioral or project discussion in technical rounds | 2 of 4 | Oct 2026 (report date, approximate) |
| Strings and sliding windows | 2 of 4 | Oct 2026 (report date, approximate) |
| Dynamic programming or graphs | 2 of 4 | Jan 2026 (report date) |
| Code extensibility and design patterns | 1 of 4 | Jun 2026 (report date) |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Jump Game | 1 | Oct 2026 (report date, approximate) |
| Integer to Roman numerals | 1 | Oct 2026 (report date, approximate) |
| Minimum swaps to make a bracket sequence regular | 1 | Oct 2026 (report date, approximate) |
| Shortest window of a binary string with K ones (closest practice) | 1 | Oct 2026 (report date, approximate) |
| Count increasing stock periods | 1 | Mar 2025 (report date) |
| Count equal-frequency subsequences | 1 | Mar 2025 (report date) |
4 detailed candidate timelines
01: a fresher campus loop with four named tasks
Report date: about September–October 2026 · Role: SDE-I, fresher · Result: Rejected
Technical round 1
- Jump Game, and converting an integer to a Roman numeral string.
- CV, project and HR discussion (prompts not shared).
Technical round 2
- The minimum swaps to make a bracket sequence regular (adjacent or arbitrary swaps not stated).
- The shortest window of a binary string containing K ones (exactly or at least K not stated); closest FastPrep version: Shortest Substring with Exactly K Ones.
02: two mixed finals, with time for extensibility
Report date: June 28, 2026 · Role: Full-time new grad SDE · Applied: careers site · Result: Not stated
Final interviews
- Two mixed rounds, each about 40 minutes of one or two easy/medium coding tasks on HackerRank, then about 20 minutes of behavioral questions.
- The interviewer asked how the just-written code could be made more extensible, including design-pattern ideas. The candidate used STAR (situation, task, action, result) for the behavioral answers.
03: a UK new grad OA under time pressure
Report date: January 16, 2026 · Role: New grad software engineering · Location: UK · Result: Not stated
Online assessment
- Two medium/hard coding questions, the second on graph theory; the candidate struggled to finish in time and could not recall the prompts.
04: a graduate mobile OA with two coding tasks
Report date: March 18, 2025 · Role: Mobile Engineering, graduate · Applied: online · Result: No next step after a month
Online assessment (two coding questions, six multiple-choice questions)
- Count Increasing Stock Periods: given
stockPricesandk, count the strictly increasing subarrays of k months (sliding window; "exactly k" is the FastPrep reading). - Count Equal-Frequency Subsequences: count the subsequences of
wordin which every character appears the same number of times, modulo 10^9+7 (dynamic programming). - A month later one question was still three tests short and no next step had come. Another commenter said they had just received the same two questions.
Common questions
What is on the Expedia new grad OA?
Two coding questions on HackerRank, sometimes with multiple-choice: a sliding-window and a DP task in a 2025 mobile OA (entry 04), and two medium/hard questions including graph theory in a UK OA (entry 03).
What are the Expedia new grad final interviews like?
Two mixed rounds, each about 40 minutes of easy/medium coding and 20 minutes of behavioral, with a follow-up on making the code extensible (entry 02).
What coding questions does Expedia ask freshers?
Jump Game, integer to Roman, minimum bracket swaps and a shortest binary window with K ones (entry 01).
History (before 2023)
Seven reports from 2021–2022. They stay out of the counts and tables above.
H05: a December final with Two Sum, then rejection
Interview date: December 2022 · Role: New grad · Result: Rejected
- Three new grad OAs, none harder than medium. The final named Two Sum and three other easy questions (not named).
H06: an offer after two hour-long mixed interviews
Interview date: about late October 2022 · Role: New grad · Result: Offer
- HackerRank OA; two to three weeks' wait.
- Final 1: Two Sum (quadratic and hash-map approaches), String Compression, and a disagreement with a boss.
- Final 2: "Partition Sub Sums, a linked list problem" (unclear whether one or two tasks; practice: Partition Equal Subset Sum), and a queue with pop and pop_back (Deque Operations); experience and boss-disagreement questions again.
H07: a September campus loop with five live coding tasks
Interview date: September 2022 · Role: Campus SDE-I, fresher · Result: Selected
- 45-minute psychometric test, then a 90-minute HackerRank OA with six MCQs (OS, OOP) and two unnamed coding questions.
- Two in-person interviews (75 minutes together): Longest Substring Without Repeating Characters, Triangle Minimum Path Sum, Add Two Numbers as linked lists, Merge Two Sorted Lists and Coin Change; sorting complexities and data structures; projects and responsibilities.
H08: a three-hour OA, then two coding calls and behavioral
Interview date: June–July 2022 · Role: SDE-I, fresher, off campus · Result: Selected
- 180-minute OA with Java MCQs, including Knight Survival Probability: the chance a knight stays on an N×N board after K random moves.
- Two 50-minute DSA calls: Binary Tree to Doubly Linked List (recursion), Find Duplicates in an Array with values 0 to N−1, Remove a Character, and rearranging a string so neighbors differ (max heap of counts).
- 50-minute behavioral: conflict, learning more than expected, internships, keeping up with technology.
H09: a career changer explaining two school projects
Report date: April 9, 2022 · Role: New grad software engineering · Applied: Handshake · Result: Offer
- A candidate moving from bar management into software explained their capstone and a second software project and what they learned; no algorithm question was named.
H10: three Shenzhen campus interviews on one day
Report date: January 25, 2022 · Role: Campus SDE · Location: Shenzhen · Result: Offer
- An easy HackerRank OA, then three 45-minute interviews the same day: English behavioral with a PM, then OOD and algorithms in Chinese, plus résumé talk. Expedia first gave one day to decide on the offer.
H11: a 2021 loop with separate DSA, LLD and behavioral
Interview date: 2021 · Role: New grad SDE-I · Result: Selected
- 100-minute HackerRank OA: an easy hash-map task and a hard DP/bit-manipulation task, plus ten MCQs.
- DSA (45 minutes, done in about 20): Climbing Stairs and an easy string question.
- LLD (45 minutes): implement classes for an undisclosed system; a ten-minute network drop left it incomplete.
- Behavioral (about 30 minutes); selection email two days later.
Keep practicing
- Current OA problems: Count Increasing Stock Periods and Count Equal-Frequency Subsequences (entry 04); Shortest Substring with Exactly K Ones (entry 01).
- From History: Two Sum (H05, H06), Knight Survival Probability (H08), Coin Change (H07) and the other problems linked in H06–H11.
- Expedia question bank: algorithms (sign-in needed).
- Everything Expedia in one place: the Expedia interview page and Expedia hiring insights.
- More firsthand reports: the Experience feed.
In this series: Part 1 (current) · Part 2 · Part 3
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.