I applied through an employee referral. The process took 6 weeks. I interviewed at Meta (Menlo Park, CA) in Mar 2018
Interview
Leetcode questions both phone and on-site, nothing too difficult or surprising. During the onsite I had 3 technical interviews, 1 of which was imperfect and the other I didnt properly finish the code but I still got an offer. My interpretation is that they care more that you are able to think reasonably and articulate and demonstrate your ideas effectively, more so than writing picture perfect code in the fastest amount of time. Be personable, clever and well-prepared (leetcode) and you'll be fine. Everyone is extremely friendly. Easily my favorite company I interviewed with.
Spoke with interviewer over video conferencing. He was very communicative . He answered my questions. Asked me BFS question. A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
Interview questions [1]
Question 1
A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
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
I applied online. I interviewed at Meta (Menlo Park, CA)
Interview
It's honestly striaght from leetcode tagged
There are no surprises if you do tagged you would be good and do well.
System design is much harder. Would recommend using hello interview.
Interview questions [1]
Question 1
Design Twitter and consider if it was suddenly an extremely low latency env