Groww came to our college (IIIT PUNE) for a 6-month internship program. The eligibility criteria for both CSE and ECE were 6.5 CGPA & above. The process was conducted in two rounds (Coding+Interview) only.
Coding Round: (12 MCQs and 2 Coding Questions).
- The 12 MCQs were based on basic aptitude and knowledge (Time complexity).
- The first coding question was a variation of the stock sell problem. (Maximum profit by buying and selling a share at most k times but for my question it was at most 1).
- The next question was Minimum Cost for Tickets(https://leetcode.com/problems/minimum-cost-for-tickets/) but here we were given the number of days in range 1 to 30 only.
Those who solved all the questions were selected for the interview round.
Interview Round: (DS/PS-based + core subjects+ Projects)
Only 14 students were selected for this round. We got the Google Meet link one day before the interview. It was for 1 hour and the interviewer tried to ask everything.
- The interview started with a basic introduction. He then asked about my favorite subject and about the project that I have done and the problem faced during the project. The interviewer seemed to be friendly.
- Then we came on to a DSA based question. I was given an array that has elements only in the range [0, n-1] where n is the size of the array. Some elements might be missing and some elements might be present more than one time in the range [0, n-1]. I was supposed to return the missing elements and duplicate elements separately. He only needed an approach that can solve his test cases only.
- Then he asked some questions based on the core subjects. He started with the DBMS and asked about the candidate keys, Unique keys, and Composite keys. He also asked about the term ‘indexing’. He also asked about the Normalization and their types and explanation about them. Then he asked about the difference between C and CPP language and also what is procedural language. Then he went on to OOPs and asked the difference between Structure and Objects.
- Then he asked me to explain tree data structure and their type and also what is Binary Tree and Binary Search Tree (BST). Then he asked me a DSA question i.e I was given a BST with only the number of nodes, the source, and the destination (root node was not given). I was supposed to find the minimum number of steps to reach from source to destination.
- The first question was if the given tree is one-directional.
- The second question was if the given tree is Bi-directional ( Can Solve using Graph).
- Then he asked about my project and demonstrate any of the projects.
Preparation Tips:
- Practice questions are a must to clear coding tests. As in for this job, only those candidates shortlisted for the interview round who solved all the questions in the coding round. So you should be prepared for this type of worst-case scenario.
- Also, focus on core subjects too.
- Never lose hope. Sometimes it is a matter of luck also. Keep faith in yourself and keep working hard.
- All the best!!
Recommended Articles