Candidatei-me por meio de recrutador(a). O processo levou 1 semana. Fui entrevistado pela AutoX (San Jose, CA) em mai. de 2019
Entrevista
The process was very quick. It took about a week to go on-site. I had a short conversation with their recruiter. Then a technical phone interview. Next step was onsite.
The onsite interview was very unprofessional. The recruiter came to the door to pick me up. He had just smoked cigarettes and smelled heavily which I found very annoying as the first impression.
The second noticeable point was that almost everybody was Chinese. It would be very difficult to work there if you are not Chinese.
The people who interviewed me were all engineers or interns. There was no manager, director or anyone from the upper management in the interview process which is very improper. The maximum work experience they had was less than a year.
Two of the last interviewers were very junior and barely able to write code. One of them gave me a question to solve, and I solved it mathematically which is the most efficient way to solve a problem. But he didn't understand it and asked me to write algorithm for that which is stupid, but I did.
In general, I saw AutoX very inexperienced and don't see much chances for such a company to survive competing with giants such as Tesla, Cruise or Waymo.
Perguntas de entrevista [1]
Pergunta 1
Shortest path, inverse kinematics, some design and some c++ programming questions.
Candidatei-me online. O processo levou 2 semanas. Fui entrevistado pela AutoX em jun. de 2019
Entrevista
I applied online and got a callback from the HR for an interview call. I had a one-hour coding interview for the first round. After that, I moved to the second round which was the onsite interview. This was a one-hour technical interview round each with 4 different engineers. The interviewers were well versed in their domain and asked questions based on the resume that testing my understanding of motion planning algorithms, data structures, and C++.
Perguntas de entrevista [1]
Pergunta 1
Breadth-First Search, Depth-First Search, Common Leetcode questions