Candidatei-me por meio de uma faculdade ou universidade. O processo levou 4 semanas. Fui entrevistado pela Ocient (University Center, MI) em jan. de 2020
Entrevista
Applied on-site at a career fair. They did the first round with me one on one. Afterwards, they went around the country to other career fairs and followed up a few weeks later.
Perguntas de entrevista [2]
Pergunta 1
They asked me to implement an interface for a scenario.
Candidatei-me online. Fui entrevistado pela Ocient (San Jose, CA) em jan. de 2021
Entrevista
One two hours OA, the questions were quite different from the regular leetcode problem, not hard but very trivious. One in person interview with two leetcode style technical questions that a lot people already talked: the DNA sequence problem.
Perguntas de entrevista [1]
Pergunta 1
Leetcode style questions, first question using arraylist and second question developed further with hashset.
Fui entrevistado pela Ocient (Reno, NV) em nov. de 2020
Entrevista
About a week after applying I received an online assessment on hacker rank. I expected it to be your usual leetcode questions but it ended up being a build an assembler test.
Perguntas de entrevista [1]
Pergunta 1
Build memory, parse machine instructions, and build a virtual machine.
Candidatei-me pessoalmente. O processo levou 3 semanas. Fui entrevistado pela Ocient (Chicago, IL) em jan. de 2020
Entrevista
I talked to recruiter at a campus career fair and was confirmed for an interview the next day. The interview was 1 hour with a fairly difficult HackerRank. It had 5 parts, each part building off of the previous and he told me from the start that most people don't finish. I managed to finish 3/5 and got an on-site interview a couple weeks later.
Perguntas de entrevista [1]
Pergunta 1
The HackerRank asked me to design an aggregate function that took in a column (a list) as input and outputted its aggregate (min, max, count, mean, sum). Then the parts after will build on it.
