Designation: Member of Technical Staff - I
The placement process consisted of:
2 Written Rounds – Aptitude and Technical.
3 Technical Interviews.
1 HR interview.
Written Rounds:-
Aptitude Round: 50 minutes, 45 questions
The Aptitude questions were quite easy; it was more about your speed.
Technical Round: 1.5 hours, 3 Coding Questions
Finding total number of pair of elements (say, a and b) from elements in an array such that a (AND) b is 0. ( use brute force approach)
A CEO of a company wants to keep his employees happy. He can keep them happy if he has enough cookies in the pantry that are required at any time. The value at ith position indicates how much candies one person needs. A value Ci<0 means the employee needs cookies otherwise he keeps those cookies back in pantry.
Input: -5 4 2 -1 -6 -1 0 5
Output
8 (it should have been 7 but 8 was given so had to print ans+1 )
20 students were shortlisted for interviews.
Technical Interviews:-
Round 1: 25-30 minutes
Printing family tree level wise. Based on level order traversal in binary tree.
A question on Process Synchronization regarding printing the pattern aabbaabbaabbaabb..... by adding synchronization statements in dashed portions in funa() and funb() using binary semaphore only.
Void funa(){
Void funb()
{
...... ......
Cout << a; Cout << b;
...... ......
} }
Round 2: 60-70 minutes.
Tell me about yourself- just to get started.
A lot of discussion on my latest projects. My project was based on phishing email detection. He asked me to explain him my project as if to a layman
He asked me to describe a project I wanted to do but could not do due to time constraints. He further asked me to design the use case for my suggested project.
He asked me if I had done any non-academic activities in last 3 years.
Use cases for implementing t9 dictionary. I was not very clear about the question so I asked him to explain further and he explained he wanted to know different word suggestions I will include in the implementation.
I explained about spelling checks, abbreviation checks, randomization checks, etc. After getting sufficient number of use cases he asked me how I will implement these.
Data structure to be used to implement contact list manager of phone. Iexplained about advantages and disadvantages in using tries data structure and hash tables in the scenario.
Code to count total no. of subsets of nodes present in a n-ary tree. I told recursive approach first and then used Dynamic programming for optimizing my solution.
Round 3: 50-60 minutes.
The interviewer asked me to write codes for two problems:
Finding index of pivot element in a sorted but rotated array. He asked me an approach that will handle all corner cases. I told approach using modified binary search. After he was convinced my approach was correct, he asked me to write code for the same.
Given a number A, swap all odd and even bits in the number.
HR Interview (40-50 min):-
Asked me a problem I felt bad about and asked me to suggest a solution for it using Computer Science and counter questioned my solutions. As conveyed later by the interviewer this was to judge that whether I am capable enough to find problems in company’s software and suggest
solution accordingly.
Rest questions were regarding my career choices, family expectations, personal goals, handling moments of failure in life – Why your college while it was far off from my hometown? And alike.
I was just honest and frank speaking my heart to every question and he
was quite impressed by my rationality.