Round 1 was conducted on hackerearth and consisted of 50 MCQ questions mostly on machine learning and probability and three coding questions. While shortlisting candidates they haven’t at all considered these MCQ questions and shortlisting was made purely based on coding questions. The three questions are
- You will be given an array and you have to print the biggest prime in the array – smallest prime in the array. Normal O(sqrt(n)) primality test gives timeout. Using the prime sieve solved the timeout problem.
- You will be given an array and you have to tell whether you could split this array into two identical parts or not. Eg: [1, 2, 2, 1] can be split to [1, 2] and [1, 2]. The logic is simple, every element has to occur even number of times for us to be able to split like that
- You will be given two numbers a and b. You have to tell the number of digits after decimal in (a/b). If it recurs you have to print infinite. This can be solved easily by kind of long division
Around 1200 people gave this test and they had shortlisted 50
The interviewer first asked me to write down my favorite subjects and I wrote data structures and algorithms. He started asking me questions
First one is sorting a linked list. I told him that sorting algorithms like selection sort or insertion sort can be implemented easily whereas O(nlogn) algorithms like merge sort and quick sort are difficult to implement and gave the reasons for that.
You will be given a stack and you have to sort the stack. You could use another stack if needed. I gave the solution after a bit of thinking.
You will be given an array and you have to find the number of subarrays whose sum is zero. If there are any you have to print the starting and ending index of each of the sub-array. I gave him an O(n ^ 2) approach and he asked me to optimize it. Later with a little bit of thinking I gave him an O(n) solution.
You will be given a binary search tree and you have to print the elements in sorted order. This is just the inorder traversal. So he asked me to print the elements in descending order without using inorder traversal. This is just Right, Root, Left or reverse inorder traversal.
After this, he asked me how do I find the kth largest element in a binary search tree. He gave me a hint that the answer comes from the previous question. The solution is simple to recur the reverse in order traversal k times to get the kth largest element :p
You will be given a binary search tree and a number n. You have to tell if there is a pair in this BST such that the sum of this pair is n. I gave him the conventional O(nlogn) approach with extra space. Then he asked me whether I could do it without extra space. Then it would be an O(n ^ 2) solution.
The next question is removing duplicates from a linked list. I gave him the approach with a set. He asked me to solve this without using extra space. I told him that we can sort the linked list and we can easily remove the duplicates with O(1) space.
The interviewer told me that he is sending me to the second round :p
This round lasted for about 1hr 15 mins.
This time the interview was with the Technical head. He scanned my resume and asked tons of questions on android. How I did my projects and the technologies that I had used in my apps. I answered almost all of them except some 2 or 3 questions. He started asking me questions on algorithms like bfs dfs etc and what’s the difference between them. This round lasted for 30 mins.
This is a kind of HR + Technical round where he asked me why I had used NoSql everywhere and what’s the main difference between NoSql and SQL. I gave him a clear picture of this. Then he asked some hr questions like every day at least 2 or 3 companies come to your college, why did you choose our company? I told him that since this is a product based company I’m very much interested in this. He asked some more questions like what are your future plans and mainly he asked me why is your cgpa very less. Its just 7.5 :p He asked me about my hometown etc. He asked me why I’m opting for a software company as I’m from electronics and I told that I love coding very much. He told me that the feedback is positive and you are selected :p
I felt very happy about the offer.
- Delhivery Interview Experience - 1 year of experience
- Delhivery interview experience | Set 2
- Delhivery Interview Experience | Set 3
- Delhivery Interview Experience | Set 4 (Off-Campus)
- Delhivery Interview Experience
- Delhivery Interview Experience for Backend
- Delhivery Backend Developer Interview Experience (Sept 2018)
- Delhivery Interview Experience for Backend Developer On Campus(Nov 2018)
- Amazon Interview Experience | Set 167 (SDE I for 1 year 6 months experience)
- Walmart Lab Interview Experience | Set 7 (Off-Campus 3 Years Experience)
- Walmart Lab Interview Experience | Set 8 (Off-Campus 3 Years Experience)
- Brocade Interview Experience | Set 2 (For Software Engineer 0-2.5 Years Experience)
- Amazon Interview Experience | Set 241 (1.5 years experience)
- Amazon Interview Experience | Set 242 (1 Year Experience)
- Amazon Interview Experience | Set 243 (2.5 Years Experience)
- Oyo Rooms Interview Experience | Set 3 (For Backend Engineer, Experience <=1yrs)
- Amazon Interview Experience | Set 248 (4.8 Yrs Experience for SDE II)
- Goldman Sachs Interview Experience | Set 23 (2+ years Experience for Java Developer Role)
- Amazon Interview Experience | Set 391 (SDE-2, 5.5 years Experience)
- Arcesium Interview Experience | Set 5 (3+ years experience - Developer profile)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.