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

SDE - Intern

Flipkart
upvote
share-icon
3 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Journey
I started my coding journey from first day of collge, spent my first 3 years doing competitive coding. During my 3rd year applied to many companies, got link for coding round and solved all problems in most of them, still didn't get call for interviews, because of that I wasn't able to do any internship during my 3rd year. Same story repeated during 7th semester, was solving all coding problems and still wasn't getting call for interviews. Interviewing at Flipkart was my first tech interview and I was able to crack it with ease.
Application story
Flipkart visited our campus during first week of September. First was coding round which consisted of 3 problems, needed to be solved in 90 minutes, one was easy and two were medium, I was able to solve all the three problems. After that there were two technical interviews, you would be eligible for second interview only if you clear first one. Interviews were scheduled next day of coding round, and there was time of 2 hours between both the interviews.
Why selected/rejected for the role?
I think the main reason I was selected because I had good experience of doing competitive programming, I have solved nearly 4000 problems during my college, so interview process was easy for me and I was able to solve both the questions in both interviews in less than 30 minutes with clear explanation.
Preparation
Duration: 6 months
Topics: Data Structures, Algorithms, OOPS, Operating System , DBMS, Computer Networking, System Design
Tip
Tip

Tip 1 : Atleast go through most asked 300-400 questions by all companies.
Tip 2 : Before interview, go through all the problems asked by the company you are interviewing for.
Tip 3 : Do mock interviews during preparation.

Application process
Where: Campus
Eligibility: Above 7.5 CGPA
Resume Tip
Resume tip

Tip 1 : Have some good project on resume which you can explain in detail.
Tip 2 : Prepare everything that you have put in your resume.

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date5 Sep 2022
Coding problem2

Online round was from 3PM in the afternoon. It was an online round on hackerrank, we had to solve all three problems in 90 mintutes to qualify for next rounds.

1. Delete Node In A Linked List

Easy
15m average time
80% success
0/40
Asked in companies
AdobeCIS - Cyber InfrastructureDell Technologies

You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete that node from the linked list.

A singly linked list is a linear data structure in which we can traverse only in one direction i.e. from Head to Tail. It consists of several nodes where each node contains some data and a reference to the next node.

Note:

• The reference to the head of the linked list is not given.
• The node to be deleted is not a tail node.
• The value of each node in the Linked List is unique.
• It is guaranteed that the node to be deleted is present in the linked list.

A sample Linked List-

singly_linkedlist

Problem approach

Copy data of the next node to the current node
It's clear that The task question is wrong. You cannot delete the node.
Basically, instead of ONLY deleting the provided node we are not just doing it but CORRUPT the next node. It's a bad question wording (without clarification about options) and a bad solution. In my opinion, the correct answer for the interview is: "You CANNOT do this by having the node reference only. BUT we can make very similar operation by corrupting the next node. Although it's possible I don't recommend this solution for production applications.

Try solving now

2. 3Sum

Moderate
15m average time
85% success
0/80
Asked in companies
Info Edge India (Naukri.com)InfosysShareChat

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Problem approach

Steps to find closest 3 sum to the given target:

sort the array(through sorting we can increase the efficiency of the solution)
unless and until the array is sorted applying two pointer doesn't make sense.
use two pointer approach
make a left pointing next to i and a right pointer at the end of it
make a curr_sum variable
check for the condition if target - curr_sum < min_diff
if curr_sum > target than decrement the right pointer
else increment left pointer.
Time complexity - O(N^2)
space complexity - O(1) as no extra space required

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date5 Sep 2022
Coding problem2

The timing was 10 AM
The interviewer was very gentle

1. All Possible Balanced Parentheses

Easy
10m average time
90% success
0/40
Asked in companies
SamsungFlipkartGrab

You are given a positive integer 'N'. You have to generate all possible sequences of balanced parentheses using 'N' pairs of parentheses.

A sequence of brackets is called balanced if one can turn it into a valid math expression by adding characters ‘+’ and ‘1’. For example, sequences ‘(())()’, ‘()’ and ‘(()(()))’ are balanced, while ‘)(‘, ‘(()’ and ‘(()))(‘ are not.

For example :
For N = 1, there is only one sequence of balanced parentheses,  ‘()’.

For N = 2, all sequences of balanced parentheses are ‘()()’, ‘(())’.
Problem approach

The idea is to add ')' only after valid '('
We use two integer variables left & right to see how many '(' & ')' are in the current string
If left < n then we can add '(' to the current string
If right < left then we can add ')' to the current string

Try solving now

2. Minimum Sum in matrix

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

You are given a 2D matrix ‘ARR’ of size ‘N x 3’ having integers, where ‘N’ is the number of rows.

Your task is to find the smallest sum possible while taking one element from each row.

The rules for selecting elements are as follows-

1. In a row, after selecting an element at a given position, you cannot select the element directly below it
2. You can only select elements that are not directly below the previously selected element.
Problem approach

Dynamic Programming using Memoization =>

Start Point: 0, 0. Destination Point: M-1, N-1
Cost[i,j]: The cost to reach destination from (i,j). Matrix is initialized to inf.
The solution will be cost(0,0)
Initialize the cost matrix with boundary condition. cost[M-1,N-1]=grid[M-1,N-1]
Be careful with what you return for out of bound grid points. Make sure you return infinity so that they are ignored within the min equation
Time and Space Complexity: O(MN)

Try solving now
03
Round
Medium
HR Round
Duration30 minutes
Interview date6 Sep 2022
Coding problem4

The timing was around 10 AM
Interviewer was very humble and gentle.

1. Basic HR Questions

Tell me about yourself?

Problem approach

Tip 1) Do not ask the interviewer what he wants to know about you. You may be asking genuinely, but that just 
sounds rude.
Tip 2) Do not speak what is already there in the resume. The interviewer wants to know what they have not 
seen on the resume. And do not speak about anything personal.
Tip 3) Introduce yourself by including certain adjectives like problem-solving, innovation and tech-savvy, 
creative, quick learner, etc. that best describe you in your professional life to boost your chances.

2. Basic HR Questions

Why do you want to work for our company?

Problem approach

If you have had to handle private information in past roles, discuss that. If not, talk about a time when you were privy to private information while helping a colleague. Focus on your ability to work with integrity and a respect for people’s privacy.

3. Basic HR Questions

Why do you want to work for our company?

Problem approach

Tip 1 : Talk about the past projects that you had worked on that matches the requirements of the current role.
Tip 2 : Talk about your career aspirations that are associated with this job role.

4. Basic HR Questions

Why should we hire you?

Problem approach

Tip 1 : How well you would perform the job and how you would be a great addition to the team.
Tip 2 : How you possess the right talent which makes you stand apart.
Tip 3 : Everything should boil down to how you can add great value to the organization.

Here's your problem of the day

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

Skill covered: Programming

Which SQL clause is used to specify the conditions in a query?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Flipkart
1992 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 2 problems
Interviewed by Flipkart
1638 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Flipkart
2097 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 4 problems
Interviewed by Flipkart
1119 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15293 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15116 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10047 views
2 comments
0 upvotes