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

SDE - Intern

Flipkart
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Tree, Graph, Linked List, Stack, Queue, Array, String, Dynamic Programming, Backtracking, Binary Search.
Tip
Tip

Tip 1 : Practice More and More
Tip 2 : Focus on the quality of questions rather than the quantity
Tip 3 : Use pen and paper while doing practice and learn to dry run the code.

Application process
Where: Other
Eligibility: second year engineering student
Resume Tip
Resume tip

Tip 1 : Have some projects on your resume
Tip 2 : Do not put false things on your resume

Interview rounds

01
Round
Medium
Online Coding Interview
Duration30 minutes
Interview date30 Apr 2021
Coding problem0

The round was conducted on D2C platform.
The timing was between 2pm to 4pm.
The test duration was 30 mins.
There was no negative marking.

It was an MCQ round.

02
Round
Easy
Face to Face
Duration50 minutes
Interview date28 May 2022
Coding problem3

It was a face-2-face coding round.
The time of the interview was 3 pm.
The interviewer was very kind and supportive.

1. Closest Distance Pair

Easy
20m average time
0/40
Asked in companies
SamsungFlipkartAmazon

You are given an array containing 'N' points in the plane. The task is to find out the distance of the closest points.

Note :
Where dist...
View more
Try solving now

2. Find the special Nodes.

3. Good Nodes

Easy
15m average time
80% success
0/40
Asked in companies
MicrosoftOracleFlipkart

You are given the root node of a binary tree consisting of ‘N’ nodes. Your task is to find the number of good nodes in the given binary tree.

View more
Try solving now
03
Round
Medium
Face to Face
Duration60 minutes
Interview date28 Jul 2022
Coding problem2

It was conducted in the afternoon,
The interviewer was very kind and supportive.

1. Check for Duplicate Subtree

Hard
15m average time
85% success
0/120
Asked in companies
GoogleFlipkart

Given an arbitrary binary tree consisting of N nodes, each node is associated with a character value. Your task is to check whether there exist a pair of nodes such that their subtrees are equal.

View more
Try solving now

2. Longest Substring Without Repeating Characters

Moderate
20m average time
80% success
0/80
Asked in companies
Morgan StanleyInfo Edge India (Naukri.com)Adobe

Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.

Example:

Suppose given input is ...
View more
Problem approach

The second question was finding the longest substring with all the unique characters. I used the variable-sized sliding window algorithm to code it in the O(n) approach. She again seems to be very satisfied. Then I was again asked to dry run the algorithm against the given test case.
She clearly told me that brute force of this solution is very easy and she is not expecting me to come up wit...

View more
Try solving now

Here's your problem of the day

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

Is method overloading possible by changing the return type?

Start a Discussion
Similar interview experiences
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Flipkart
1326 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 2 problems
Interviewed by Flipkart
1106 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Flipkart
1524 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 4 problems
Interviewed by Flipkart
655 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
12646 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
11435 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
8476 views
2 comments
0 upvotes