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 Development Engineer Interview Questions and Answers

Updated 15 Jul 2024

Expedia Group Software Development Engineer Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

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 

1.5 hours long, platform was hackerearth.

Round 3 - Technical 

(1 Question)

  • Q1. Reverse a Linked List
  • Ans. 

    Reverse a linked list by changing the pointers direction.

    • Start with three pointers: current, previous, and next.

    • Iterate through the linked list, updating the pointers to reverse the direction.

    • Update the head pointer to the last node to complete the reversal.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice medium level Leetcode questions regularly.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Jul 2023. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Zigzag level order traversal of tree
  • Ans. 

    Zigzag level order traversal of tree involves traversing the tree level by level in a zigzag pattern.

    • Use a queue to perform level order traversal of the tree

    • Alternate between left to right and right to left traversal for each level

    • Store the nodes at each level in separate arrays

  • Answered by AI
  • Q2. Implementation of a vector
  • Ans. 

    A vector is a dynamic array that can resize itself as needed.

    • A vector is typically implemented using a dynamically allocated array.

    • It provides constant time access to elements using index.

    • Vectors can grow in size by reallocating memory when needed.

    • Example: vector vec;

    • Example: vec.push_back(10);

  • Answered by AI

Skills evaluated in this interview

Software Development Engineer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Given an acyclic graph of a city where each edge represents a roa ... read more
asked in Hike
Q2. Given a screen with a button and a full-screen image view, descri ... read more
asked in Hike
Q3. You have an application that displays a list of contacts. The nam ... read more
asked in Amazon
Q4. Given an m * n matrix filled with '0's and 'x's with two position ... read more
asked in Samsung
Q5. There are 1000 wine bottles. One of the bottles contains poisoned ... read more

Top trending discussions

View All
Indian Startups
2w
a senior executive
One of the best sources for Startup investment: DAHEJ(DOWRY)
You won't believe my senior has a good corporate job with over 10 years of experience. But suddenly resigned just a few days after his wedding. We all thought maybe he got married and wants to spend his time with his wife, and decided to go to his place to give him a proper farewell. All of us got shocked after knowing that he left because his father-in-law gifted him a fat cash amount and a car in the name of "blessings." He’s using the money to fund his startup and the car for "business movement." I mean seriously? People are now using dowry as startup capital and walking around acting like CEOs, playing boss with someone else’s money. Bas, shaadi karo aur apne sapne chalu karo, courtesy sasural. I don't know feeling inspired? Or disgusted?
Got a question about Expedia Group?
Ask anonymously on communities.

Interview questions from similar companies

Interview Preparation Tips

Round: Resume Shortlist
Experience: Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP. The eligible branches were Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering. I couldn't give the test because my branch was Engineering Physics. However, when they visited campus for interviews on day 2, everyone who had cleared their test was already placed. They looked over some resumes for interviews and decided to interview me, since i had some projects in Machine Learning and Computer Vision.
Tips: For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, i dont remember what it was but it was also pretty straight forward. For the test, i would reommend to solve problem from geeksforgeeks. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

Round: Interview
Experience: The interview started off with questions on my general interest in Software Development. The first round had two coding questions, i was supposed to write the code on paper. The first question was to add two numbers represented by linked lists - -----/. They gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer. I dont remember the second question, but it was also an easy one on linked lists.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

Round: Interview
Experience: I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if i knew graph algorithms. Since i knew BFS and DFS, i told them. They asked the difference between the two. Then they asked me if i knew how to find the shortest distance between two points in a graph. I didn't know Djikstra's properly but i knew it worked on the greedy approach so was able to tell that. Then they asked me how would i find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

Round: Interview
Experience: They asked me to code one question which was on stacks, i don't remember the question, but it was also not difficult, and i wrote the code for that. Then they started to drill me on my resume, on every project that i had done, every miniscule detail.
Tips: Be very thorough with your resume. It's a clear red flag for them if you can't explain something you have written on your resume.

General Tips: Be thorough with Data Structures and Algorithms and also with your resume.
Skill Tips: They generally stick to coding only.
Skills: Coding
College Name: IIT Guwahati
Motivation: Wanted a job in Software Development.
Funny Moments: My third round started pretty late in the night around 11:30 PM. So, had a walking interview in front of the canteen because the interviewer thought i looked tired and should have a cup of coffee.

Interview Preparation Tips

Round: Test
Experience: First round was a simple round which involved 10 multiple choice questions and 3 coding questions on hackerrank platform.

Round: Technical Interview
Experience: Mainly on topics like networks, data structures and algorithms, operating systems. The interviewers looked for people who have had prior experience in web development and asked questions regarding web development in depth too.
Tips: I recommend everyone to read the book titled, 'Cracking the Coding Interview' as it was helpful in my approach to an interview.

