Company : Facebook | Meta
YoE : 9 Yrs
Position : Data Engineer
Round : onsite / loop

The onsite loop was total 6 rounds and I will post here the only the coding question round :

Time was given : 45 mins and only one question been asked.

Question :

You do have two sorted array :

A = [1,2]
B = [3,4,5,x,y]

The size of last part of array B - [x,y] is the same size of A always . you have to replace last part of B with A and Sort B

Expected Result : [1,2,3,4,5]

here is restriction for the solution need to be done with two condition, these restriction are mandatory for your solution acceptance.

1. You can't create a new array for computation and inline computation need to be done.
2. You can't use any inbuilt method to sort.

Update:

Added detail experiece here : https://leetcode.com/discuss/interview-experience/1765664/facebook-data-engineer-feb-2022-meta-usa-waiting-for-result/1264989