Envié una solicitud electrónica. El proceso duró 1 día. Acudí a una entrevista en kikin (Berlín) en ene 2021
Entrevista
There are 30 questions and there are questions that are easy to answer and there are questions that are difficult to answer but on the whole they are solvable. Otherwise only technical questions are asked and no general questions.
Solicité el puesto a través de la recomendación de un empleado. El proceso duró 1 semana. Acudí a una entrevista en kikin (New York, NY)
Entrevista
kikin has a very warm and friendly startuppy atmosphere. The interview process was starightforward -- there was one technical interview, performed on a whiteboard, not more than 30 minutes. The questions are starightfoward, kind-of like just out of an algorithms textbook. They're fairly easy, I'd expect a sophomore in CS to be able to answer them well.
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 1 día. Acudí a una entrevista en kikin (New York, NY) en oct 2011
Entrevista
It was a offline coding exercise. I though it would be a phone interview screen or something. The recruiter sent me the questions and asked me to finish them in one hour. I was allowed to use any language, c, c++, Java or Python. They are all classic coding problems.
Preguntas de entrevista [2]
Pregunta 1
Write a method to find the longest sequence in an array of integers that adds to the largest sum.
A binary tree is a mirror image of itself if its left and right subtrees are identical mirror images i.e., the binary tree is symmetrical. In a programming language of choice, define a Tree class/C struct and an associated method to check if the tree is a mirror image.
