Hi Everyone,

I just wanted to share my experience with the Screening Interview for a postion in Facebook London.

The interview took place on November 12th, the interviewer was really nice, I think it represents what many people says that they want you to succeed.

We only had time for one question, it was similar to this one https://leetcode.com/problems/merge-sorted-array/ , the only difference was that there were 3 sorted arrays and the output shouldn't have any duplicates.

We started the discussion about the problem, at first I suggested to loop through each array using a Hash Set to take care of the duplicates but he wanted a solution with Space O(1) and in one loop only. At that point I suggested 3 pointers (one for each Array) and using the fact that the arrays were already sorted get the min value from each array, and by doing a Binary Search find the position were the number should go and validate if it exists. The interviewer mentioned that we could still do better, so after a few hints I kept the idea of the 3 pointer, store the value of the 3 arrays at the pointers positions and then get the min value from those, after that I'll save the previous inserted value, since the arrays are sorted I know that all duplicates values will come at the same time, and I'll move the pointer from the arrays that have the current value that was inserted.

At the end of the coding section we didn't have more time for another question, so it was my turn to ask a few things, and after that interview finished.

I'm still waiting for the response to know if it was enough for the Virtual On Site.

EDIT: Just received notice that I won't be moving forward to the Virtual On-Site interviews, so I guess it would be for a next time