i
Expedia Group
Filter interviews by
I applied via Company Website and was interviewed in Dec 2024. There was 1 interview round.
DSA Problem statement of Trie
Custom problem was given and asked to solve and discuss solution with the interviewer
Current project discussion with panel
I was interviewed in Jul 2022.
Round duration - 180 Minutes
Round difficulty - Medium
coding questions on DSA and MCQs on java
timing : late night
no camera
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 ...
Round duration - 50 Minutes
Round difficulty - Medium
It was a DSA round.
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.
The fi...
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...
Round duration - 50 Minutes
Round difficulty - Medium
DSA Questions were asked.
Given a string str
and a character 'X', develop a function to eliminate all instances of 'X' from str
and return the resulting string.
The first lin...
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...
Round duration - 50 Minutes
Round difficulty - Easy
It was a behavioural round.
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
Tip 1 : good projects and coding profiles like leetcode
Tip 2 : some good internships also help
I was interviewed in Dec 2020.
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).
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...
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
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.
...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.
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.
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.
Expedia Group interview questions for designations
I was interviewed before Jan 2021.
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.
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...
The idea is to use a recursive approach to find the given key and then remove that node. The recursive idea is very clear that we will traverse through the circular linked list, and we will check if the value of the node is equal to the given key.
We will define a function deleteNodeHelper(root, key, head) to remove the key in which the head is the starting node of the linked list, and we will send root as t...
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...
Approach: According to LRU, if the page we need is not present in the set of pages, the page fault occurs, and we replace the least recently used page with the current page. And if the page is present, we just use it, and no page fault occurs.
Algorithm:
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.
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 ...
Floyd's algorithm can be used to solve this question.
Define two pointers slow and fast. Both point to the head node, fast is twice as fast as slow. There will be no cycle if it reaches the end. Otherwise, it will eventually catch up to the slow pointer somewhere in the cycle.
Let X be the distance from the first node to the node where the cycle begins, and let X+Y be the distance the slow pointer travels. To catch up, t...
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...
Concept of sorting can be applied here.
1. Sort the array.
2. Maintain two indexes one at beginning (l=0) and one at end (r=n-1).
3. Now, traverse the array until l 3.1 Calculate sum of arr[l] + arr[r]
3.2 if abs (sum) < abs (minimum sum), then update the minimum sum and pair.
3.3 If sum < 0, this means if we want to find sum close to 0, do l++
3.4 If sum is greater than 0,this means if we want to find sum close ...
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.
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.
Get interview-ready with Top Expedia Group Interview Questions
I was interviewed before Jan 2021.
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.
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...
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...
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.
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.
I was interviewed before Sep 2020.
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.
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.
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.
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...
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.
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.
The fir...
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...
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.
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
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.
Top trending discussions
It was a medium-level DSA round
This was also a DSA round
This again a DSA round
I was interviewed in May 2024.
It was having english and maths questions
Code was easy kindly do pratice
based on 2 interviews
2 Interview rounds
based on 11 reviews
Rating in categories
Software Development Engineer II
185
salaries
| ₹15.6 L/yr - ₹40 L/yr |
Software Development Engineer
96
salaries
| ₹12 L/yr - ₹36 L/yr |
Software Development Engineer 3
71
salaries
| ₹30 L/yr - ₹55 L/yr |
Software Developer
66
salaries
| ₹10 L/yr - ₹41.8 L/yr |
Software Engineer
56
salaries
| ₹12 L/yr - ₹37 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo