Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Expedia Group Team. If you also belong to the team, you can get access from here

Expedia Group Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Expedia Group Software Developer Interview Questions, Process, and Tips

Updated 19 Jan 2025

Top Expedia Group Software Developer Interview Questions and Answers

  • Q1. Knight Probability in Chessboard Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given ...read more
  • Q2. Maximum Sum of Two Non-Overlapping Subarrays Given an integer array ARR and a positive integer K , your objective is to find two non-overlapping subarrays (contiguous) o ...read more
  • Q3. String Rearrangement Problem Statement You are given a string of lowercase characters. The objective is to rearrange (reorder) the string so that no two adjacent charact ...read more
View all 20 questions

Expedia Group Software Developer Interview Experiences

8 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in Dec 2024. There was 1 interview round.

Round 1 - Coding Test 

DSA Problem statement of Trie

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared with DS ALgo
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Custom problem was given and asked to solve and discuss solution with the interviewer

Round 3 - Group Discussion 

Current project discussion with panel

Round 4 - HR 

(1 Question)

  • Q1. Behaviour questions

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

I appeared for an interview in Jul 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 180 Minutes
Round difficulty - Medium

coding questions on DSA and MCQs on java 
timing : late night 
no camera

  • Q1. 

    Knight Probability in Chessboard

    Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...

  • Ans. 

    Calculate the probability that a knight remains on an N x N chessboard after making K moves.

    • Use dynamic programming to calculate the probability of the knight staying on the board after each move.

    • Consider all possible moves the knight can make from its current position.

    • Keep track of the probabilities at each position on the board after each move.

    • Normalize the probabilities at the end to get the final result.

    • Example: Fo...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

It was a DSA round.

  • Q1. 

    Binary Tree to Doubly Linked List

    Transform a given Binary Tree into a Doubly Linked List.

    Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.

    Input:

    The fi...
  • Ans. 

    Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.

    • Perform Inorder Traversal of the Binary Tree to get the nodes in order.

    • Create a Doubly Linked List by connecting the nodes in the order obtained from Inorder Traversal.

    • Return the head of the Doubly Linked List as the output.

  • Answered by AI
  • Q2. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a set to store duplicates.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

DSA Questions were asked.

  • Q1. 

    Remove Character from String Problem Statement

    Given a string str and a character 'X', develop a function to eliminate all instances of 'X' from str and return the resulting string.

    Input:

    The first lin...
  • Ans. 

    Develop a function to remove all instances of a given character from a string.

    • Iterate through the string character by character and skip the character to be removed.

    • Build a new string by appending characters that are not equal to the given character.

    • Return the final modified string.

    • Handle edge cases like empty string or character not found in the string.

  • Answered by AI
  • Q2. 

    String Rearrangement Problem Statement

    You are given a string of lowercase characters. The objective is to rearrange (reorder) the string so that no two adjacent characters are identical.

    Return the rear...

  • Ans. 

    The objective is to rearrange a string so that no two adjacent characters are identical. Return the rearranged string or 'NO SOLUTION'.

    • Iterate through the string and count the frequency of each character.

    • Create two lists, one for characters with odd frequency and one for characters with even frequency.

    • If the count of characters with odd frequency is greater than 1, return 'NO SOLUTION'.

    • Alternate between characters with...

  • Answered by AI
Round 4 - HR 

Round duration - 50 Minutes
Round difficulty - Easy

It was a behavioural round.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteria7 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Data structures and algorithms, oops, os, dbms, web, development(ruby and reactjs) , basic quant, every topic of DSA in depthTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : strong grasp on DSA and problem solving 
Tip 2 : follow leetcode (try to do as many medium questions as possible) 
Tip 3 : should focus on development also and internships

Application resume tips for other job seekers

Tip 1 : good projects and coding profiles like leetcode 
Tip 2 : some good internships also help

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Easy

This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.

1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes

