Candidatei-me por indicação de um funcionário. O processo levou 3 semanas. Fui entrevistado pela Datadog (Paris) em abr. de 2017
Entrevista
J'ai été contacté par un recruteur à la suite d'une recommandation. Il m'a présenté l'entreprise, le processus de recrutement, etc. S'en sont suivis un entretien technique au téléphone, un devoir à rendre ainsi qu'une demi-journée sur site, composée de 3 entretiens (coding, design, cultural fit).
Le processus a pris moins d'un moins entre la prise de contact et la réponse positive. Toutes les personnes que j'ai pu rencontrer ont été très accueillantes, professionnelles et réactives.
Perguntas de entrevista [1]
Pergunta 1
Écrivez une fonction permettant de vérifier si les parenthèses contenues dans une chaîne de caractères sont équilibrées.
Candidatei-me online. O processo levou 1 semana. Fui entrevistado pela Datadog em jul. de 2020
Entrevista
Typical recruiter meet and greet where they then scheduled an hour-long technical assessment with a senior engineer. Through a zoom meeting, we went through a little bit of my background like my most notable project. Then we went straight to a coding quiz on coderpad. There were two questions. They were simple data structure manipulation type questions that involved hashes and arrays. I got through the first one pretty easily, but stumbled a bit on the second one, and unfortunately did not complete it. After the initial solution, they expect you to explain the time complexity of your functions. Unfortunately for me, I have no practical/theoretical experience with big O notation, so I stumbled through that with a lot of "I would have to look that up" type answers.
Overall it was a pretty okay experience, the senior engineer was cordial and gave leading advice if I got hung up somewhere while coding. However, as an industry, it's kind of sad we still evaluate technical skills through these leetcode and theoretical type scenarios. For someone that already has a job it's stressful to grind leetcode and memorize "Cracking the coding interview" in order to get the job you know you can do.
Perguntas de entrevista [2]
Pergunta 1
A question about a list of string that you need to transform into a hash. Then explain the time complexity. Also, explain memory usage of the function.
A question about nested arrays with links to other arrays. You need to understand recursion to get the most optimal solution. Then explain time complexity.
