Experience :
10 Aptitude based MCQ 3 Programming Questions 1. To print a pattern 2. To find the smallest and largest number by replacing number in given input n . you can only replace 5 or 6 to 5 or 6 . Example n 256 the smallest number 255 and largest 266 3. I do not remember the exact question. But the pre computation of prime numbers by sieve was sufficient to solve the question in required complexity. 1 Debugging Question
Tips :
You have to solve all the 3 programming questions to get into next round. All three question were easy and level of aptitude based question was also easy.
Round 3 Technical Interview
Experience :
Online interview on skype. Duration 1 hour 20 mins Started with Resume based questions like Tell me about yourself discussed about the projects which I have done. Then he asked me to code few programming questions. He expected a full error free code. 1. To check a string is palindrome or not. 2. To count number of words sentences in a file. 3. To maintain the count of each word alphabets in previous question. 4. There are large amount of numbers and you have to find the numbers which are occurred more than one time. First solution which I told him was that to keep the count of number in a array or by sorting the numbers . He told me that we cannot do that because the numbers are large. He asked me to use a different Data structure for it. Then I asked him about BST. we could store the numbers in BST. Then he asked me to code this solution. After all the programming questions we discussed more about my projects . I was asked question
s about Node.js and Angular.js As I had used these technologies in my Projects . Then he asked me about database.Mysql and Mongodb. Asked some simple queries of Mysql.
Tips :
They expected full error free code . While writing the code make sure that you do not make logical mistakes in code. Understanding of DS Algorithms is important
Round 4 HR Interview
Experience :
Online skype interview. Asked about my internship what technologies did I work on and the tasks which I performed . One programming question . He gave me a diagram in which there were a big rectangle. Inside which there were many rectangles . And a single dot was present inside. The question was to find the rectangle in which the dot is present.
Kapil Sharma
CSE Software Developer
2017
Round 1 Written Test
First there was an online test on codeground which had 10 aptitude questions 3 simple programming questions a debugging question and a subjective question. Programming questions were 1. Print a specific pattern 10 marks For n 5 2. Given 2 numbers where some 6s have been mistakenly written as 5s and 5s as 6s calculate the maximum and minimum possible sum 15 marks 3. Find sum of all values of a j a i where j i and j i is a prime number 35 marks Aptitude questions were quite easy too. 4 marks each 10 questions There was a debugging question where we had to correct a code for converting a Binary tree to Doubly Linked List. Finally there was a subjective question in which we had to write our strengths and an instance from our life where we demonstrated those strengths. 26 were shortlisted out of 450 for next round
About 150 students were found involved in plagiarism and were blacklisted from some companies. So don t try to cheat p Not much practice is required for this round as the questions were very easy
Round 3 Technical Interview
There were 2 technical interviews. Both of the interviews were on Skype. 1st interview was focused on data structures and algorithms. 1st Technical Interview I was asked just the one question http www.crazyforcode.com probability knight stays chessboard First I solved the question by recursion then the interviewer asked me to do the same using dynamic programming. Initially I was unable to apply DP so the interviewer gave me a hint of using 3D array and I was able to solve the problem. I had to write both these codes using recursion and DP on Skype chat. There were some minor errors in both the codes. Questions asked from other students 1. Check if a Binary tree is BST or not 2. Binary Search 2nd Technical Interview Second round had questions from puzzles DBMS 2 programming questions some conceptuals from c c Pass by values reference diff between array linklist diff between java python and c c and 1 or 2 resum
e based questions. They took my resume from codeground. 2 programming questions asked in 2nd interview were 1. Segregate 1s to the right and 0s to the left in an array I gave 2 solutions to the first problem both in O N time complexity one by counting no of 0s and 1s and then recreating the array other one by using two pointers one from starting and other one from the end and swapping the elements accordingly . 2. Print intersection of 2 arrays I gave 2 solutions in NlogM time complexity one using Set and other using a combination of linear search and binary search . Though the interviewer wanted an answer in O logN time complexity using HashMaps I was only asked the logic for both programs. I was not asked to write the code. DBMS A company has employees. An employee can also be a manager. Let A B C D E F G are employees such that A is manager for B C D and B is manager for E F G. Design database to store the given information. Write a query to retrieve
the names of employees working under any manager say A . Here answer will be B C D E F G. Puzzles 8 ball puzzle 5 ltr 3ltr jar puzzle 14 students were shortlisted after 1st interview and finally 8 were selected
Be strong on data structures and algorithms. A good knowledge of binary tree link list and dynamic programming should be enough.