Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Grofers interview experience Real time questions & tips from candidates to crack your interview

SDE - 2

Grofers
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 1 month
Topics: Data structures, Threading and synchronisation, Kotlin vs Java, Activities lifecycle, Fragment lifecycle, Android services, Reduce APK size, Create analytics library
Tip
Tip

Tip 1 : Prepare easy/medium level data structures questions in leetcode. Solve atleast 50 questions of multiple types like strings, arrays, tree, linked list, graph
Tip 2 : Go through Android basic questions like lifecycle, live data, MVC/mvp/ mvvm pattern, retrofit, data binding
Tip 3 : Atleast solve 5 design questions like how to build Instagram, analytics library, crashlytics

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

Tip 1 : be concise 
Tip 2 : write only those keywords which you have in depth knowledge

Interview rounds

01
Round
Medium
Face to Face
Duration60 Minutes
Interview date2 Jan 2020
Coding problem1

Timing was around 11 am
Environment was great, it intrigued me to join Blinkit.

1. Pair Sum

Easy
15m average time
90% success
0/40
Asked in companies
AccentureGrofersOla

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.

Note:

Each pair should be sorted i.e the first value should be less than or equals to the second value. 

Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Problem approach

First approach : Loop inside Loop to figure out the sum of two numbers are equal to a constant number. But the complexity is N2 

Second approach : i used Map to store numbers. Before storing we just check rhta constant number - current number exist in map or not.

Second solution is approved

Try solving now
02
Round
Medium
Face to Face
Duration60 Minutes
Interview date9 May 2022
Coding problem3

Timing 11 am
Interviewer had good knowledge

1. Technical Question

Activity lifecycle

Problem approach

Tip 1 : Remember important methods and what is the used of every method

2. Technical Question

Fragment lifecycle

Problem approach

Tip 1 : Remember important methods and what is the used of every method

3. System Design Question

Explain MVVM pattern

Problem approach

Tip 1 : must have knowledge about MVC, mvp,mvi,mvvm patterns.

03
Round
Easy
Face to Face
Duration30 Minutes
Interview date11 May 2022
Coding problem1

This round is cultural fit round

1. Basic HR Questions

1. Why Blinkit?

2. Salary discussion

Here's your problem of the day

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

Skill covered: Programming

How do you write a single-line comment in C++?

Choose another skill to practice
Join the Discussion
1 reply
profile
11 months ago

Hi

0 upvotes
0 replies
Reply
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
1605 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS Associates
209 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
654 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
430 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 2
5 rounds | 12 problems
Interviewed by Walmart
23090 views
8 comments
0 upvotes
company logo
SDE - 2
3 rounds | 5 problems
Interviewed by Amazon
4990 views
0 comments
0 upvotes
company logo
SDE - 2
6 rounds | 8 problems
Interviewed by Amazon
3494 views
0 comments
0 upvotes