Expedia Intern Finals Before 2020: 14 Experiences (Part 6 of 6)
- Company
- Expedia
- Reports
- 14 interview reports
- Level
- Internship
- Stages
- OA → Phone screen → Onsite
Expedia intern final rounds before 2020: long India campus days with puzzles and CS theory, and US on-site days of three or four interviews in Bellevue.
At a glance
- US and UK: in 2012–2014, candidates had three or four interviews in Bellevue (118, 119, 120); in 2019 interviews ran by webcam or video (113, 114), and 115 had an automated round and three 45-minute live interviews.
- India: all six were campus drives with two or three interviews; four ended with an HR round, once with a director (121, 123, 125, 126). Interviews often ran about an hour and mixed coding with puzzles and CS theory.
Coverage: Expedia Group software engineering interns (software engineer, software developer and SDE intern titles). Final rounds, with a line on the screening steps before them. India (campus drives, including a Delhi college), Bellevue, Seattle and Madison in the US, and London. Reports dated August 2012 to December 2019.
In this series
- Part 1: 2024–2025 reports and the overview — the current final round in the US, UK, Canada and India, plus three mobile intern finals (entries 01–28)
- Part 2: 2023 — US and UK finals of two interviews, and India campus finals mixing DSA with HR questions (entries 29–45)
- Part 3: 2022 — the year the US final went from three interviews with design to two coding interviews, plus India campus finals (entries 46–60)
- Part 4: 2021 — three-interview US finals, many with a design round around a map or travel app, India finals, and one Shenzhen loop (entries 61–88)
- Part 5: 2020 — India finals of one to three interviews, mostly by video, and US finals that often included design (entries 89–112)
- Part 6 (current): 2012–2019
The final round before 2020
US and UK (reports 113–120). In 2019 interviews ran by webcam or video (113, 114), and 115 had an automated round and three 45-minute live interviews. In 2012–2014, 118 and 119 describe a campus interview first, and 118, 119 and 120 then had three or four interviews in Bellevue. In 2017 one intern had a single video interview, and heard that some others had on-sites (117).
India (reports 121–126). All six are campus drives whose final round was two or three interviews; four of the six describe a final HR round, once with a director (121, 123, 125, 126). Interviews often ran about an hour (123, 125; 123's first lasted up to 90 minutes) and mixed coding with puzzles and CS theory.
What came up
The India campus reports from 2018 and 2019 carry most of the detail here, so CS theory is the most common technical topic. Behavioral questions came up in 10 of the 14 final rounds.
| Topic | Reports | Last seen |
|---|---|---|
| Behavioral questions in the final round | 10 of 14 | Dec 2019 (report date) |
| CS fundamentals (OOP, OS, networks, databases, Java) | 7 of 14 | Sep 2019 |
| Résumé and project discussion | 6 of 14 | Sep 2019 |
| Arrays and hashing (including hash maps by hand) | 5 of 14 | Sep 2019 |
| Coding problems not named | 3 of 14 | Dec 2019 (report date) |
| Math, geometry and counting | 3 of 14 | Sep 2019 |
| Linked lists | 3 of 14 | Aug 2019 (approximate) |
| Object-oriented design (library, human body, OOP) | 3 of 14 | about mid-2018 |
| Dynamic programming | 2 of 14 | Sep 2019 |
| Bit tricks (XOR, runs of 1s) | 2 of 14 | Aug 2019 (approximate) |
| Grids (islands, rotting oranges, largest square) | 2 of 14 | Sep 2018 (report date) |
| Graphs | 2 of 14 | Sep 2018 (report date) |
| Puzzles | 2 of 14 | Sep 2018 (report date) |
| Machine learning and product judgment | 2 of 14 | Sep 2018 (report date) |
| Elevator problems | 2 of 14 | Sep 2018 (year from the report date) |
| System design (TinyURL) | 1 of 14 | Aug 2019 (approximate) |
| Binary search | 1 of 14 | Sep 2018 (report date) |
| Stacks | 1 of 14 | Sep 2018 (report date) |
| Writing sorting algorithms | 1 of 14 | Sep 2018 (report date) |
| Strings and tries | 1 of 14 | Sep 2018 (year from the report date) |
| Game logic on a grid (tic-tac-toe) | 1 of 14 | Mar 2013 (report date) |
| Trees and BSTs | 1 of 14 | about mid-2018 |
The table counts the final-round interviews of the 14 reports in this part. Questions from the screen before the final round are in the last table below. A candidate can appear in more than one row.
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Implement hashing or your own hash map | 2 | Sep 2019 |
| Add one to a number stored one digit per node | 2 | Aug 2019 (approximate) |
| Climbing stairs (one or two steps) | 1 | Sep 2019 |
| Leaders in an array | 1 | Sep 2019 |
| Josephus problem | 1 | Sep 2019 |
| Reverse a linked list in groups of k | 1 | Aug 2019 (approximate) |
| Reverse a linked list | 1 | Aug 2019 (approximate) |
| Where do two linked lists merge? | 1 | Aug 2019 (approximate) |
| Longest run of 1 bits in a number's binary form | 1 | Aug 2019 (approximate) |
| Position of a target in the sorted order, given a rotated sorted array | 1 | Sep 2018 (report date) |
| Find the Odd-Occurrence Value | 1 | Sep 2018 (report date) |
| Reverse a stack in place | 1 | Sep 2018 (report date) |
| Largest square of 1s in a binary matrix | 1 | Sep 2018 (report date) |
| Rotting oranges | 1 | Sep 2018 (report date) |
| Route with the fewest stops between two cities, given direct flights | 1 | Sep 2018 (report date) |
| Write heapsort and quicksort | 1 | Sep 2018 (report date) |
| Pairs of numbers that are digit reverses of each other | 1 | Sep 2018 (year from the report date) |
| Implement a trie for dictionary lookups | 1 | Sep 2018 (year from the report date) |
| Schedule one elevator to cut total and average waiting time | 1 | Sep 2018 (year from the report date) |
| Secondhand list from one 2018 drive (the candidate or friends): reverse a list in k-groups, implement a hash map, a queue from stacks, rat in a maze, the busiest point among overlapping intervals, unique rows of a binary matrix, is a tree a BST, the missing number from 1 to n+1, the smallest missing positive | 1 | Sep 2018 (year from the report date) |
| Buy day and later sell day with the largest profit (closest practice version) | 1 | Sep 2016 (report date) |
| Count an elevator's stops under people and weight limits | 1 | Sep 2016 (report date) |
| Count the connected groups of 1s in a 0/1 matrix | 1 | Mar 2014 (report date) |
| Intersection of two rectangles | 1 | Mar 2014 (report date) |
| Group a series of data into sub-components (a use case) | 1 | Mar 2014 (report date) |
| n × n tic-tac-toe: can the winner be found in constant time? | 1 | Mar 2013 (report date) |
| Find the middle of a linked list in five ways (closest practice version) | 1 | Aug 2012 (report date) |
| Build a BST from a traversal | 1 | about mid-2018 |
| Ribbons in three colors on tables, no two neighbors the same color | 1 | about mid-2018 |
| Merge Sorted Arrays in Place | 1 | about mid-2018 |
Low-Level Design (LLD/OOD)
| Question | Reports | Last seen |
|---|---|---|
| Draw the design of a library system | 1 | Mar 2013 (report date) |
| Model a human body from parts, with limits like two arms | 1 | about mid-2018 |
System Design
| Question | Reports | Last seen |
|---|---|---|
| Design a URL shortener like TinyURL | 1 | Aug 2019 (approximate) |
Machine learning and product judgment
| Question | Reports | Last seen |
|---|---|---|
| Is a plain average a good rating? Design a better score, then spot a hotel losing its top cook | 1 | Sep 2018 (year from the report date) |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| Tell me about yourself | 5 | Aug 2019 (approximate) |
| Why Expedia? | 3 | Sep 2019 |
| Your strengths as a developer | 1 | Dec 2019 (report date) |
| Describe a time you led a team and ran into conflicting opinions | 1 | Nov 2019 (report date) |
| A conflict with a coworker, and how you resolved it | 1 | Oct 2019 (report date) |
| How well do you work in and lead a team? | 1 | Sep 2019 |
| Describe the most recent time you worked on your own | 1 | Sep 2019 |
| What do an MNC and hard work mean to you? | 1 | Sep 2019 |
| What do you know about our company? | 1 | Sep 2018 (report date) |
| Your future plans | 1 | Sep 2018 (report date) |
| What was hard in your project, and how did you get past it? | 1 | Sep 2016 (report date) |
| Why should we hire you? | 1 | Sep 2016 (report date) |
CS fundamentals
| Question | Reports | Last seen |
|---|---|---|
| The four pillars of OOP with real examples; constructors and chaining; garbage collection; access specifiers; abstract classes; virtual and super | 1 | Sep 2019 |
| Runtime (dynamic) polymorphism; is Java purely object-oriented? | 1 | Sep 2018 (report date) |
| What is hashing, what sits behind a hash map, and how does the C++ STL map work? | 1 | Sep 2018 (report date) |
| Memory addresses and compilers, how a URL is resolved, HTTPS and DNS | 1 | Sep 2018 (report date) |
| Write a valid program that causes a segmentation fault | 1 | Sep 2018 (year from the report date) |
| HashMap internals and collision handling | 1 | Sep 2016 (report date) |
| Costs of data structures, from linked lists up to tries | 1 | Sep 2016 (report date) |
| JavaScript promises, async/await and basic HTML | 1 | about mid-2018 |
Puzzles and other
| Question | Reports | Last seen |
|---|---|---|
| The 10 coins puzzle | 1 | Sep 2018 (report date) |
| Measure 45 minutes with two 60-minute ropes that burn unevenly | 1 | Sep 2018 (report date) |
| The 8 identical balls puzzle | 1 | Sep 2018 (year from the report date) |
Before the final round: online assessment and screening questions
| Question | Reports | Last seen |
|---|---|---|
| Arranging coins: complete staircase rows from n coins | 2 | Sep 2018 (report date) |
| Longest stretch of road no car travels | 2 | Sep 2018 (report date) |
| Count primes up to n | 1 | Aug 2019 (approximate) |
| Merge two strings letter by letter | 1 | Aug 2019 (approximate) |
| Can a preorder sequence come from a BST? | 1 | Sep 2016 (report date) |
| Delete the odd-valued nodes of a linked list | 1 | Sep 2016 (report date) |
14 detailed candidate timelines, loops, and screens
US and UK: 8 timelines
113: Madison, three webcam rounds with screen-shared coding
Report date: Dec 2019 · Role: Software Engineer (Internship) · Location: Madison, WI · Result: No offer
Before the final round: a coding quiz and a recorded interview.
Final round: three webcam interviews
- Personality and behavioral: your strengths as a developer
- General coding with screen sharing.
- Code efficiency with screen sharing.
114: London, a technology director at the end
Report date: Nov 2019 · Role: Software Development Engineer Intern · Location: London, UK · Result: Offer (accepted)
Before the final round: a HackerRank test of 1.5–2 hours.
Final round
- Video interviews, technical and behavioral: a time you led a team and ran into conflicting opinions.
- One-to-one video interview with a senior developer and a technology director.
115: Seattle, three 45-minute live interviews
Report date: Oct 2019 · Role: Software Engineer (Internship) · Location: Seattle, WA · Result: No offer
Before the final round: an automated round with coding and multiple-choice questions.
Final round: three 45-minute live interviews
- Two technical interviews.
- Behavioral interview: a conflict with a coworker and how you resolved it.
The candidate's view is that for an intern, confidence and speed on the easier questions matter.
116: Bellevue, a rescheduled interview
Report date: Feb 2018 · Role: Software Engineer (Internship) · Location: Bellevue, WA · Result: No offer
Before the final round: a HackerRank challenge with two or three easy programs.
Final round
- Technical interview: questions about the résumé and Java. It had to be rescheduled once.
- HR interview, listed after the technical one.
The rejection came three weeks later.
117: Summer 2017 in e-commerce, one video interview
Report date: Sep 3, 2017 · Role: Software development intern (summer 2017; later in e-commerce order management) · Location: Bellevue, WA · Result: Offer
Before the final round: a HackerRank challenge with two easy-to-medium questions about arrays and data structures.
Final round: one video interview with an engineer, booked through a sign-up sheet: background and situational questions and one programming question. The intern didn't finish the code in time and was allowed to send a follow-up afterwards.
This intern later worked on order management in e-commerce. They had heard that some candidates had on-site interviews instead. Their advice is to explain your reasoning step by step.
118: Bellevue headquarters, islands and rectangles
Report date: Mar 2014 · Role: Software Development Engineer Intern · Location: Bellevue, WA · Result: Unclear (an offer within ten days is mentioned, but the outcome is also given as no offer)
Before the final round: a one-on-one whiteboard interview on campus, with simple problems using BST traversal and binary search on a given scenario.
Final round: three interviews at headquarters in Bellevue
Questions the candidate lists, without saying which interview asked them: a use case about grouping a series of data into sub-components (the candidate's tip there: know hash maps well), the rectangle where two rectangles overlap, and count the connected groups of 1s in a 0/1 matrix. They also mention an offer arriving within ten days.
119: Bellevue, databases, tic-tac-toe and a library
Report date: Mar 21, 2013 · Role: Software Development Engineer Intern · Location: Bellevue, WA · Result: No offer
Before the final round: an interview on campus.
Final round at headquarters
- Interview 1 (one hour, conversational): many database questions.
- Interview 2 (one hour, whiteboard): n × n tic-tac-toe: can you tell who won in constant time? The candidate got to an O(1) answer.
- Interview 3 (one hour, OOP design): draw the design for a library.
120: 2012, four interviews and lunch on site
Report date: Aug 27, 2012 · Role: Software Developer Intern · Location: Bellevue, WA · Result: Offer (accepted)
Before the final round: a first round that isn't described.
Final round on site: four interviews, with lunch in between. Expedia paid for lodging and food (up to $75 a day).
One question: find the middle element of a linked list with an odd number of values in five different ways, give the runtime of each and code them; then, what's the fastest way? Closest practice version: middle of a linked list. The interviewers nudged toward answers but kept pushing for more.
India: 6 timelines
121: Campus, an OOP interview and a DSA interview
Interview date: Sep 2019 · Role: Intern (2021 graduating batch) · Location: India (on campus) · Result: Offer
Before the final round: a 90-minute HackerRank test with about 15 multiple-choice questions and three easy-to-medium coding questions on arrays and strings; the candidate solved one and a half.
Final round, technical interview: OOP (30 minutes)
- The four pillars of OOP with real examples, constructors and constructor chaining, garbage collection, how objects behave under inheritance, access specifiers, abstract classes, and the virtual and super keywords.
- Write a program that implements hashing on a two-column 2D array.
Final round, technical interview: DSA (30 minutes)
- Leaders in an array.
- Count the ways to climb to stair n using steps of 1 or 2, then using steps of 1, 2 or 3.
- The Josephus problem.
For each question the candidate gave several solutions, each faster than the last, and was asked to code the best one.
Final round, HR (30–40 minutes)
- Your most comfortable language and why, events on your résumé, and hobbies.
- How well do you work in and lead a team?
- The most recent time you worked on your own.
- Why Expedia? and what do an MNC and hard work mean to you?
122: Campus, linked lists all the way and TinyURL
Interview date: Aug 2019 (approximate) · Role: Intern (2020) · Location: India (on campus) · Result: Not selected for HR
Before the final round: a 90-minute HackerRank OA with counting primes up to n, merging two strings letter by letter and ten multiple-choice questions. About 25 passed.
Final round, technical interview 1
- Introduce yourself, your hobbies, and your favorite data structure. The candidate said linked lists, and the questions followed.
- Reverse a linked list, then in groups of K.
- A number stored one digit per node: add 1 and return the head. The candidate reversed the list, carried the 1 through, and reversed it back. The interviewer asked for special cases; the candidate named all 9s, which needs a new leading node.
About 13 went on.
Final round, technical interview 2
- Introduce yourself again, then questions on the CV.
- Design a URL shortener like TinyURL.
- Do two linked lists meet at some node? A hash set first; asked to use less memory, the candidate moved ahead on the longer list by the length difference and walked both together.
- Longest run of 1s in the binary form of n (14 gives 3).
About 10 were left. The candidate wasn't picked for HR, and heard (secondhand) that the HR round asked where you see yourself in five years and why you want to join. Six were selected.
123: Campus, a long day with a director
Report date: Sep 8, 2018 · Role: Intern · Location: India (on campus) · Result: Offer
Before the final round: a 1.5-hour HackerRank test with arranging coins (binary search timed out on some tests; only the O(1) formula passed), the longest stretch of road no car covers under tight limits, and ten multiple-choice questions.
Final round, technical interview 1 (1–1.5 hours)
- Introduce yourself and share a few things that aren't on your CV.
- A rotated sorted array and a target: return the target's position in the fully sorted order, for left or right rotation. The candidate found the rotation point and then used binary search.
- Runtime (dynamic) polymorphism, whether Java is purely object-oriented, and some OS questions.
- Find the value that appears an odd number of times. The candidate went from two loops to a hash map to XOR; the interviewer then asked for O(1) space and better than O(n) time.
- What is hashing, what data structure sits behind a hash map, how the C++ STL map works, and then design your own hash map.
- Add one to a number stored in a linked list. Follow-up: each node holds several digits and the result must keep that shape (23 → 2 → 349 → 9 becomes 23 → 2 → 350 → 0).
- The 10 coins puzzle.
- Reverse a stack in place: approach, then code.
Final round, technical interview 2 (45–60 minutes)
- Hobbies, then the largest square of 1s in a binary matrix.
- Rotting oranges.
- Memory addresses and compilers, how a URL is resolved, HTTPS, DNS, compiler errors, which sorting algorithms you've used, and then write heapsort and quicksort.
- What do you know about the company?
- Given direct flights such as Delhi–Mumbai and Mumbai–Goa, pick a data structure and find the Delhi-to-Goa route with the fewest stops.
- Measure 45 minutes with two 60-minute ropes that burn unevenly.
Final round, HR round with a director (45–60 minutes)
- The candidate's machine learning projects, validating data for ML, how Amazon's recommendations work, ML features for Amazon, and how ML could improve a tourist's experience. Most of the candidate's projects were in ML, so the director kept the discussion there.
- Your future plans.
Results came a few hours after the last round.
124: Campus, a puzzle, a trie, and ratings and elevators at the end
Interview date: Sep 5, 2018 (year from the report date) · Role: Intern · Location: India (on campus) · Result: Offer
Before the final round: a 90-minute HackerRank test with arranging coins (solved with the positive root of n(n + 1)/2 ≤ coins), the longest stretch of road with no cars (merged intervals, largest gap) and ten multiple-choice questions. 31 of 392 were shortlisted.
Final round, interview 1 (technical and a puzzle)
- Tell me about yourself, for about five minutes.
- The 8 identical balls puzzle.
- Write a syntactically correct program that causes a segmentation fault.
Final round, interview 2 (technical)
- Rate yourself out of 10 on data structures, algorithms and your language.
- Count and print the pairs of numbers that are digit reverses of each other. The example given included 36 and 63 and 18 and 81.
- Look words up in a dictionary efficiently: a hash map first, then a trie written from scratch with insert and search.
Final round, interview 3 (long, design-style; the interviewer seemed strict)
- Is a plain average a good rating, as on Zomato or Uber? The candidate said outliers distort it and suggested regression or classification.
- Many people request floors: schedule an elevator to cut total and average waiting time. The candidate offered SCAN and C-SCAN, was asked for something better, and moved to a greedy approach.
- A hotel loses its best cook and its ratings slide slowly: how could customers tell from the ratings that the cook left?
- Why Expedia? and the candidate's own questions.
Secondhand. The candidate also lists questions that they or friends from the same drive were asked, without saying who got which: a hash map built by hand (described as a favorite), k-group reversal of a linked list, a queue made from stacks, rat in a maze, the busiest point among overlapping intervals, the unique rows of a 0/1 matrix, checking whether a tree is a BST, the missing number from 1 to n+1, and the smallest missing positive. Practice version: k-group reversal.
125: Delhi campus, a human body in classes and ribbons on tables
Interview date: about mid-2018 · Role: Software Intern · Location: Delhi, India (campus drive for Expedia India) · Result: Offer
Before the final round: a coding round with about ten multiple-choice questions and two coding questions, one on linked lists and one on hash maps.
Final round, interview 1: trees (about an hour)
- Which data structure are you comfortable with; are trees fine?
- Tree traversals and general tree questions.
- Write optimized code to build a binary search tree from a traversal. The first attempt wasn't optimal, and the interviewer's hints led to the better version.
Final round, interview 2 (about an hour)
- Tell me about yourself, your courses and your projects, mostly web development.
- Web questions on JavaScript promises, async/await and basic HTML. The candidate couldn't answer some and asked to switch to DSA.
- Model a human body in classes, built from parts like arms, legs and a head, while enforcing limits such as two arms and two legs. The candidate used one class per part with inheritance and still isn't sure what answer was wanted.
- Unlimited tables and ribbons of three colors with a count of each: how many tables can be covered if neighboring tables can't share a color? The candidate's recursive answer was complicated; the interviewer showed a simple pattern you can see from a few examples.
Final round, HR round (about an hour)
- Two sorted arrays where the first has room at the end: merge them in O(N). The easy solution fills from the back.
Tell me about yourself and questions on the résumé and its projects came up in every round.
Every interviewer was patient, and each round took about an hour. Other students had different interviewers and got SQL, OS, graph, linked-list and hash map questions, which the candidate heard secondhand.
126: 2016 campus, elevator stops and a graph problem
Report date: Sep 16, 2016 · Role: SDE (internship offer) · Location: India (on campus) · Result: Offer
Before the final round: a shortlist of about 90 students by grades, then a HackerRank test with twenty multiple-choice questions, whether a preorder sequence can come from a BST and deleting the odd-valued nodes of a linked list. 21 were shortlisted.
Final round, technical interview 1 (face to face)
- Questions on the candidate's project.
- The costs of data structures, from linked lists up to tries; how a HashMap is built and handles collisions.
- Given daily stock prices, find the buy day and later sell day with the largest profit. Closest practice version: Maximum Stock Profit with One Transaction.
Final round, technical interview 2 (face to face)
- An elevator in a building of M floors takes at most X people or Y total weight per trip. Given each person's weight and floor, count the stops it makes to serve everyone.
- Questions on handling real-world problems, and one design question focused on OOP.
Final round, HR interview (face to face)
- Tell me about yourself.
- What was hard in your project, and how did you get past it?
- Why Expedia? and why should we hire you?
- A practical graph problem, with a long discussion.
Patterns across the reports
-
Linked lists in India. Two India candidates had linked-list questions in their interviews: reversal, k-group reversal, add one and two lists meeting (122), and add one with several digits per node (123). The 2018 secondhand list adds k-group reversal (124).
-
Hash maps by hand. Implementing or explaining a hash map came up in three India reports (121, 123, 126), and the 2018 candidate heard it was a favorite question (124). A 2014 US candidate also advises knowing hash maps well (118).
-
Puzzles and elevators. Two 2018 India candidates got puzzles (123, 124), and elevators came up twice: counting stops in 2016 (126) and scheduling to cut waiting in 2018 (124).
-
Design across the years. OOP design shows up from 2013 to 2018: a library (119), an OOP design question in 2016 (126) and a human body (125). TinyURL in 2019 is the only system design question in this part (122).
Common questions
What were Expedia intern final rounds like before 2020?
Longer than now: three or four interviews in Bellevue for US candidates in 2012–2014 (118, 119, 120), and India campus days of two or three interviews with puzzles, CS theory and an HR round (121–126).
Keep practicing
- Number of Islands: the question from report 118.
- Middle Element of a Linked List: the closest practice version of a question from report 120.
- Climbing Stairs: the question from report 121.
- Reverse a Linked List in Groups of K: the question from report 122 (and the secondhand list in report 124).
- Find the Odd-Occurrence Value: the question from report 123.
- Merge Sorted Arrays in Place: the question from report 125.
- Maximum Stock Profit with One Transaction: the closest practice version of a question from report 126.
- Expedia behavioral question bank: more Expedia behavioral questions (sign-in needed).
- Expedia interview page: Expedia's interview stages and practice in one place.
- Expedia hiring insights: what Expedia's OAs and interviews have looked like recently.
- Experience feed: more firsthand interview reports.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.