Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 1 día. Acudí a una entrevista en Oxigen (Nueva Delhi) en oct 2015
Entrevista
The process started with a 40mins coding round on cocubes the questions were of very elementary level after this round 5 students were shortlisted for the next round. in the interview round few elementary question of c were asked and a little discussion about the project that i had done as a part of winter training project.
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 1 día. Acudí a una entrevista en Oxigen (Nueva Delhi) en nov 2016
Entrevista
The interview process started with the online coding competition on amcat or cocubes portal.
The questions asked were based on binary trees like adding a node or traversing, sorting linked list,etc.
After that shortlisted candidates went through F2F technical round.
After that there was a telephonic technical interview.
Final round was HR round.
Preguntas de entrevista [1]
Pregunta 1
In F2F round they asked about linked lists like traversing circular linked list, finding the centre of the linked list, sorting algorithms for arrays, OOPs concepts, binary trees, graphs,etc.
Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Oxigen en oct 2016
Entrevista
first round :Online coding test on Cocubes.com
Second Round:(F2F interview)
Third Round:(With the CTO)
He asked oops concepts
output related questions on virtual functions
what are virtual constructors
what are B trees can you code for that
what are avl trees?why they are used? He said he will ask me to write code for avl tree later but at the end he forgot :p
what are design patterns?
what are singleton classes? is there any keyword to define a singleton class in c
Preguntas de entrevista [1]
Pregunta 1
Q-1 Given two integers m and n write the function to compute the number of bit changes required to convert one to another
Example: m=14
n=15 answer : 1
Explanation : 24 : 11000
15: 01111
Q2.linked list multiplication: Given two linked list that represents polynomial
return a pointer to linked list which is multiplication of the two.