This Round was Conducted on Hackerrank (Webcam Enabled).

  • Q1. Given a problem statement and a code, how would you find and correct the bugs in the code?
  • Ans. 

    To find and correct bugs in code, analyze problem statement, review code, use debugging tools, run test cases, and make necessary changes.

    • Understand the problem statement and expected output

    • Review the code for syntax errors, logical errors, and potential bugs

    • Use debugging tools like breakpoints, print statements, and IDE features

    • Run test cases to identify the bugs and verify the corrections

    • Make necessary changes to the

  • Answered by AI
  • Q2. 

    Count Nodes within K-Distance Problem Statement

    Given a connected, undirected, and acyclic graph where some nodes are marked and a positive integer 'K'. Your task is to return the count of nodes such that...

  • Ans. 

    Count the number of nodes within K-distance from marked nodes in a connected, undirected, acyclic graph.

    • Create a graph using the given vertices and edges.

    • Perform a BFS traversal starting from each marked node to find nodes within K-distance.

    • Count the nodes within K-distance from all marked nodes and return the total count.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

  • Q1. 

    Problem Statement: Largest Subarray with Equal Number of 0s and 1s

    Given an array containing only 0s and 1s, determine the length of the longest contiguous subarray that has an equal number of 0s and 1s.

    ...
  • Ans. 

    Find the length of the longest subarray with equal number of 0s and 1s in a given array of 0s and 1s.

    • Iterate through the array and maintain a running count of the difference between the number of 0s and 1s encountered so far.

    • Store the count values in a hashmap with the index as the key.

    • If the same count is encountered again, calculate the length of the subarray between the two occurrences.

    • Return the maximum length foun

  • Answered by AI
  • Q2. Can you explain how the file system is stored on a disk and how it works?
  • Ans. 

    File system is stored on disk using data blocks and metadata, organized in a hierarchical structure.

    • File system is stored on disk using data blocks and metadata

    • Data blocks contain actual file data, while metadata stores information about files and directories

    • File system is organized in a hierarchical structure with directories containing files and subdirectories

    • File system uses a file allocation table (FAT) or an index

  • Answered by AI
  • Q3. Can you distinguish between RISC and CISC architectures?
  • Ans. 

    RISC focuses on simplicity and efficiency, while CISC emphasizes complex instructions and flexibility.

    • RISC uses a small set of simple instructions, while CISC uses a large set of complex instructions.

    • RISC architectures have a uniform instruction format, while CISC architectures have variable-length instructions.

    • RISC architectures rely on optimizing compilers for performance, while CISC architectures have hardware optim...

  • Answered by AI
Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaAbove 8 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPS, Computer Networks, Computer System Architecture, Operating System, Data Structures, PointersTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Make sure that you are thorough with CS concepts beforehand.
Tip 2 : Even when you are explaining the approach to a question, try to parallelly think about how you would code it.
Tip 3 : Read the previous interview experiences. It would give a fair idea of the kind of questions one should expect.
Tip 4 : For a company like Adobe, practicing medium difficulty level coding questions would be the way to go.
Tip 5 : Practice atleast 200 questions from coding platforms like CodeZen, LeetCode, Interviewbit as they contain common interview questions.

Application resume tips for other job seekers

Tip 1 : Mention atleast 1 project and past work experience as it sets good impression.
Tip 2 : Keep your resume up to date for the role you are applying.
Tip 3 : Try to keep your resume of 1 Page.

Final outcome of the interviewSelected

Skills evaluated in this interview

Expedia Group interview questions for designations

 Software Developer Intern

 (9)

 Senior Software Developer

 (1)

 Software Engineer

 (3)

 Software Engineer2

 (1)

 Senior Developer

 (1)

 Senior Software Engineer

 (4)

 Software Engineer III

 (3)

 Software Development Engineer

 (2)

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Easy

Hello everyone! Expedia came to our campus for full time hiring of final year students. They had shortlisted candidates for the interviews by taking an online test comprised of four sections (Quantitative, C, Logical and English). Every section had a timer attached to it, so you need to think and answer quickly. Although, the questions were easy but cutoff was quite high. This round was followed by a coding round, comprised of two questions.

  • Q1. 

    Problem: Deletion in Circular Linked List

    You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'.

    Your task is to implement a function that locates the spec...

  • Ans. 

    Implement a function to delete a specific key from a Circular Linked List of integers.

    • Traverse the Circular Linked List to find the key to be deleted.

    • Adjust the pointers to remove the node containing the key.

    • Handle the case where the Circular Linked List becomes empty after deletion.

    • Return -1 if the Circular Linked List is empty after deletion.

  • Answered by AI
  • Q2. 

    Page Faults Identification Problem Statement

    In computing, a page fault occurs when a process accesses a memory page that is not currently mapped by the memory management unit. To handle new pages being b...

  • Ans. 

    The problem involves determining the number of page faults using the Least Recently Used (LRU) replacement algorithm.

    • Page faults occur when a process accesses a memory page not currently mapped by the memory management unit.

    • Page replacement algorithm like LRU is used to decide which existing page should be replaced.

    • The goal is to calculate the number of page faults based on the given input sequences and memory capacity...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The man who was taking my first round was my alumni. He started-off by asking my introduction and then gave me 2 programming questions to code. He then navigated on to my Codechef profile and asked a question that I did in the June 14 Long Contest. I explained him and he was satisfied. 
Tips : You don’t have to answer the stuffs quickly, rather you need to develop some test cases and have some discussion regarding the structure of the problem, and then answer.

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.

    • Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

    • If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.

    • Use Floyd's Cycle Detection Algorithm for efficient detection of cycles in a linked list.

  • Answered by AI
  • Q2. 

    Closest Sum Problem Statement

    Given an array of integers ARR of size N and an integer target, find three integers in ARR such that their sum is closest to the target. If there are two closest sums, return...

  • Ans. 

    Find three integers in an array whose sum is closest to a given target, return the smallest sum if there are two closest sums.

    • Iterate through all possible triplets in the array to find the sum closest to the target.

    • Keep track of the closest sum found so far and update it if a closer sum is found.

    • Return the closest sum at the end of the iteration.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Expedia Group Interview Questions

Interview Preparation Tips

Round: Technical Interview
Experience: The interviewers were professional in their approach and ensured that I was comfortable through the whole process.