General Tips: The one major thing that would give you the edge in joining Myntra would definitely be exposure to web development. Since it is not a part of the curriculum , it's all the more important for you to familiarize yourself with web development. In fact, a few projects in the same field would put you in a very advantageous position to get the job.
Skill Tips: 1. Start your placement preparations well ahead, no point regretting later.
2. Keep a concise resume. Do not take your resume to several pages.
3. Do not neglect aptitude preparation. Many people do this mistake and end up not clearing the first round for several companies.
4. Be thorough with your basics across all subjects. (Do not neglect any subject, even they you may like a few and dislike the others.)
5. Keep in mind, the interviewers are really friendly and try to make sure that you're not nervous during the interview. All they want to do is to test you. Be confident and give it your best shot.
Skills:
College Name: NIT Surathkal

Interview Questionnaire 

10 Questions

  • Q1. What do you do when your schedule is interrupted? How you handle it?
  • Ans. 

    I prioritize tasks, communicate effectively, and adapt my plans to manage interruptions while maintaining productivity.

    • Assess the interruption: Determine its urgency and importance. For example, if a team member needs immediate help, I prioritize that.

    • Reorganize my tasks: I create a new plan that accommodates the interruption while ensuring critical deadlines are met.

    • Communicate with stakeholders: I inform my team or m...

  • Answered by AI
  • Q2. PreOrder traversal without recursion?
  • Ans. 

    PreOrder traversal without recursion is done using a stack to simulate the function call stack.

    • Create an empty stack and push the root node onto it.

    • While the stack is not empty, pop a node from the stack and process it.

    • Push the right child of the popped node onto the stack if it exists.

    • Push the left child of the popped node onto the stack if it exists.

  • Answered by AI
  • Q3. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
  • Ans. 

    Yes

    • Create an empty binary search tree (BST)

    • Loop over the unsorted array

    • For each element, insert it into the BST using the appropriate insertion logic

    • Repeat until all elements are inserted

    • The resulting BST will be built from the unsorted array

  • Answered by AI
  • Q4. Find 2 elements in array whose sum is equal to given number?
  • Ans. 

    The question asks to find two elements in an array whose sum is equal to a given number.

    • Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.

    • Use a hash set to store the elements as you iterate through the array for efficient lookup.

    • Return the pair of elements if found, otherwise return a message indicating no such pair exists.

  • Answered by AI
  • Q5. How many types of trigger?
  • Ans. 

    There are two types of triggers: DML triggers and DDL triggers.

    • DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.

    • DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.

    • Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt...

  • Answered by AI
  • Q6. Can trigger be used with select statement?
  • Ans. 

    Yes, triggers can be used with select statements in SQL.

    • Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.

    • While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.

    • Using triggers with select statements allows you to perform additional actions or validations before or af...

  • Answered by AI
  • Q7. Indexing in mysql? How many types of indexing in mysql?
  • Ans. 

    Indexing in MySQL improves query performance. There are several types of indexing in MySQL.

    • Indexes are used to quickly locate data without scanning the entire table.

    • Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.

    • B-tree indexes are the most common and suitable for most use cases.

    • Hash indexes are used for exact match lookups.

    • Full-text indexes are used for searching text-based data efficie...

  • Answered by AI
  • Q8. Engines in mysql?
  • Ans. 

    Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.

    • MySQL supports multiple storage engines, each with its own strengths and features.

    • Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.

    • InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.

    • MyISAM is known for its simplicity and speed but lacks transaction suppo...

  • Answered by AI
  • Q9. Singlton pattern?
  • Ans. 

    The Singleton pattern ensures a class has only one instance and provides a global point of access to it.

    • Restricts instantiation of a class to a single object.

    • Useful for managing shared resources, like database connections.

    • Implemented using private constructors and static methods.

    • Example in Java: public class Singleton { private static Singleton instance; private Singleton() {} public static Singleton getInstance() { if...

  • Answered by AI
  • Q10. Can a constructor be private?
  • Ans. 

    Yes, a constructor can be private.

    • A private constructor can only be accessed within the class itself.

    • It is often used in singleton design pattern to restrict object creation.

    • Private constructors are also useful for utility classes that only contain static methods.

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

I appeared for an interview in Aug 2016.

Interview Preparation Tips

Round: Resume Shortlist
Experience: Around 180-200 students applied for the position. 45 students were selected for the coding test.

Round: Test
Experience: There were 3 questions. The difficulty level was moderate. I did 2 questions and got selected for the next round. 13 students were selected for the skype interview.
Duration: 1 hour 30 minutes
Total Questions: 3

Round: Technical Interview
Experience: This skype round basically checks our strength in the computer science basics. There were questions on data structures, databases, algorithms. They were moderate to difficult in nature. 7 people went into the next skype round which is also technical in nature.

Round: Technical Interview
Experience: In this round, first, there was a coding question which I needed to write and execute in a shared environment. Then, there was basically a detailed testing of the concepts I had used in projects. As the majority of my projects were on Android, I was interviewed in Android from here on. There were some questions on software design principles as well. 2 students were selected from this round for the final round.

Round: Technical + HR Interview
Experience: In this final round, there was a brief discussion about my projects and some questions in between about my projects. After this discussion, I was told to showcase my skills other than technical. I was made to pitch my startup idea with the interviewer being my probable customer. So, one can expect his management or leadership skills also to be tested in this round. Both the candidates were selected.

College Name: The LNM Institute Of Information Technology, Jaipur

I appeared for an interview before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as ...

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 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

Are these interview questions helpful?

I appeared for an interview in Oct 2016.

Interview Preparation Tips

Round: Resume Shortlist
Experience: Must have one year of experience. Must be Good in Data Structures and algorithms. Must be from a reputed college
Tips: Nothing in our hands

Round: Test
Experience: Aptitude are medium level, english are bit tricky, you have to get more than 20 to pass this round
Tips: Prepare well from indiabix.com, basics of aptitude and see comprahensive passages for english
Duration: 1 hour
Total Questions: 40

Round: Technical Interview
Experience: There are so many questions, all are mainly focus on your problem solving skills, mainly from Data Structures and Algorithms.

1. Reverse a linked list
2. there are considerably large files, find the intersection of them.
3. find union of them.
4. binary search tree traversal
Tips: Practice well, writing efficient code is necessary

Skills: Problem Solving, Data Structures And Algorithms, Python, LOGICAL THINKING ABILITIES

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

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The task is to find the length of the longest common subsequence between two given strings.

    • Implement a function to find the longest common subsequence between two strings.

    • Use dynamic programming to solve this problem efficiently.

    • Iterate through the strings and build a matrix to store the lengths of common subsequences.

    • Return the length of the longest common subsequence found.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper. 
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

  • Q1. 

    Add Two Numbers as Linked Lists

    You are given two singly linked lists, where each list represents a positive number without any leading zeros.

    Your task is to add these two numbers and return the sum as ...

  • Ans. 

    Add two numbers represented as linked lists and return the sum as a linked list.

    • Traverse both linked lists simultaneously while keeping track of carry from previous sum

    • Create a new linked list to store the sum, updating the value and carry as needed

    • Handle cases where one linked list is longer than the other by adding remaining digits with carry

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

  • Q1. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Use a queue to keep track of nodes to visit next in BFS traversal

    • Start traversal from vertex 0 and explore its neighbors first

    • Continue exploring neighbors level by level until all nodes are visited

    • Ensure to print connected nodes in numerical sort order

  • Answered by AI
  • Q2. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...

  • Ans. 

    DFS traversal to find connected components in an undirected and disconnected graph.

    • Perform DFS traversal on each vertex to find connected components

    • Maintain a visited array to keep track of visited vertices

    • Print the vertices of each connected component in ascending order

  • Answered by AI
  • Q3. 

    Dijkstra's Shortest Path Problem

    Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.

    • Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Update the distances of neighboring nodes based on the current node's distance and edge weight...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA, Eligible branches : Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering.Myntra 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 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : 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

Expedia Group Interview FAQs

How many rounds are there in Expedia Group Software Development Engineer interview?
Expedia Group interview process usually has 2 rounds. The most common rounds in the Expedia Group interview process are Resume Shortlist, Coding Test and Technical.
How to prepare for Expedia Group Software Development Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Expedia Group. The most common topics and skills that interviewers at Expedia Group expect are Career Development, Talent Acquisition, Troubleshooting, Agile Coaching and CCTV Monitoring.
What are the top questions asked in Expedia Group Software Development Engineer interview?

Some of the top questions asked at the Expedia Group Software Development Engineer interview -

  1. Zigzag level order traversal of t...read more
  2. Implementation of a vec...read more
  3. Reverse a Linked L...read more

Tell us how to improve this page.

Overall Interview Experience Rating

4.5/5

based on 2 interview experiences

Difficulty level

Moderate 100%

Duration

4-6 weeks 100%
View more
Expedia Group Software Development Engineer Salary
based on 82 salaries
₹12 L/yr - ₹40 L/yr
80% more than the average Software Development Engineer Salary in India
View more details

Expedia Group Software Development Engineer Reviews and Ratings

based on 3 reviews

4.1/5

Rating in categories

5.0

Skill development

4.8

Work-life balance

3.1

Salary

1.1

Job security

3.2

Company culture

3.0

Promotions

3.2

Work satisfaction

Explore 3 Reviews and Ratings
Software Development Engineer II
246 salaries
unlock blur

₹22 L/yr - ₹38.6 L/yr

Software Development Engineer 3
101 salaries
unlock blur

₹32 L/yr - ₹55.2 L/yr

Software Development Engineer
82 salaries
unlock blur

₹12 L/yr - ₹40 L/yr

Software Engineer
61 salaries
unlock blur

₹12 L/yr - ₹35.8 L/yr

Data Scientist
60 salaries
unlock blur

₹29.2 L/yr - ₹51.2 L/yr

Explore more salaries
Compare Expedia Group with

Amazon

4.0
Compare

Flipkart

3.9
Compare

Udaan

3.9
Compare

BigBasket

3.9
Compare
write
Share an Interview