Candidatei-me online. O processo levou 1 dia. Fui entrevistado pela eBay (San Jose, CA) em jul. de 2011
Entrevista
They do a phone screen for about an hour. Then they will fly you in and there are 7 rounds of interviews. They put together a group of people for interviews and they come from different teams. Don't be fooled into thinking that you are going to be working with these people. They are architects, senior engineers from across the company. I ended up working with some people who less technically skilled and never worked with most of the people I interviewed with. Manager also takes an interview.
Perguntas de entrevista [4]
Pergunta 1
What do you know about concurrency? Describe in minute detail
Candidatei-me online. O processo levou 3 semanas. Fui entrevistado pela eBay (Boston, MA) em ago. de 2016
Entrevista
There are four round of Skype interview. Interviewer ask multiple fields including system design, SQL, basic java program questions. In each round of interview, there will be one interview and the time is about 1 hour. They ask me some java program question like Dynamic programming, interface design. And also they ask me some background questions.
Perguntas de entrevista [1]
Pergunta 1
In the first round, interview let me to design a customer risk management system. And describe a machine learning algorithm that I am familiar with.
Candidatei-me online. O processo levou 5 semanas. Fui entrevistado pela eBay (Bellevue, WA) em mar. de 2016
Entrevista
The recruiters are awful! Yikes.
Applied online. After a month a recruiter from SFO eBay office called me and said someone from Bellevue will reach out to me 'shortly'. After 1 month, the Bellevue recruiter called me and said he will schedule an interview right away. After 2-3 weeks another recruiter sent a mail on Friday evening saying my interview is on Monday!!!
I hope only the recruiters department sucks this much and the engineering department is much better.
Perguntas de entrevista [1]
Pergunta 1
1. Find the least common ancestor (LCA) in a binary tree. Pointer from node to parent is NOT present. Design the tree node and write the method that returns the LCA
2. Given a circularly rotated array [3 5 6 7 8 -3 -1 -1 1 2] design an algorithm to find an element in an efficient way.