Round 1 -
-
It was on online coding round hosted on cocubes.com. It was a 75 mins round consisting of 3 coding questions only.
- given a number n and k. If the k bit in the binary representation of n is 1 then we have to make it 0 and return the new number formed else return n as it is.
- given a link list where each node in the link list represents a point in the xy plane, each node has 3 data members int x, int y, and a next pointer. We had to print the number of changes in slope if we start from the beginning and take two adjacents points and repeat it till the end.
- https://www.spoj.com/problems/AGGRCOW/ students doing 2 or more questions correctly headed towards the next round. From the total of 150 students around 30 of them cleared this round.
-
it was a group fly round, where 2 questions where given and 30 mins were the allotted time. It was a pen-paper round.
- Puzzle 16 | (100 Doors) exact question just there where 500 doors and people instead of 100.
- find the length of the biggest palindromic substring present in a string and print the palindromic string. People doing one question correctly and the other one partially correct were shortlisted for the next round. 8 students were selected after this round.
-
it was a technical interview round.
Firstly the interviewer asked me to introduce myself and then asked around 3-4 questions regarding my project. Then one by one the interviewer asked me 3 coding question they were-
- given an array of length (n-2) consisting of elements from 1 to n except for 2 elements are missing, find the missing elements.
- print all the possible permutations of a string.
- given a number, reverse it . Then the interviewer asked me a few questions on OOPS and even told me to implement them on paper. He then asked me a few questions about OS. Then he asked to subtract 2 numbers without using arithmetic operators and even the ++ and -- operators. Then he asked me a puzzle and ended the interview. The interview lasted for around 45 mins.