Groww interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Groww
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I started learning DSA in the 4th semester of my college. Although I began comparatively late, I believe it's never too late to start. I had no background in Computer Science as it wasn't a subject in my 12th grade, making the start of college a bit challenging. Before my mid-semester of the 1st semester, I didn't even know how to perform basic input-output operations, which are fundamental to any programming language. Prior to joining Groww, I had attended multiple interviews without success. However, consistent practice helped me immensely in cracking this interview.
Application story
It was a campus opportunity, and I applied through my college. Initially, there was shortlisting for students with a CGPA of 7 or above. After that, there was an online assessment before the interview.
Why selected/rejected for the role?
The reason why I got selected was my good communication skills and not very anxious attitude. A lot of people get scared when their approach fails. Instead of fearing, start looking for alternative approaches and communicate with your interviewer. They are there to help you out and use their provided hints for your benefit.
Preparation
Duration: 3 months
Topics: Data Structures, Operating Systems, SQL, DBMS, Dynamic Programming, OOPS, Graphs, BFS, DFS, Algorithm
Tip
Tip

Tip 1: Practice every day.

Tip 2: Have at least one good project about which you are confident to discuss.

Tip 3: Don't focus on the quantity of questions, but on the quality. A person with 200 questions can perform better than someone with 500 questions.

Tip 4: Never give up.

Application process
Where: Campus
Eligibility: 7+ CGPA
Resume Tip
Resume tip

Tip 1: Have some good projects on your resume, and make sure you know everything about each project.

Tip 2: Any previous internship experience would look very good when applying to any company.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration70 minutes
Interview date8 Dec 2023
Coding problem1

It was around 8-9 PM in an online test environment. The platform was very good, with very fast compilation.

1. Operating System

02
Round
Medium
Video Call
Duration60 minutes
Interview date11 Mar 2024
Coding problem3

The event took place on Google Meet, approximately between 12 and 1 PM.

1. Rearrange a linked list

Moderate
22m average time
80% success
0/80
Asked in companies
AmazonIntuitOptum

You have been given a singly Linked List in the form of 'L1' -> 'L2' -> 'L3' -> ... 'Ln'. Your task is to rearrange the nodes of this list to make it in the form of 'L1' -> 'Ln' -> 'L2' -> 'Ln-1' and so on. You are not allowed to alter the data of the nodes of the given linked list.

For example:
If the given linked list is 1 -> 2 -> 3 -> 4 -> 5 -> NULL.

Then rearrange it into 1 -> 5 -> 2 -> 4 -> 3 -> NULL. 
Problem approach

So basically the question was to rearrange the linked list nodes alternatively, firstly I tried using Recursion, but later I found out I was doing something wrong, then I told the interviewer that I needed to change my approach and I thought Stack could be used to solve this, in return, he gave me hint that you should go with the stack. I was declaring two pointers that do the same thing so he asked me whether we needed to use both or we could do it with only one, I said we could use any of them and we don't need to create both of them, even one pointer would be fine.

Try solving now

2. Get maximum product of a list such that no 3 elements are consecutive.

Moderate
15m average time
85% success
0/80
Asked in companies
SamsungDunzoGroww

You are given an array A of length N consisting of positive integers. Your task is to print the maximum subsequence sum such that no three consecutive elements are taken from array A.

Note:

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements
Problem approach

So the problem sounded like a typical DP problem where we need to find the maximum and where we have a choice to include the current number or not, sounded like a variation of 0/1 knapsack. I just needed to track whether earlier I had 2 consecutive elements before my current elements or not, if yes then I can't take that element. But interviewer told me to optimize this as it was less efficient. I couldn't come up with another approach then he told me the problem could be done greedily and explained to me the solution.

Try solving now

3. Getting maximum product of 3 numbers in an array in O(n) time and O(1) space.

Easy
10m average time
95% success
0/40
Asked in companies
GrowwAmazonSnapdeal Ltd.

The Ninja squad aims to find 3 ninjas who are great collectively. Each ninja has his or her ability expressed as an integer. 3 candidates are great collectively if the product of their abilities is maximum. Given the abilities of ‘N’ ninjas in an array ARR[], find the maximum collective ability from the given pool of ninjas.

For Example :

Given N = 5,
and ARR[] = {1, 3, 5, 4, 2}
Therefore, we can see that three ninjas with ability 3,4 and 5 will give us the maximum ability and will be called great therefore the output will be 60. 
Problem approach

Very less time was remaining so the interviewer gave me this question and told me he wanted an optimized solution i.e. in O(n) time and O(1) space, so basically I told him that we could get the maximum 3 numbers or 1 maximum and 2 minimum, whichever comes greater will be my answer, then he asked me about the implementation, then I told him we can have 3 variables for maximum (highest, second highest, third highest) and 2 for minimum and for every new element we can just update maximum and minimum and the below minimum/maximum (like if I get a number greater than the maximum, I need to first give my third highest the value of second highest, second highest value of highest and update the highest with the current number).

Try solving now
03
Round
Easy
HR Round
Duration30 minutes
Interview date11 Mar 2024
Coding problem1

The online round was conducted via Google Meet.

1. HR Round

The interview mostly revolved around discussions regarding my projects and the project from my previous internship, as well as some concepts of Operating Systems. Additionally, I was asked about my favorite concept and why it stood out to me. There was also discussion about my favorite app and potential improvements that could be made to it, as well as questions about my hobbies and preferences.

Problem approach

Tip 1: Be confident and don't be anxious, try to maintain a good vibe environment with healthy discussion.
Tip 2: Again good Projects are very important.
Tip 3: The previous intern project should look like you had done something earlier.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
2 rounds | 5 problems
Interviewed by Groww
3405 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 3 problems
Interviewed by Groww
1309 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Groww
1905 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 3 problems
Interviewed by Groww
644 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15481 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15339 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10142 views
2 comments
0 upvotes