Solicité el puesto por otro medio. Acudí a una entrevista en Directi en may 2015
Entrevista difícil
Solicitud
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 1 día. Acudí a una entrevista en Directi
Entrevista
I was shortlisted for Directi on campus recruitment. The shortlisting was done by a coding contest consisting of two algorithmic questions. After the shortlist there were 3 technical interview.
The two initial interviews were mostly algorithmic in nature .The interviews test knowledge of algorithms and writing accurate code.
The third tecchnical interview was a mix of design and algorithm questions.
El proceso duró 6 semanas.
Entrevista
Candidates were first shortlisted in a coding round conducted on codechef. This round was not very difficult. Then two telephonic (Skype) interviews followed in a gap of 10 days. In both interviews, I was given two algorithmic problems, first I had to discuss the solution, when the interviewer was convinced that the solution is correct, he asked me to code it on collabedit (online text editor). After these interviews, I was selected for the final round of interview. In final round, I was asked about my projects and also how would I improve their performance. The questions were a little difficult, but appropriate for the final round.
Preguntas de entrevista [1]
Pregunta 1
In final round, questions were mainly based on my projects. I had made a tic-tac-toe solver, in that I was asked about how would I reduce the no. of repeating or invalid moves to optimize it's performance.
Solicité el puesto por otro medio. El proceso duró 4 semanas. Acudí a una entrevista en Directi (Nueva Delhi) en feb 2015
Entrevista
I applied for role of intern offcampus through a contest ...the interview procedure took 1 month and had a total of 5 rounds.First four rounds were algorithmic and last round was supposed to be both algorithmic and based on projects,theory.
Preguntas de entrevista [1]
Pregunta 1
first round was a onilne algo round on codechef- a)bfs based question, b)greedy
doing one of the above was sufficient to get into next round
second round was also a onilne algo round on codechef-
a)easy dp problem b) tree problem to find sum of nodes of a subtree c) bit dp
doing atleast two was enough to get into next round
third round was a skype round
a)dfs b) dp problem
fourth round was also skype round
a)bst b)dp ..could not solve the first problem. was rejected