J'ai postulé via un recruteur. J'ai passé un entretien chez Meta
Entretien
I applied online,using the friendly Facebook career website.
I received an email followed by informal phone interview.Afterwards,I got the chance for a tech interview.
The first questions were a little general,tell me about yourself kind of thing.previous experience and the challenges faced.
There were 2 coding problems, one based on recursion,factorial kind of thing...
And afterwards ,a question on merging two sorted arrays in linear time.My approach solved the problem in quadratic time and was asked to improve it to the best I can.
At first I couldn't really see how;but the interviewer was really nice.He gave me hints to start with. At first I stumbled because I could not immediately get the whole idea.I kept on saying stuff without changing the code until I said the right thing and he agreed with me afterwards.
I am waiting to hear the outcome of the interview which I have hope I passed and will get the chance to work with such wonderful and humble people.I really liked the guy,so down to earth...I feel like crying right now...
1 code signal online assessment into 2 interviews with 2 leet code medium style questions around a 40 minute time frame as well as 1 behavioural interview with SWEs to gauge culture fit.
J'ai postulé en ligne. J'ai passé un entretien chez Meta
Entretien
really friendly recruiter and interviewer, screening interview 2 coding questions 45 minutes long. After that is one day of 3-4 interviews that are technical and one behavioral. It was a smooth experience
J'ai postulé via la recommandation d'un employé. Le processus a pris 5 jours. J'ai passé un entretien chez Meta (San Francisco, CA) en nov. 2016
Entretien
I applies online and got a reference. Soon after received an email to schedule a phone conversation for a technical screen. Did coding on coderpad on a question which was:
Find the minimum distance to a leaf node in a binary tree
Had a short conversation on resume and projects and what Im looking for as well.
Questions d'entretien [1]
Question 1
Find the minimum distance to a leaf node in a binary tree