Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso kikin (Berlino) nel mese di gen 2021
Colloquio
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.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso kikin (New York, NY)
Colloquio
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.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso kikin (New York, NY) nel mese di ott 2011
Colloquio
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.
Domande di colloquio [2]
Domanda 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.
