Moveinsync Technology Solutions Senior Software Engineer Interview Questions and Answers

Merge two lists with different intervals based on overlapping intervals.

• Sort both lists based on start time.

• Iterate through both lists and compare intervals for overlap.

• Merge overlapping intervals and add non-overlapping intervals to the result list.

Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.

• Iterate through the matrix and find the doors

• Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door

• Update the distance matrix with the minimum distances

Find kth smallest element in unordered array with O(1) space

• Use the QuickSelect algorithm to partition the array and find the kth smallest element

• Choose a pivot element and partition the array into two subarrays

• Recursively partition the subarray that contains the kth smallest element

• Repeat until the pivot element is the kth smallest element

• Time complexity: O(n) average case, O(n^2) worst case

To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.

• Get your list of friends

• For each friend, get their list of friends

• Exclude yourself and your friends from the final list of friends of friends