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

SDE - 2

Groww
upvote
share-icon
5 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 1 Month
Topics: Javascript, jQuery, React, Data Structures, Algorithms, Problem Solving, System Design
Tip
Tip

Tip 1 : Focus more on JS basic concepts
Tip 2 : Go through react architecture and various design patterns
Tip 3 : Have a good github account to showcast your projects

Application process
Where: Linkedin
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Mention all the major tech stack you know
Tip 2 : Add your portfolio or project links

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 Minutes
Interview date26 Feb 2020
Coding problem1

Coding round

1. Design Question

Create and optimize a dashboard with socket connections of multiple holdings reference: Groww stock investment page

Problem approach

I used publisher and subscriber way to handle it using selectors with socket.io

02
Round
Medium
Face to Face
Duration60 Minutes
Interview date26 Mar 2020
Coding problem2

The round was for about 45mins

1. Sort 0 1 2

Easy
22m average time
0/40
Asked in companies
AmazonOracleWalmart

You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

Note :
Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
Problem approach

Tip 1: Brush up sorting and searching techniques
Tip 2: Solve more problem solving questions where array manipulation is involved

Try solving now

2. Delete middle element from stack

Easy
15m average time
85% success
0/40
Asked in companies
AmazonGrowwWells Fargo

You are having a stack "ARR" of size 'N+1', your task is to delete the middlemost element so that the size of resulting stack is 'N'.

A stack is a linear data structure where both insertion and deletion of elements take place at the top. It follows FILO (First In Last Out) or LIFO (Last In First Out) approaches. Books piled on top of each other is an example of a stack, where you can only remove a single book at a time, which is at the top of the stack. Likewise, you can only add a single book at a time, on the top of the stack only.

Example :-
INPUT : ARR [ ] = [ 1 , 2 , 3 , 4 , 5 ] , N = 4
OUTPUT: ARR [ ] = [ 1 , 2 , 4,  5 ]

The above example contains an odd number of elements, hence the middle element is clearly the (N+1) / 2th element, which is removed from the stack in the output.

INPUT : ARR [ ] = [ 5, 6, 7, 8 ] , N = 3
OUTPUT: ARR [ ] = [ 5, 7, 8 ]

The above example contains an even number of elements, so out of the two middle elements, we consider the one which occurs first. Hence, the middle element would be ((N+1) / 2 - 1) element, which is 6 and is removed from the stack in the output.
Try solving now
03
Round
Easy
Face to Face
Duration30 Minutes
Interview date26 Feb 2020
Coding problem1

The round focused more on the work I did in past and questions related to performance and optimizations. The round was taken by the team lead

1. Technical Questions

Asked several questions on the projects built and the ways we can increase the performance.
Asked questions related to SEO, Google Onetap login, optimizing network calls, reducing number of re-renderings, etc.

Problem approach

Tip 1: Just be confident and honest about the approach
Tip 2: Simply say no if you don't know about the question instead of manipulating the interviewer
 

04
Round
Easy
HR Round
Duration60 Minutes
Interview date27 Feb 2020
Coding problem1

This round was more of a managerial interview which was taken by the CTO of the company

1. Scenario based Questions

Asked questions about OKRs, my approach towards certain problems. Checked my abilities on managing people by giving certain scenarios

Problem approach

Tip 1: Just be you
Tip 2: Second question is formed from the previous answer so answer accordingly
 

05
Round
Easy
HR Round
Duration30 Minutes
Interview date27 Feb 2020
Coding problem1

HR round

1. Basic HR questions

Talked about my roles and responsibilities in prev org and reasons to switch. Did salary negotiations along with joining date

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-3
4 rounds | 4 problems
Interviewed by Groww
3543 views
0 comments
0 upvotes
company logo
SDE - 2
2 rounds | 2 problems
Interviewed by Groww
2142 views
0 comments
0 upvotes
company logo
SDE - 2
5 rounds | 7 problems
Interviewed by Groww
3458 views
1 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Groww
1504 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 2
5 rounds | 12 problems
Interviewed by Walmart
29570 views
8 comments
0 upvotes
company logo
SDE - 2
3 rounds | 5 problems
Interviewed by Amazon
6677 views
1 comments
0 upvotes
company logo
SDE - 2
6 rounds | 8 problems
Interviewed by Amazon
5175 views
0 comments
0 upvotes