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

Updated 19 Sep 2024

Expedia Group Software Development Engineer II Interview Experiences

4 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected
Round 1 - Coding Test 

They have given coding test where 2 medium to easy level questions where asked

Round 2 - Technical 

(1 Question)

  • Q1. It was dsa round where easy to medium level 2 questions were asked , topic linked list and stack
Round 3 - Technical 

(1 Question)

  • Q1. This was a hld round
Round 4 - Technical 

(1 Question)

  • Q1. Final was hm round around projects
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Easy questions and mostly implementation based.

Software Development Engineer II Interview Questions Asked at Other Companies

asked in Zepto
Q1. Given 2 large numeric comma seperated strings. You need to calcul ... read more
asked in Zepto
Q2. How many microservices do I own & at what scale they handle t ... read more
asked in Porter
Q3. 1. Given an array find a subset that sums to a given sum K 2. Giv ... read more
Q4. design a LLD of portfolio management system where you can add any ... read more
asked in S&P Global
Q5. Difference between truncate and delete and when we prefer what op ... read more
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. A number x is given, two operation are allowed. Decrement by 1 and multiply by 2. find min operation to convert x to y.
  • Ans. 

    Given a number x, find the minimum number of operations (decrement by 1 or multiply by 2) to convert it to y.

    • Use a breadth-first search (BFS) approach to explore all possible operations and find the minimum number of steps.

    • Start with x and generate all possible next numbers by decrementing or multiplying by 2.

    • Keep track of the number of steps taken to reach each number and stop when y is found.

    • Use a queue to implement ...

  • Answered by AI
Round 2 - One-on-one 

(1 Question)

  • Q1. Jump game II, standard quesiton

Skills evaluated in this interview

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

I applied via Company Website and was interviewed before Mar 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Simple React task, cinema API

Round 2 - Technical 

(1 Question)

  • Q1. Describe a cinema API
  • Ans. 

    A cinema API is a software interface that allows developers to access and interact with cinema-related data and services.

    • Provides information about movies, showtimes, theaters, and ticket availability

    • Allows users to search for movies, view trailers, and book tickets

    • May include features like seat selection, payment processing, and user reviews

    • Can integrate with external services like payment gateways and movie databases

  • Answered by AI

Skills evaluated in this interview

Expedia Group interview questions for designations

 Software Development Engineer

 (2)

 Senior Software Development Engineer

 (1)

 Data Engineer II

 (1)

 Software Development Engineer Intern

 (2)

 Software Development Engineer 3

 (1)

 Software Engineer

 (3)

 Senior Software Engineer

 (4)

 Software Engineer III

 (3)

Software Development Engineer II Jobs at Expedia Group

View all

Interview questions from similar companies

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?
  • 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?
  • 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 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

Interview Questionnaire 

1 Question

  • Q1. Data structures, thoroughly

I appeared for an interview before May 2021.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Medium

 Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.

- 28 MCQs based on core CS 

- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions

  • Q1. 

    Remove Duplicates from a Sorted Linked List

    Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.

    You are given the 'Head' of a sorted linked list. Modify the l...

  • Ans. 

    Remove duplicates from a sorted linked list without adjacent duplicates.

    • Traverse the linked list while comparing current and next nodes.

    • If they are equal, skip the next node by updating the current node's next pointer.

    • Repeat until the end of the list is reached.

  • Answered by AI
  • Q2. 

    Course Schedule Problem Statement

    You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.

    Some courses have prerequisites, which means that to take course i,...

  • Ans. 

    Check if it is feasible to complete all courses with prerequisites.

    • Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.

    • Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).

    • If there is no cycle, then it is feasible to complete all courses.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.

    The LC...

  • Ans. 

    Find the Lowest Common Ancestor of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the Lowest Common Ancestor.

    • Implement a recursive function to efficiently find the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

  • Answered by AI
Round 4 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Pretty Good Round. Fast Paced. We covered a lot of ground.

  • Q1. 

    Binary Search Tree Iterator Problem Statement

    Design and implement a class BSTIterator to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...

  • Ans. 

    Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).

    • Implement a parameterized constructor to initialize the iterator with the root of the BST.

    • Implement a method 'next()' to return the next smallest element in in-order traversal.

    • Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.

    • Ensure the output is the in-order traversal of the

  • Answered by AI
  • Q2. 

    Maximum Consecutive Ones Problem Statement

    Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...

  • Ans. 

    Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.

    • Iterate through the array and keep track of the current window of 1's and zeroes.

    • Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.

    • Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.

    • Return the maximum length ...

  • Answered by AI
  • Q3. 

    BFS in Graph Problem Statement

    You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0t...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.

    • Use a queue to keep track of nodes to visit next.

    • Keep a visited array to avoid revisiting nodes.

    • Print the BFS traversal path as the nodes are visited.

    • Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].

  • Answered by AI
  • Q4. 

    Dijkstra's Shortest Path Problem Statement

    Given an undirected graph with V vertices (labeled 0, 1, ..., V-1) and E edges, each edge connects two nodes X and Y with a specified weight representing the dis...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.

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

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

    • Initialize distances to all nodes as infinity, except for the source node which is 0.

    • Update distances t...

  • Answered by AI
Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Hard

