Internship
Interview Date
Not Specified (Process for 2021-2022 session) [cite: 1]
Result
Selected (8 students picked up) [cite: 1]
Difficulty
Medium
Rounds
2 rounds (Coding + Interview) [cite: 1]
Drive Type
On-Campus, Internship [cite: 1]
Topics asked
Detailed experience
College: IIITN (IIIT Nagpur) [cite: 1]
Interview Date: Not Specified (Process for 2021-2022 session) [cite: 1]
Interview Type: On-Campus, Internship [cite: 1]
Result: Selected (8 students picked up) [cite: 1]
Difficulty: Medium
Rounds: 2 rounds (Coding + Interview) [cite: 1]
Topics Asked: Aptitude, Data Structures, Algorithms, DBMS, OOPs, Machine Learning (project-based) [cite: 1]
Groww visited IIITN for a 6-month internship program, initially planning to hire 5 students but eventually selecting 8. The eligibility criteria for both CSE and ECE were 7 CGPA & above. The process consisted of two rounds: a Coding Round and an Interview Round. [cite: 1]
Coding Round: This round had 10 MCQs and 2 coding questions. The MCQs were easy, focusing on basic aptitude and general knowledge. The first coding question was a variation of the stock sell problem (maximum profit by buying and selling a share at most once). The second coding question was "Minimum Cost for Tickets" (LeetCode problem, but restricted to days in range 1 to 30). Only candidates who solved all questions were shortlisted for the interview round, with even a single MCQ wrong leading to rejection. [cite: 1]
Interview Round: This round was 1 hour long and involved a Google Meet call. It started with a basic introduction. The interviewer then asked about the candidate's interest in machine learning and challenges faced in a machine learning project (Automatic Attendance System). A DSA-based question was given: "Given a list with elements only in the range [0, x) where x is the size of the list. Some elements might be missing, and some might be present more than once. Return the missing and duplicate elements separately." The interviewer was looking for an O(N) time and O(1) space complexity approach. The candidate initially thought of sorting but then provided the optimized approach and dry-ran it for about 5 test cases. Following this, questions on core subjects were asked, including DBMS (candidate keys vs. unique keys, indexing, data structures used for indexing) and OOPs (benefits of OOPs). Another DSA question mentioned was about a BST with only the number of nodes, source, and destination, without the root node. Finally, the interviewer inquired about job preferences (ML, Backend, etc.). [cite: 1]