Expedia Group SDE Intern Interview Questions and Answers

Duration: 1hr+
Topics: 2 - coding questions(logic-based)
platform: Hackerank

Q1. Find the square root of a number using only 4 basic arithmetic operations (+,-,*,/) without using a power operator and inbuilt libraries. For numbers that are not perfect squares, print the integer part of...read more
Ans. 
Find square root of a number using basic arithmetic operations without power operator and inbuilt libraries.
• Use binary search to find the integer part of the square root

• Use long division method to find the decimal part of the square root

• Repeat the above steps until desired accuracy is achieved

• Handle edge cases like negative numbers and numbers less than 1
Answered by AI
Add your answer
Q2. Addition of two linked lists, and finallt return the result as a linked list
Add your answer

Q1. Count occurrences in sorted array
Ans. 
Count occurrences of a given element in a sorted array.
• Use binary search to find the first and last occurrence of the element.

• Subtract the indices to get the count.

• Handle edge cases like element not present in the array.
Answered by AI
Add your answer
Q2. Deepest left node in binary tree
Ans. 
Find the deepest left node in a binary tree.
• Traverse the tree recursively and keep track of the depth and whether the current node is a left node.

• If the current node is a leaf node and its depth is greater than the deepest left node found so far, update the deepest left node.

• Return the deepest left node found.

• Example: For the binary tree with root node 1, left child 2, and left child of 2 being 4, the deepest left node...read more
Answered by AI
Add your answer

2 coding question level easy-medium leetcode

Q1. 2 coding question leetcode
Add your answer
Q2. Dp graph trees stack queue
Add your answer

Q1. 2 Coding question leetcode easy medium
Add your answer

2 hours mcqs from all cse related topics + 1 coding question

3 coding questions easy level

Q1. I do not remember
Add your answer

Easy lc or medium lc quest

Q1. Coding round only was
Add your answer

2 DSA questions and 70 minutes.

Q1. Implement Min-stack using O(N) space .
Ans. 
Min-stack is implemented using O(N) space by keeping track of minimum value at each element.
• Use two stacks - one to store the actual elements and another to store the minimum value at each step.

• When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.

• When popping an element, also pop from the minimum stack if the popped element is the current minimum.
Answered by AI
Add your answer
Q2. Sliding Window Problem.
Ans. 
Sliding Window Problem involves finding a subarray of fixed size k with the maximum sum.
• Use a sliding window approach to iterate through the array and keep track of the sum of elements within the window.

• Slide the window by removing the first element and adding the next element in each iteration.

• Keep track of the maximum sum found so far and update it if a new maximum is found.
Answered by AI
Add your answer

1 hour long test, 1 easy and 1 medium leetcode problem + some apti questions.

Q1. Asked 1 codding question (Medium) * Next permutation of a number. Number was a time stamp (eg 11:55 PM)
Ans. 
Find the next permutation of a given timestamp in HH:MM AM/PM format.
• Convert the timestamp to a 24-hour format for easier manipulation.

• Identify the rightmost pair where the earlier digit is smaller than the later one.

• Swap this digit with the smallest larger digit to its right.

• Reverse the digits to the right of the swapped position to get the next permutation.

• Example: For '11:55 PM', the next permutation is '12:00 AM'.
Answered by AI
Add your answer

Q1. 3 medium leetcode questions from graphs, queue and dp.
Add your answer

It was a 2 hour test having 2 coding questions . Difficulty was easy and medium.

Q1. Two questions were asked . To make a BST from array elements . Snakes and ladder. Besides this interviewer also asked about my projects and basic introduction.
Add your answer