Bar Raised Round. Definitely felt the difficulty.

  • Q1. 

    First Non-Repeating Character Problem Statement

    You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...

  • Ans. 

    Identify and return the first non-repeating character in a string, or the first character if all characters repeat.

    • Iterate through the string to count the frequency of each character

    • Iterate through the string again to find the first character with frequency 1

    • If no such character is found, return the first character of the string

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaAmazon interview preparation:Topics to prepare for the interview - Linked Lists, Trees, BFS, DFS, Backtracking, Graphs.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews. 
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.

Application resume tips for other job seekers

Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 150 minutes
Round difficulty - Medium

We could attempt at any time out of the 3 given days.
The round was very time constrained and we could NOT go back to the question that we already attempted.

  • Q1. 

    Merge Two Sorted Linked Lists

    Given two sorted linked lists, your task is to merge them into a single sorted linked list. Return the head of the newly combined list.

    Note:

    The given linked lists may or ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list.

    • Create a dummy node to start the merged list

    • Compare nodes from both lists and add the smaller one to the merged list

    • Move the pointer of the merged list and the list with the smaller node

    • Handle cases where one list is exhausted before the other

    • Return the head of the merged list

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Hard

Evening at 5:00 pm. It was held on Amazon Chime app
Face cam was to be kept on COMPULSARILY. You could however not see the interviewer.
Codepen type environment was also used for typing my code which could be edited by the interviewer also.
(Shared document kind of)
Interviewer was very professional and was trying to push me towards getting the most optimal solution. Each and every answer was asked a counter question as to why I made that choice

  • Q1. 

    Missing Numbers Problem Statement

    You are provided with an array called ARR, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest a...

  • Ans. 

    Identify missing numbers within the range of smallest and largest elements in an array.

    • Find the smallest and largest elements in the array.

    • Generate a list of numbers within the range of smallest and largest elements.

    • Remove the numbers that are present in the array to get the missing numbers.

    • Sort and return the missing numbers.

  • Answered by AI
  • Q2. 

    Find Maximum Element Between Two Nodes in a BST

    Given a Binary Search Tree (BST) and two integers, NODE1 and NODE2, determine the maximum element found in the path between NODE1 and NODE2.

    Explanation:

    ...

  • Ans. 

    Find the maximum element between two nodes in a Binary Search Tree (BST) path.

    • Traverse the BST to find the path between NODE1 and NODE2.

    • Keep track of the maximum element encountered in the path.

    • Return the maximum element found, or -1 if NODE1 or NODE2 are not in the BST or no elements exist between them.

  • Answered by AI
  • Q3. 

    String Compression Problem Statement

    Implement a program that performs basic string compression. When a character is consecutively repeated more than once, replace the consecutive duplicates with the coun...

  • Ans. 

    Implement a program to compress a string by replacing consecutive duplicates with the count of repetitions.

    • Iterate through the string and keep track of consecutive characters and their counts.

    • Replace consecutive duplicates with the count of repetitions.

    • Ensure the count of repetitions is ≤ 9.

    • Return the compressed string.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Veermata Jijabai Technological Institute. I applied for the job as SDE - 1 in BangaloreEligibility criteriaOnly femalesAmazon interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, Dynamic programming, Computer network basicsTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Be very very clear with your basics.
Tip 2 : Think well before giving an answer
Tip 3 : Practice, practice, practice DS Algo questions

Application resume tips for other job seekers

Tip 1 : Limit it to 1 page ONLY.
Tip 2 : Be ready to face all kinds of questions on topics you have mentioned in the resume.

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 II interview?
Expedia Group interview process usually has 2-3 rounds. The most common rounds in the Expedia Group interview process are Technical, Coding Test and One-on-one Round.
How to prepare for Expedia Group Software Development Engineer II 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 Talent Acquisition, Agile Coaching, Data Structures and Algorithms, Backend and CCTV Monitoring.
What are the top questions asked in Expedia Group Software Development Engineer II interview?

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

  1. A number x is given, two operation are allowed. Decrement by 1 and multiply by ...read more
  2. Describe a cinema ...read more
  3. It was dsa round where easy to medium level 2 questions were asked , topic link...read more

Tell us how to improve this page.

Expedia Group Software Development Engineer II Interview Process

based on 5 interviews

1 Interview rounds

  • Coding Test Round
View more
Expedia Group Software Development Engineer II Salary
based on 207 salaries
₹15.6 L/yr - ₹40 L/yr
5% more than the average Software Development Engineer II Salary in India
View more details

Expedia Group Software Development Engineer II Reviews and Ratings

based on 16 reviews

3.2/5

Rating in categories

3.4

Skill development

3.4

Work-life balance

2.9

Salary

2.7

Job security

3.2

Company culture

2.5

Promotions

3.2

Work satisfaction

Explore 16 Reviews and Ratings
Software Development Engineer II

Gurgaon / Gurugram

2-5 Yrs

₹ 18-40 LPA

Software Development Engineer II

Gurgaon / Gurugram

2-5 Yrs

Not Disclosed

Software Development Engineer II

Gurgaon / Gurugram

2-5 Yrs

₹ 18-40 LPA

Explore more jobs
Software Development Engineer II
207 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 Engineer
60 salaries
unlock blur

₹12 L/yr - ₹36 L/yr

Software Developer
51 salaries
unlock blur

₹10 L/yr - ₹35 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
Did you find this page helpful?
Yes No
write
Share an Interview