Solicité el puesto por otro medio. Acudí a una entrevista en FastFox.com (Allahabad) en jun 2017
Entrevista
The whole process consists of 6 rounds.
1st round is coding round Three coding questions are there(2 on dynamic programming and 1 on graph ) and all the remaining 5 rounds are Tech round F2F.
In 2nd round they asked the binary search and to derive its time complexities & 4 to 5 puzzles.
In 3rd round they asked all the questions on the graph only which is my weak point.
Bipartite graph
I'm not able to answer the questions in 2nd round they didnt call me for 3rd round
Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en FastFox.com en ago 2017
Entrevista
1st Round:
4 coding questions in 2 hours. It was held on their own IDE. The questions were tough.
2nd Round:
Technical Interview - 1 basic C++ question, 1 puzzle
3rd Round:
HR Interview
Preguntas de entrevista [1]
Pregunta 1
A number ending with 7 (abc..z7 where abc..z are numbers and can be of any number not necessarily 26) when multiplied by 5 changes to 7abc...z. Tell what is the number.
Solicité el puesto a través de un captador. El proceso duró 1 día. Acudí a una entrevista en FastFox.com (Gurgaon, Haryana) en ago 2015
Entrevista
There were three technical rounds.
Final round was taken by the CTO of the company.
The best thing about interview part was that they were focusing on the approach rather than final results.
Preguntas de entrevista [1]
Pregunta 1
Mirror of a Binary Tree,
Implementation of LRU cache
Some puzzles (25 Horses, 3 jugs problem 2 mores were also there ).
some questions related to bit manipulation.
Some basic OS fundamentals.
