J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Directi (Bengaluru) en juil. 2016
Entretien
1 online test with 3 easy-med questions.
FTF interviews -
Each interview round consists of one question/problem. Very similar to competitive programming format. The difficulty is medium-hard.
You're required to ace 1 medium and 1 hard interview.
The approach must be optimized and code is expected to be neat. You get 3 chances to clear.
Final round with manager - Depends on the manager. From maths to multithreading, they could ask anything to check if you fit the bill.
Expérience neutre
Entretien difficile
Candidature
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez Directi (Indore) en sept. 2017
Entretien
There was first a online test of coding on codechef website. It consists of 3 coding que . On dynamic programming, knapsack problem and one another. The package is of 25-27 lakhs per annum.
Questions d'entretien [1]
Question 1
Coding que.
Find smallest no. Form a given array which do not start with zero.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Directi (Rānchī) en août 2017
Entretien
Round 1:
Coding Round. 3 questions. Time 1.5 hrs. Platform: Codechef
Round 2 : 3 Algorithm Rounds of 50 minutes each. One Question each Round. A candidate to proceed to Round 3 must qualify in any of two rounds.
Round 3: Final Round. This is basically a managerial round in which a manager will interview you.
Questions d'entretien [1]
Question 1
A 2D grid is given of r rows and c columns. Each cell is filled with one color- R,G or B. Find the largest area of a triangle that has all the vertices of different color, and one of the side is parallel to the either of the axes.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 jours. J'ai passé un entretien chez Directi (Bengaluru) en août 2017
Entretien
1. Coding Round - 3 questions
2. 3 algorithm rounds of which you needed to clear 2
3. Technical Round where generic puzzles were asked, as well as questions based on the resume
Questions d'entretien [1]
Question 1
Given a sequence of integers, find the number of permutations of the array, which will give rise to the same binary search tree as the original sequence would.
