Expedia Group | Onsite Interview | SDE2 | Bangalore, India | Puzzle | 2D Matrix | Binary Tree

expedia group logo
expedia group
SDE 2Bangalore, IndiaRejected
January 24, 20222 reads

Summary

I interviewed for an SDE 2 role at Expedia Group in Bangalore. Despite answering all the technical questions, which included a logic puzzle, a matrix search problem, and a binary tree height calculation, I was not selected for further rounds.

Full Experience

I had an onsite interview at Expedia Group for an SDE 2 position, which was conducted virtually and lasted approximately 1.5 hours. I was presented with three distinct problems: a tricky logic puzzle, a problem involving searching for an element in a row-wise and column-wise sorted 2D matrix, and a straightforward binary tree maximum height calculation. I felt confident in my answers for all the questions.

However, to my surprise, I was not selected for further rounds. I'm still not clear on the specific reasons for this outcome, as I believed my approaches were sound.

Interview Questions (3)

Q1
Mislabeled Jars Puzzle
Other

There are 3 jars. One jar contains only orange fruits, one jar contains only apple fruits, and the remaining jar contains a mix of apple and orange. The mix need not be half half. All the jars given are mislabeled. Label the jars properly. Find the minimum number of fruits you need to take out to label all the jars correctly.

Q2
Search Element in Row/Column Sorted Matrix
Data Structures & AlgorithmsMedium

Given a matrix that is row-wise sorted and column-wise sorted. Given a target element, search it in the matrix. If the element is found in the matrix, return its indices or return 'Not Found'. The return should be string type.

Q3
Maximum Height of Binary Tree
Data Structures & AlgorithmsEasy

Given a binary tree. Find the maximum height of the binary tree.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!