Groww Interview Questions, Process, and Tips

Aptitude tests + 3 Rounds

Q1. Basic android questions on all current topics
Add your answer

2 Ds algo questions on arrays

Q1. Indepth Android and design a onComplete listener
Add your answer

Q1. Basic culture fit questions
Add your answer

Q1. Salary discussion and why i want to join.
Add your answer

Q1. Easy question ,Tell me about your self,what is your strength
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing- In the evening around 5 pm
Environment- It was online test so I was in my room comfortable.

Q1. 
Best Time To Buy and Sell Stock Problem Statement
You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...read more
Ans. 
The problem can be solved by using dynamic programming. 
But first explain the recursive approach also and tell the time complexity and then move on to the dynamic programming part.
Explain what are the subproblem and optimal substructure and then code the dp part.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Timing - 2pm
Environment - my room
Interviewer was pretty chilled.

Q1. 
Stack with getMin Operation
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...read more
Ans. 
Explain the two stack approach first and then move to the optimized version try writing a different function for min element apart from which is given in the geeksforgeeks.
Answered Anonymously
Add your answer

Array, string, linked list

Q1. HashMap, Linked List, Queue
Add your answer

Round duration - 65 minutes
Round difficulty - Medium

It was 24 hours window for the online round from 8 Oct 10:30 am to 9 Oct 10:30 am. There were 7 MCQ problems related to c++, java, DBMS, and operating systems. And 2 coding problems with one easy and one moderate level difficulty for question, we were supposed to write the whole program but for other question, the function was to be written only. I was able to solve the first problem fully and the second 50%, you are required to pass test cases.

Q1. 
Minimum and Maximum Candy Cost Problem
Ram is in Ninjaland, visiting a unique candy store offering 'N' candies each with different costs. The store has a special offer: for every candy you purchase, you c...read more
Ans. 
First Sort the price array. For finding the minimum amount start purchasing candies from starting and reduce k free candies from last with every single purchase.  For finding the maximum amount start purchasing candies from the end and reduce k free candies from starting in every single purchase.
Answered Anonymously
Add your answer
Q2. 
Word Break Problem Statement
You are provided with a continuous non-empty string (referred to as 'sentence') which contains no spaces and a dictionary comprising a list of non-empty strings (known as 'wor...read more
Ans. Brute Force Approach
We need to keep exploring the given string from current position ‘i’ to until we wouldn’t find a position such that substring ‘i’ to ‘j’ exists in the dictionary.
The algorithm looks like:
1. Store all words of the dictionary in unordered_map to speed up checking whether a current word exists in the dictionary or not?
2. If sentence size is ended then just return with a null string of list.
3. Else,
   1. You start exp...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The interviewer asked me questions about projects, general discussion, and 3 coding questions based on linked list, arrays, and binary tree.
I gave optimum approach for every question.

Q1. 
Delete the Middle Node from a Singly Linked List
Given a singly linked list of integers, the task is to remove the middle node from this list.
Input:
The first line of input includes an integer 'T' whic...read more
Ans. 
Step 1 : Take two pointers
Step 2 : Initialize both pointers to the head node and iterate one pointer by two and one by just one step
Step 3 : The pointer which is iterating by one step will reach the mid when other will reach the end.
Step 4 : Delete the mid pointer(which reached the mid).
Answered Anonymously
Add your answer
Q2. 
Problem Statement
Given an integer array ARR of size N, replace each element of this array with its corresponding rank.
Explanation
The rank of an element is an integer between 1 and N (inclusive) that ...read more
Ans. 
Step 1 : To compute the rank of the element first make a copy of given arr[] then sort that copied array in ascending order.
Step 2 : Then traverse in the copied array and put their rank in HashMap by taking a rank variable.
Step 3 : If the element is already present in HashMap then don’t update rank otherwise update rank of the element in HashMap and increment rank variable as well.
Step 4 : Traverse the given array arr[...read more
Answered Anonymously
Add your answer
Q3. 
Left View of a Binary Tree Problem Statement
Given a binary tree, your task is to print the left view of the tree.
Example:
Input:
The input will be in level order form, with node values separated by a...read more
Ans. 
We can keep track of the level of a node by passing a parameter to all recursive calls. The idea is to keep track of the maximum level also. Whenever we see a node whose level is more than the maximum level so far. We print the node because this is the first node in its level (Note that we traverse the left subtree before the right subtree).
Answered Anonymously
Add your answer