Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 dias. Fui entrevistado pela Directi (Bombaim) em ago. de 2017
Entrevista
1 online coding round 2 offline coding rounds, one system design Overall it was good round, they expected the final good solution didnt care much about the thought process or anything else
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 semana. Fui entrevistado pela Directi em set. de 2017
Entrevista
First an online round on codechef.com had to be cleared (Students who solved 2 out of 3 were selected). They typically have 3 algorithm rounds of which at least 2 need to be cleared in order to reach the final round
Perguntas de entrevista [3]
Pergunta 1
Finding out if an array of books can be separated into exactly 2 different sets, such that no 2 books of the same set are of the same genre.
There's an array of singers, each having their own pitch and cost. you need to remove singers until singers with the highest pitch are in the majority (make up more than half of the array), removing a singers incurs the cost associated with it. Find the minimum cost in which you can do this.
There are a set of balloons, each balloon has an associated cost with it. Popping a balloon incurs a cost of (assuming current balloon's index = i) cost(i - 1) * cost(i) * cost(i + 1), therefore the first and last balloon can never be popped. You have to pop all the balloons, find how to do this with maximized cost.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Directi (Rānchī) em ago. de 2016
Entrevista
There were 3 rounds-
1.Coding round was the first round and had 3 questions from graph theory,dynamic programming and an implementation question on strings.Anybody who solved at least two questions qualified for second round
2.Algorithm Interview round was the second round and various puzzles and algos were asked.
3.HR round
Perguntas de entrevista [1]
Pergunta 1
The first question asked to me was the Egg dropping puzzle.