Expedia Group Interview Questions, Process, and Tips

Q1. Maximum Length of increasing subsequence
Ans. 
Find the maximum length of increasing subsequence in an array of strings.
• Use dynamic programming to keep track of the length of increasing subsequences ending at each index.

• Iterate through the array and update the length of increasing subsequences.

• Return the maximum length found.
Answered by AI
Add your answer
Q2. LLD for a storage based system
Ans. 
LLD for a storage based system involves designing the detailed architecture and components of the system to efficiently store and retrieve data.
• Identify the requirements for the storage system, including data types, volume, access patterns, and performance expectations.

• Design the data storage architecture, including data structures, indexing mechanisms, and storage technologies like databases or file systems.

• Define the...read more
Answered by AI
Add your answer
Q3. Hashmap based question
Add your answer

Q1. LLD for a S3 or a storage based system
Ans. 
LLD for a S3 or a storage based system involves designing the detailed architecture and components of the system.
• Define the data model including objects, metadata, and storage classes

• Design the system components like storage nodes, metadata servers, and access control mechanisms

• Consider scalability, fault tolerance, and data consistency in the design

• Implement features like versioning, encryption, and access control pol...read more
Answered by AI
Add your answer

Q1. Past Program Managed
Ans. 
Managed a large-scale software development program for a financial services company.
• Led a team of 20 developers and testers in delivering a new online banking platform

• Implemented Agile methodologies such as Scrum to improve project efficiency

• Collaborated with stakeholders to define project scope and prioritize features

• Managed project budget and resources to ensure on-time delivery
Answered by AI
Add your answer
Q2. Conflict Management
Add your answer

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 ...read more
Answered by AI
Add your answer

Q1. Jump game II, standard quesiton
Add your answer

Easy Interview basic questions

Q1. Desing Tic Tac Toe
Add your answer

Q1. Final Round behavioural questions
Add your answer

Q1. Given array of integer create subarray with sum = 0
Ans. 
Create subarrays with sum = 0 from given array of integers.
• Iterate through the array and keep track of the running sum.

• Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.

• If yes, then the subarray between those two indices has a sum of 0.
Answered by AI
Add your answer
Q2. Left view of binary tree
Ans. 
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
• Traverse the tree in a level order manner and keep track of the first node at each level.

• Use a queue to store nodes at each level and update the left view nodes accordingly.

• Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
Answered by AI
Add your answer

Q1. Build system for Tiny URL
Ans. 
Build a system for generating and managing Tiny URLs
• Use a unique identifier for each long URL to generate a short URL

• Store the mapping of short URL to long URL in a database

• Implement a redirect mechanism to redirect users from short URL to long URL

• Consider adding expiration dates for short URLs to manage storage

• Implement analytics to track usage of short URLs
Answered by AI
Add your answer