SDE - 1
Flipkart
3 rounds | 7 Coding problems
107 views
Interview preparation journey
Preparation
Duration: 12 months
Topics: Data Structures,OOPS, Algorithms, DBMS, SQL, Operating Systems, Networks, HTML, CSS, JS, NoSQL
Tip

Tip 1 : Be consistent and start early, I believe that consistency can beat smartness.
Tip 2 : Never underestimate yourself and surround yourself with good people who encourage you.
Tip 3 : If you're in any college society, maintain your schedule well and choose your priorities.

Application process
Where: Campus
Eligibility: No criteria
Resume tip

Tip 1: Never try to fake things in your resume, it will always come out.
Tip 2: Design your resume nicely using flowCV/Overleaf so that all the content is visible in one look.
Tip 3: Be well versed with whatever skills/projects you mention in your resume.

Interview rounds
01
Round
Hard
Online Coding Interview
Duration90 minutes
Interview date5 Oct 2021
Problems1

#### Given a linked list containing N nodes where each node is associated with a certain value. The list is the representation of the level orde...

view more
02
Round
Medium
Video Call
Duration60 minutes
Interview date20 Oct 2021
Problems2
Next Greater Number

#### You are given a string S which represents a number. You have to find the smallest number strictly great...

view more
Problem approach

Standard leetcode problem.

Find the Good Matrix

#### You have given a 2-dimensional array ‘ARR’ with ‘N’ rows and ‘M’ columns in which each element co...

view more
03
Round
Easy
Video Call
Duration60 minutes
Interview date21 Oct 2021
Problems4
Rotated sorted array search

#### You have been given an array of ‘N’ distinct integers which is sorted in ascending order and then rotated to the left by an unknown which y...

view more
Problem approach

Standard Binary Search problem.

Maximum of All Subarrays of Size K

#### You are given an array “A” of N integers. Your task is to find the maximum element in all K sized contiguous subarrays from left to right.

##### For Example:
view more
Problem approach

Foe each number at suppoe index i, find next greater on its left (suppose index j), and next greater on right (suppose index k). The answer will be (i-j)*(k-i).

Closest Distance Pair

#### 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
Problem approach

Binary Search.

BFS in Graph

#### You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0th vertex.

view more
Problem approach

Basic BFS approach.

Start a Discussion
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Flipkart
0 views
SDE - 1
3 rounds | 8 problems
Interviewed by Flipkart
435 views
SDE - 1
1 rounds | 3 problems
Interviewed by Flipkart
180 views
SDE - Intern
3 rounds | 4 problems
Interviewed by Flipkart
14 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
57334 views