Expedia Group Interview Questions, Process, and Tips

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.

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

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

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

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

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.

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].