Candidatei-me por indicação de um funcionário. O processo levou 1 dia. Fui entrevistado pela Chatous (San Francisco, CA) em fev. de 2015
Entrevista
Interview was very easy. Anyone with basic coding skills would be able to pass this one. They consist of basic algorithmic and data-structure based questions. Serializing an N-Ary tree and finding the longest run in a stream of numbers.
Perguntas de entrevista [1]
Pergunta 1
Questions were about finding the longest run in an infinite stream of numbers and serializing a n-ary tree to a string.
Candidatei-me online. O processo levou 3 semanas. Fui entrevistado pela Chatous (San Francisco, CA) em jun. de 2016
Entrevista
Casual Phone Screen, Tech Phone Screen, In Person
Disorganized, lots of rescheduling, seems like the process is a little chaotic and not yet streamlined
Tech Screen was unfortunately not done by an engineer
Perguntas de entrevista [1]
Pergunta 1
Classic algorithmic questions ranging from easy to hard - fibonacci, local maximum, mode of infinite stream, number of ways to score problem