First round technical 1 hour call. Interviewer had discretion to do anything so I was asked to design a computation graph. Asked questions about several design trade offs. Some standard graph problems were applicable.
Preguntas de entrevista [1]
Pregunta 1
Designing a computation graph. Some applicable graph problems.
The whole process doesn’t take much time. The first round is OA. The second round is phone interview. It includes one Markov chains problem and one coding problem. The last round takes one day. But the manager interviewer is not content with my performance. So the last round stops earlier. The final round takes up to 6 interviewer and each round includes coding problem.
Preguntas de entrevista [1]
Pregunta 1
A and B toss a fair coin. A - HTH, B - HTT. Any three-sequence has a match of A/B patterns, we have a winner. P(A=winner) = ? (Sol: Markov Chains)
