I applied through other source. The process took 2 weeks. I interviewed at Meta (New York, NY) in Mar 2018
Interview
The same old strategy... Linkedin contact, recruiter call, phone/coderpad interview... Later got an email rejecting. I got say, the guy that was interviewing was very junior, he even said that was his first job and he was there for 2 months and he is the one assessing new engineers. Well, I guess I didn't make the cut, but the fact that my code was the best solution for the question, they still rejected. I suspect the interviewer didn't know much about binary trees , more also, he was very confused when I asked him that my code will handle the cases where unbalanced binary trees are presented, which he said he wasn't aware of such type of "data structure" ...LOL what a joke.
Interview questions [1]
Question 1
Given a binary tree, find the longest path length in the tree.
The technical round hit me with a classic array manipulation problem: moving zeroes to the end without disrupting the order of non-zero elements. As I tackled it, I felt a wave of familiarity wash over me; I had just practiced a similar challenge on PracHub. The rest of the interview followed a straightforward path, with some easy behavioral questions sprinkled in. Overall, it felt very easy, but I wasn’t quite the right fit for what they needed, so I didn’t receive an offer.
Interview questions [1]
Question 1
Move zeroes in an array to the end while keeping non-zero element order, in place
1 leetcode med, 1 leetcode hard. make sure you know your DSA and leetcode questions. I wasn't able to get an offer bc i didnt complete the second question. Got a reply 2 days later saying they would move on