Grofers is an Indian online grocery delivery service. It was founded in December 2013 and is based out of Gurugram. As of 2018, the company has raised about $535.5 million from investors including SoftBank, Tiger Global and Sequoia Capital.
It has got a 3.8* rating on Glassdoor and is considered one of the best product-based companies. It is highly regarded for its work-life balance.
They provide good training as well which will be beneficial in future too. You can practice the below questions collected from Grofers Interview Experience for the interview. We have collected past frequently asked questions from Grofers Interview Experience for your reference.
Categories of Questions
Grofers Array Questions
Question 1. Maximum sum bitonic subarray Problem Statement An array having n integers is given to us. We need to find the maximum sum bitonic subarray. A bitonic subarray is nothing but just a subarray where the elements are arranged in a specific order. Such that the first elements are in increasing order and then in ...
Question 2. Insertion Sort Sort a given unsorted array using the insertion sort algorithm. Input: {9,5,1,6,11,8,4} Output: {1,4,5,6,8,9,11} Theory Insertion Sort sorts numbers in the same way as we humans sort a set of numbered objects (ex cards) A number is taken from an unsorted array (right subarray) to a position in the sorted ...
Grofers String Questions
Question 3. Split Four Distinct Strings Problem Statement In the “Split Four Distinct Strings” problem we have to check if the given input string can split into 4 strings such that each string is non-empty and different from each others. Input Format The first and only one lone containing string “s”. Output Format Print “Yes” if ...
Question 4. Caesar Cipher Description The Caesar Cipher technique is one of the earliest techniques of encryption. Here, for each letter in the given text, it is replaced by a letter some fixed number of positions down the alphabet. If n = 1, replace A with by B, B would become C, and so ...
Grofers Tree Questions
Question 5. Convert a normal BST to Balanced BST Problem Statement Given a Binary Search Tree(BST), write an algorithm to convert the BST to a Balanced Binary Search Tree. A balanced Binary Search tree is nothing but a binary search tree whose difference between the height of left subtree and right subtree is less than or equal to 1. ...
Question 6. Reverse a Path in BST using Queue In reverse a path in BST using queue problem we have given a Binary Search Tree and node, write an algorithm to reverse the path from root to the given node. Assume that the node exists in the BST. Example Input Target Node = 12 Output In-order traversal before the ...
Question 7. Print a Binary Tree in Vertical Order In this problem, we have given a pointer denoting the root of the binary tree and your task is to print the binary tree in the vertical order. Example Input 1 / \ 2 3 / \ / \ 4 5 6 7 \ \ 8 9 Output 4 2 ...
Grofers Queue Questions
Question 8. Reverse a Path in BST using Queue In reverse a path in BST using queue problem we have given a Binary Search Tree and node, write an algorithm to reverse the path from root to the given node. Assume that the node exists in the BST. Example Input Target Node = 12 Output In-order traversal before the ...
Grofers Other Questions
Question 9. Merge Sort What is merge sort? Merge Sort is a Recursive Procedure. It is also a divide and conquers algorithm. Now we need to know what divide and conquer algorithm is? It’s a type of procedure in which we divide the problem into subproblems and divide them until we find the shortest ...