Me postulé a través de un reclutador. El proceso tomó 2 semanas. Acudí a una entrevista en IQLECT (Bengaluru) en sept 2016
Entrevista
I had two Face to face rounds. There was no telephonic round before.
The interview process was precise and to the point. They have a clear idea on what skills they are looking for. As this is a startup I expected the interview to be bit more tough, but they concentrated on the basics.
Preguntas de entrevista [1]
Pregunta 1
- Given a limited resource, comeup with the data structures and Algorithm which can give Top-K result(with high probability) when we have continuous stream inflow.
- Implement read write lock in Linux, where read can be in multiple but write should be only one.
- Get the Nth number which is divisible by 2 or 3 or 5 where the input is a continuous whole number sequence.
- Write an algo where we have to get through minimum number of blocks in a matrix with size n cross n. Each block can be either open or close. An API generates random number to open a block. Everytime there is a open, get the least path from row 1 to row n, where if a block is set only we can move either in north/east/west/south direction.
Me postulé en línea. El proceso tomó 3 días. Acudí a una entrevista en IQLECT (Bengaluru) en dic 2018
Entrevista
It was overall a good experience. Sachin Sinha is inspirational and you will have a great time interviewing with him. I had to go 3 days for 3 rounds which was a bit frustrating.
Preguntas de entrevista [1]
Pregunta 1
1. The depth of an n-ary tree. Full code
2. Finding the top K element in running stream of integers.
3. Findinf top k% of element in running stream of integers.
Next round.
1. Searching words in a Double Dimensional array consisting of characters.
-- I made using a visited array then he asked to make it without extra space.
2. Rat in a maze DP problem.
3. One more question which I dont remember.
Last round by CEO Sachin Sinha.
It was more on maths and numbers.
1. Some recursion problem on numbers then try to generate a series of a number [one path] from all possible path using some constraint so that you can always do it. Sort of generation of the private key. Real word example is of generation of credit card numbers. You can't simply increment your credit card number to get next credit card number.
2. https://www.geeksforgeeks.org/ugly-numbers/
-- I couldn't solve this. I was able to solve all other questions in every round.
Your round with CEO is the most important round.
Me postulé a través de otra fuente. Acudí a una entrevista en IQLECT (Bengaluru)
Entrevista
I got a direct call from company's HR and he scheduled the onsite interview. There were four onsite rounds. All the interviewers were very knowledgeable and friendly through out the interview process. They are solving very challenging problem. Their CEO is very passionate about what they are doing.
Preguntas de entrevista [1]
Pregunta 1
1 - You have been given an array of positive values. You are playing a game with someone. Every time you can choose an element from either of the ends and than that element is thrown away and now your opponent choose either of the element at the ends of new array.
Your target is to collect maximum sum of all choosen elements. What will be your strategy ?
Ans - DP
2. There is a chess board and you have been given two horizontal or vertical line segments (two points of each line segment). Identify whether a snake is possible with those two line segments.
Ans - Geometry question
3. There is an array where every element is the mark of a student. You need to give out candies such that every student should get atleast one candy and
student having greater marks than neighbour should get more candies than neighbour.
Ans- linear complexity
4. There is a matrix having 1/0. Find out biggest island made up of all 1 in the matrix.
Ans - DFS
5. Implement a reader-writer lock.
6. Puzzle - you are playing two chess game simultaneously with two opponents. 0, .5 and 1 points for loose, draw and win respectivly.
Tell the strategy to at-least win 1 point.
Ans - Copy move of first and second opponent for second and first chess board simultaneously.