General Tips: Interview process was fairly fast but a bit heavy. There were 4 technical interviews and 1 HR. It turns out to be not too difficult as some questions are duplicated in all the interviews.
Skills: Algorithm, data structure
College Name: na

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Easy

This was the online round held at university. All students who met the eligibility criteria were called for the online test on hackerrank.

  • Q1. 

    Anagram Difference Problem Statement

    Given two strings, 'STR1' and 'STR2', of equal lengths, determine the minimum number of manipulations required to make the two strings anagrams of each other.

    Input:

    ...
  • Ans. 

    The problem involves finding the minimum number of manipulations required to make two strings anagrams of each other.

    • Create frequency maps for both strings

    • Find the absolute difference in frequencies of each character

    • Sum up the absolute differences to get the total manipulations needed

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

This round was technical round and the interview started with formal introduction and general questions.
After that We had a discussion on LRU Cache.
Followed by coding and set of data structure questions.

  • Q1. 

    Gas Tank Problem Statement

    You have a car with a gas tank of infinite capacity. There are 'N' gas stations located along a circular route, numbered from 0 to N-1. You begin your journey with an empty tank...

  • Ans. 

    Find the starting gas station index to complete a circular route with gas and cost arrays.

    • Iterate through gas stations, keeping track of total gas and total cost from each station

    • If total gas is greater than or equal to total cost, update the starting station index

    • Return the starting station index if a valid one is found, else return -1

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.

  • Q1. 

    Boundary Traversal of Binary Tree

    Given a binary tree of integers, your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the root node.

    Input:

    The fir...
  • Ans. 

    Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.

    • Traverse the left boundary nodes from the root to the leftmost leaf node.

    • Traverse the leaf nodes from left to right.

    • Traverse the right boundary nodes from the rightmost leaf node to the root.

  • Answered by AI
  • Q2. 

    Maximum Sum of Two Non-Overlapping Subarrays

    Given an integer array ARR and a positive integer K, your objective is to find two non-overlapping subarrays (contiguous) of length K each, such that their sum...

  • Ans. 

    Find two non-overlapping subarrays of length K with maximum sum in an integer array.

    • Iterate through the array to find all possible subarrays of length K.

    • Calculate the sum of each pair of non-overlapping subarrays of length K.

    • Keep track of the maximum sum obtained from the pairs of subarrays.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was the Final Interview and it started with formal introduction and general HR questions. Then We discussed about the projects and the things written in my resume. The interviewer was very frank and this round was very interactive. He asked me about my college, my future plans, teachers, various subjects, why Expedia and questions like that.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteriaAbove 7.5 CGPA, Candidates from computer related branch only.Expedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Designs, Operating Systems, DBMSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be solid with the basics of Ds & Algorithms. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer

Application resume tips for other job seekers

Tip 1: Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2: Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3: It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Easy

The test was divided into two parts : Section A had questions from Quantitative, C language, Logical and English. The second part had two coding questions.

  • Q1. 

    Deletion in Circular Linked List Problem Statement

    Given a Circular Singly Linked List of integers, and a specific value 'VAL', your task is to delete the first occurrence of this value in the linked list...

  • Ans. 

    Delete the first occurrence of a specific value in a Circular Linked List.

    • Traverse the circular linked list to find the value to be deleted.

    • Update the pointers to skip the node containing the value.

    • Handle edge cases like deleting the only node in the list.

    • Return the modified circular linked list.

  • Answered by AI
  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraints.

    • Use a combination of a doubly linked list and a hashmap to efficiently implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly when new items are added.

    • Ensure that the cache does not exceed its capacity by evicting the least recently used item when necessary.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

Expedia Group Interview FAQs

How many rounds are there in Expedia Group Software Developer interview?
Expedia Group interview process usually has 2-3 rounds. The most common rounds in the Expedia Group interview process are Coding Test, Group Discussion and HR.

Tell us how to improve this page.

Expedia Group Software Developer Interview Process

based on 2 interviews

2 Interview rounds

  • Coding Test Round
  • HR Round
View more
Expedia Group Software Developer Salary
based on 62 salaries
₹10 L/yr - ₹34.5 L/yr
181% more than the average Software Developer Salary in India
View more details

Expedia Group Software Developer Reviews and Ratings

based on 11 reviews

3.6/5

Rating in categories

3.4

Skill development

3.8

Work-life balance

3.4

Salary

3.0

Job security

3.6

Company culture

3.3

Promotions

3.5

Work satisfaction

Explore 11 Reviews and Ratings
Software Development Engineer II
198 salaries
unlock blur

₹15.6 L/yr - ₹40 L/yr

Software Development Engineer
95 salaries
unlock blur

₹12 L/yr - ₹36 L/yr

Software Development Engineer 3
76 salaries
unlock blur

₹30 L/yr - ₹58 L/yr

Software Developer
62 salaries
unlock blur

₹10 L/yr - ₹34.5 L/yr

Software Engineer
55 salaries
unlock blur

₹12 L/yr - ₹37 L/yr

Explore more salaries
Compare Expedia Group with

MakeMyTrip

3.7
Compare

Yatra

3.4
Compare

Cleartrip

3.5
Compare

Goibibo

4.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview