Expedia Group Interview Questions, Process, and Tips

Simple React task, cinema API

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
Add your answer

Q1. Basic personality questions
Add your answer

Dynamic Programming and arrays

Q1. What are your salary expectations?
Add your answer
Q2. Share details of your previous job.
Add your answer
Q3. Why should we hire you?
Add your answer
Q4. Tell me about yourself.
Add your answer
Q5. What you can do extra for us
Add your answer
Q6. Situational based questions
Add your answer
Q7. Scheduling and weekly reports
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

this round contains 3 coding questions on Hackerrank. All are of moderate level.Platform was fast and responsive, and we were not allowed to switch through tabs during the test.

Q1. Encode the Message
You have been given a text message. You have to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings. The basic idea...read more
Ans. Constructive Implementation
Build the encoded string by iterating left to right counting repeated successive characters
• Create an empty encoded string 'ENCODEDMESSAGE' = “”.
• Iterate from i = 0  to  N - 1 where ‘N’ is the length of the 'MESSAGE' string.
• Store the current character in 'CURCHAR' = 'MESSAGE'[i] and initialize the 'CHARFREQ' = 1.
• Increase ‘i’ and 'CHARFREQ'  while i + 1 < N and s[i + 1] == 'CUR...read more
Answered by CodingNinjas
Add your answer
Q2. Minimum Distinct Labels
'N' boxes are placed on a table. Each box has an integer label on it. The labels present on each box are given in the array 'ARR'. Two different boxes may or may not...read more
Ans. Brute Force Approach
The idea is to generate all the possible combinations of the ‘M’ boxes that can be removed, and for each combination, find out the number of distinct labels that are left on the table and compare it with results obtained from all other combinations. In the end we will return minimum possible labels obtained.
To check the number of distinct labels left, we will insert all the labels on the boxes which...read more
Answered by CodingNinjas
View 1 more answer
Q3. Smallest Window
You are given two strings S and X containing random characters. Your task is to find the smallest substring in S which contains all the characters present in X.
Example:
Let S = “abdd” a...read more
Ans. Brute Force
A simple and intuitive approach could be to generate all the possible substrings of string S and choose the smallest substring which contains all the characters present in X.

This can be done by the following approach:
1. Firstly, store the count corresponding to each character, occurring in string X, into a hashtable.
2. Now, the next step is to generate all the possible substrings of string S.
3. Maintain a variable to...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 60 Minutes
Round difficulty - Medium

Interviewer asked me 2 coding question . Both are of easy to moderate level.He also asked some questions on My projects. Explain React state and props. What are keys in React?

Q1. Buy and Sell Stock
You are Harshad Mehta’s friend. He told you the price of a particular stock for the next ‘N’ days. You can either buy or sell a stock. Also, you can only complete at most 2-transactions....read more
Ans. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion.
Basically, we have to buy the stock at the minimum possible price and sell at the maximum possible price, keeping in mind that we have to sell the stock before buying it again.
 
 
Below is the detailed algorithm: 
 
1. Call ...read more
Answered by CodingNinjas
View 3 more answers
Q2. Equilibrium Index
You are given an array Arr consisting of N integers. You need to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elements of the ar...read more
Ans. Brute Force
• We can try the brute force approach in which we consider every index starting from 0 as a possible candidate for equilibrium index, and to check if it is really an equilibrium index, we can calculate the sum of elements on both sides of that index, and check if they are equal or not. equal or not.
• Let us initialise the ans = -1, which will contain our valid index.
• Since index 0 and n - 1 cannot be possible can...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Medium

Interviewer asked me 2 coding question . Both are of easy to moderate level. What are different types of lists in HTML? What is the ‘class’ attribute in HTML?

Q1. Valid Parentheses
You're given string ‘STR’ consisting solely of “{“, “}”, “(“, “)”, “[“ and “]” . Determine whether the parentheses are balanced.
Input Format:
The first line contains an Integer &...read more
Ans. Valid Parenthesis
Make use of the stack. Traverse the string and push the current character in the stack if it is an opening brace else pop from the stack If it is the corresponding starting brace for current closing brace then move to the next character of the string otherwise return false.
 
If after complete traversal if the stack is empty then the string is balanced else it is not balanced.
 
Pseudo Code:
• Decla...read more
Answered by CodingNinjas
Add your answer
Q2. Convert A Given Binary Tree To Doubly Linked List
Given a Binary Tree, convert this binary tree to a Doubly Linked List.
A Binary Tree (BT) is a data structure in which each node has at most two children...read more
Ans. Recursive Solution - 1
• If the left subtree exists, recursively convert the left subtree to Doubly Linked List.
• If the right subtree exists, recursively convert the right subtree to Doubly Linked List.
• When in the left subtree, find the inorder predecessor of the root, make this as the previous of the root and its next as the root.
• Similarly, when in the right subtree, find the inorder successor of the root, make this as th...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 60 Minutes
Round difficulty - Easy

Fourth round was HR round.

Q1. Basic HR Questions
He asked me various scenario based Managerial Questions and common HR questions.
Why should we hire you?
What are your hobbies?
 
Ans. 
Tip 1 : Be clear about your thoughts and convey them crisply and clearly. 
Tip 2 : Maintain a good speech rate and answer the questions in simple and to the point sentences. 
Tip 3 : Speak Confidently.
Answered by CodingNinjas
Add your answer

Q1. Basic coding and sql
Add your answer

Q1. Big data and system design
Add your answer

Q1. Hiring manager round
Add your answer