Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Flipkart Team. If you also belong to the team, you can get access from here

Flipkart Verified Tick

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Flipkart SDE-2 Interview Questions, Process, and Tips

Updated 23 Oct 2024

Top Flipkart SDE-2 Interview Questions and Answers

  • Q1. Maximum Path Sum Problem Statement You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf n ...read more
  • Q2. Problem: Sort an Array of 0s, 1s, and 2s Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in incre ...read more
  • Q3. Design a system for BookMyShow to allow users to book movie tickets.

Flipkart SDE-2 Interview Experiences

4 interviews found

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 23 Oct 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - Coding Test 

That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.

SDE-2 Interview Questions & Answers

user image Shubham Jain

posted on 14 Jan 2023

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

2 Coding questions both easy-medium level.
1. Based on the Sliding Window
2. Graph Question

Round 3 - Assignment 

A simple feed platform, which supports some basic functionality. The main point of this round was to see how well a candidate architect the application.

Round 4 - One-on-one 

(4 Questions)

  • Q1. Basic discussion around the project & past experience.
  • Q2. Design a 2/3rd Winning game.
  • Ans. 

    Design a 2/3rd Winning game.

    • The game should have a clear win condition

    • The win condition should be achievable in 2/3rd of the total game time

    • The game should have a balanced difficulty level

    • The game should have a clear feedback system for the player

    • Examples: Chess, Tic Tac Toe, Connect Four

  • Answered by AI
  • Q3. Discussion around how would you scale a application.
  • Q4. NoSQL vs SQL difference
  • Ans. 

    NoSQL is non-relational and schema-less while SQL is relational and has a fixed schema.

    • NoSQL databases are horizontally scalable and can handle large amounts of unstructured data.

    • SQL databases are vertically scalable and are better suited for structured data with complex relationships.

    • NoSQL databases are often used in web applications, while SQL databases are commonly used in enterprise applications.

    • Examples of NoSQL d...

  • Answered by AI
Round 5 - One-on-one 

(3 Questions)

  • Q1. Hiring Manager round
  • Q2. Basic discussions around past work, past processes, what are your future aspirations etc.
  • Q3. This round was mainly for seeing the culture fitment of a candidate.

Interview Preparation Tips

Topics to prepare for Flipkart SDE-2 interview:
  • Data Structures
  • Algorithms
  • System Design
  • Microservices
  • Java
  • Spring Boot
Interview preparation tips for other job seekers - Prepare well for Data structures & Algorithms.
Along with that, you should be well-versed in System design concepts.

Skills evaluated in this interview

SDE-2 Interview Questions Asked at Other Companies

asked in Walmart
Q1. Maximum Frequency Number Problem Statement Given an array of inte ... read more
asked in Atlassian
Q2. K Most Frequent Words Problem Statement Given an array of N non-e ... read more
Q3. Reverse String Operations Problem Statement You are provided with ... read more
asked in KhataBook
Q4. Alien Dictionary Problem Statement Ninja is mastering an unusual ... read more
asked in Zoho
Q5. Make Palindrome Problem Statement You are provided with a string ... read more

SDE-2 Interview Questions & Answers

user image ankur kumar

posted on 1 Feb 2023

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
Not Selected

I applied via Referral and was interviewed in Jan 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Assignment 

This was a machine coding round in which we have to implement an online cab booking service.

Round 3 - Coding Test 

Standard problem solving round consists of two questions on tree and dp.

Interview Preparation Tips

Interview preparation tips for other job seekers - 1.Do not take input as given,focus on implementing the services first.Take comma separated input also.

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 17 May 2022

I was interviewed in May 2021.

Round 1 - Coding Test 

Round duration - 120 minutes
Round difficulty - Medium

it was morning 10AM-12
friendly environment given by the interviewer
It was machine coding round, the problem statement was to create a online food ordering system with various features.
interviewer was good and supportive

Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

timing noon 3-4Pm
good interviewer 
interviwer was giving hints if required and all

  • Q1. 

    Problem: Sort an Array of 0s, 1s, and 2s

    Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.

    Input:

    The input sta...
  • Q2. 

    Maximum Path Sum Problem Statement

    You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.

    Example:

    Input:
    For the giv...
Round 3 - Video Call 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Easy

evening 4-5:30PM
interviewer was good
very supportive and giving hints

  • Q1. Design a system for BookMyShow to allow users to book movie tickets.
Round 4 - HR 

(2 Questions)

Round duration - 40 Minutes
Round difficulty - Easy

4-5 PM
Interviewer was good

  • Q1. Why should we hire you?
  • Q2. Why are you considering a switch in your job?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriano criteriaFlipkart interview preparation:Topics to prepare for the interview - Data Structures, DBMS, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Practice Atleast 200 Questions
Tip 2 : Practice company specific interview question
Tip 3 : Prepare resume nicely

Application resume tips for other job seekers

Tip 1 : Prepare resume very nicely.
Tip 2 : don't mention any tech stack you are confident of.

Final outcome of the interviewSelected

Skills evaluated in this interview

Flipkart interview questions for designations

 SDE

 (5)

 SDE-1 Position

 (1)

 SDE (Software Development Engineer)

 (2)

 Data Engineer 2

 (1)

 Application Engineer 2

 (1)

 Product Solution Engineer 2

 (2)

 User Interface Engineer 2

 (2)

 Senior Software Engineer 2

 (1)

Interview questions from similar companies

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 16 Sep 2021

I was interviewed in Apr 2021.

Round 1 - Video Call 

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 10AM-11AM
Interviewer was quite supportive and helpful.
Environment was normal as usual and it was morning time

Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 11AM-12PM
The interviewer was SDE2
He was checking the code for edge cases and was hinting if required

  • Q1. 

    Implementing a Priority Queue Using Heap

    Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...

  • Ans. Array representation of heap

     

    1. Since the heap is maintained in the form of a complete binary tree, the heap can be easily represented in the form of an array.
    2. To keep the tree complete and shallow, while inserting a new element insert it in the leftmost vacant position in the last level i.e., at the end of our array, and perform some operation to maintain the property of the heap.
    3. Similarly, for deleting the maximum e...
  • Answered Anonymously
  • Q2. 

    Ninja and the Bulbs Challenge

    Ninja owns an electronic shop and possesses 'N' bulbs. To verify the quality of the bulbs, Ninja performs a unique technique. After 'N' rounds of this process, bulbs that rem...

  • Ans.  Brute Force

    Approach:

    A brute force solution to this problem is to turn on and off the bulbs N time, then at last check the number of bulbs that are on.


     

    Algorithm:

    • Take a boolean array of ‘BULBS’ of size N+1.
    • Itertate on ‘i’ from 1 to ‘N’
      • Iterate on ‘j’ form ‘i’ to ‘N’ and each time increment ‘j’ as ‘j’ += ‘i’.
        • if(BULBS[j] == true) then make it false.
        • If (BULBS[j]==false) then make it true.
    • Intialise a variable ‘COUNT’ =...

  • Answered Anonymously
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

Timing: 6PM-7PM
The interviewer was not interactive and didn't gave any feedback whatsoever.
It was Hiring Manager Round
Interviewer was Software Development Manager at Amazon

  • Q1. 

    Maximize the Sum Through Two Arrays

    You are given two sorted arrays of distinct integers, ARR1 and ARR2. If there is a common element in both arrays, you can switch from one array to the other.

    Your task...

  • Ans. Recursive

    In this problem, our primary focus is on the common elements i.e. an element that is present in both the arrays. Then, we have to decide whether we have to make a switch. So for that, first we store all the elements of ‘ARR1’ and ‘ARR2’ into ‘MAP1’ and ‘MAP2’ respectively. 

     

    Now we call our ‘maximiseSumHelper’ function. We call this function for both cases i.e starting with ‘ARR1’ and starting with ‘A...

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from A. C. Patil College of Engineering. I applied for the job as SDE - 2 in BangaloreEligibility criteriaAbove 2 years of experienceAmazon interview preparation:Topics to prepare for the interview - Linkedlist, BST, Heap, Queue, Pointers, Binary SearchTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Focus on internals of Data structure on how it actually works
Tip 2 : Implement the Data Structure from scratch, later you can use the inbuilt packages no problem but you must know the implementation
Tip 3 : Understand System Design concepts

Application resume tips for other job seekers

Tip 1 : Highlight your contributions you made and how it impacted the business and be real
Tip 2 : Mention the improvement figures like x% reduction in page load size, improved SEO ranking by x figure, reduce memory usage by y%

Final outcome of the interviewRejected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Uber user image Anonymous

posted on 15 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

It was a telephonic interview at 10 in the morning. Interviewer seemed cool.

  • Q1. 

    Best Insert Position for a Target in a Sorted Array

    You are provided with a sorted array A of length N consisting of distinct integers and a target integer M. Your task is to determine the position where ...

  • Ans. Brute Force
    • Iterate through the given array.
      • If at any position i, we get A[i] ≥ M, return i.
    • If there is no such position i, return N.
    Space Complexity: O(1)Explanation:

    O(1).

     

    As there is no extra space required.

    Time Complexity: O(n)Explanation:

    O(N), where ‘N’ is the length of the given array.

     

    We are traversing the array only once. Hence, the overall complexity is O(N).

  • Answered Anonymously
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The interview was in the morning at 10 AM in the office meeting room.

  • Q1. 

    House Robber Problem Statement

    Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...

  • Ans. 

    Didn't get enough time to code the solution but explained the approach
    We can do this using DP
    We can maintain 2 arrays - one represents the ans if we start from first house and the other represents the answer if we start. from the second house.Then simply looping over the array and calculating these array's elements.

  • Answered Anonymously
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 11 AM in the meeting office.

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. 

    Started with the brute force solution of insertion sort
    Interviewer asked to optimize.
    Gave the solution which uses two heaps - max heap and min heap. the difference in size of both heaps cannot be more than 1. And we might need to remove elements from one heap to other heap as more input numbers are added

  • Answered Anonymously
Round 4 - Face to Face 

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 1 AM.

Round 5 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

The meeting was at 2 PM in the office meeting room.

Round 6 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

10 AM

  • Q1. Can you provide a deeper discussion about all the projects you completed in your previous company?
  • Ans. 

    Tip 1: Know well about the projects that you have done in the past

     

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in HyderabadEligibility criteriaNoUber interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Graphs, Dynamic programming, Trees, stack, queue, System DesignTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be consistent in the preparation. Practice atleast one question everyday
Tip 2 : Make relevant notes that you can go through on the day before the interview
Tip 3 :Try to note your progress by giving timed contests

Application resume tips for other job seekers

Tip 1 : Clearly mention the details of the projects that are relevant to the company that you are applying for
Tip 2 : Ensure that there are no grammatical mistakes and that you have highlighted the important keywords in your resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 1hour
Round difficulty - Hard

  • Q1. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

Round 2 - Face to Face 

(1 Question)

Round duration - 1hour
Round difficulty - Hard

  • Q1.  Stack using queue

    Mvvm architecture

Round 3 - HR 

Round duration - 1hour
Round difficulty - Easy

Interview Preparation Tips

Eligibility criteriaNo year gapBig Basket interview preparation:Topics to prepare for the interview - Core Java, android topics , Hacker coding test , ecommerce domain knowledge, data structure , algorithmsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : be confident
Tip 2 : always say truth about your experience
Tip 3 : don't be nervous

Application resume tips for other job seekers

Tip 1 : mentioned project u worked on 
Tip 2 : technical skills

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 16 Sep 2021

I was interviewed in Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Started with brief intro(5 mins) about interviewer.
Problem solving question, question was already there in the codelink shared by the interviewer. He explained the problem again with sample testcase. 
The Interviewer was friendly.

  • Q1. 

    Course Schedule II Problem Statement

    You are provided with a number of courses 'N', some of which have prerequisites. There is a matrix named 'PREREQUISITES' of size 'M' x 2. This matrix indicates that fo...

  • Ans. Breadth-First Search

    Our current algorithm is based on the idea of the BFS approach. We first process all the courses with 0 in-degree implying no prerequisite courses required. If we remove all these courses from the graph, along with their outgoing edges, we can find out the courses/nodes that should be processed next. These would again be the nodes with 0 in-degree. We can continuously do this until all the courses h...

  • Answered Anonymously
  • Q2. Design a live video broadcast platform.
Round 2 - Video Call 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 2 interviewers(India HM and Seattle HM), India HM was just shadowing and didn't ask any questions. Started with intro, he asked in detail about what I do at current company(10 mins). Again, jumped into LP's(25 mins).

  • Q1. 

    Distance Between Two Nodes in a Binary Tree

    Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...

  • Ans. Naive Approach

    In any rooted tree, the distance between two nodes 'U' and 'V' can be found by finding the lowest common ancestor (LCA), ‘x’ of two nodes. The lowest common ancestor (LCA) between nodes 'U' and 'V' is defined as the lowest node in the tree that has both 'U' and 'V' as descendants, where we define each node to be a descendant of itself (so if 'U' has a direct connection from 'V', 'V' is the lowest common a...

  • Answered Anonymously
  • Q2. 

    Median in a Stream Problem Statement

    Your task is to determine the median of integers as they are read from a data stream. The median is the middle value in the ordered list of numbers. If the list length...

  • Ans. Brute force approach

    Store the incoming data elements in a vector. Sort the vector everytime you need to output the median.

    Algorithm:

    1. Store the incoming elements of the data stream in a vector.
    2. Step by step insert one element and sort the vector as soon as any element is added in the vector.
    3. If the size of the vector is odd, print the middle element of the sorted vector.
      If the size of the vector is even, return the mean of...
  • Answered Anonymously
Round 3 - Telephonic Call 

Round duration - 60 minutes
Round difficulty - Medium

There was only 1 interviewer in this round and We had no video sharing in this round so it was becoming difficult to understand each other.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in SeattleEligibility criteriaNAAmazon interview preparation:Topics to prepare for the interview - Data Structures - Trie, HashMap, Sets, Priority Queue, Stack, Advanced Topics like Fenwick Tree, Segment Trees, Game Theory, Dynamic Programming, Union Find,Graph Algorithms, BitmaskingTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Bookmark the GFG Amazon Archives. It helped me a lot during my preparations. Reading other’s interview experiences is one of the best ways to get yourselves ready for the next job interview. Practice daily atleast 5 questions.
Tip 2 : Most commonly asked topics in Amazon Interviews ( as per the mail I received from my recruiter ) :
BFS/DFS/Flood fill, Binary Search, Tree traversals, Hash tables, Linked list, stacks, queues, two pointers/sliding window
Binary heaps, Ad hoc/string manipulations.
Tip 3 : Highly recommended sites for practicing questions ( usually practice medium and hard level questions) :
Leetcode (highly encouraged)
Geeksforgeeks (highly encouraged)
CodeZen( highly encouraged)
Codeforces
Tip 4 : This is a great bigocheatsheet that could be of great help https://www.bigocheatsheet.com/

Application resume tips for other job seekers

Tip 1 : Mention past working experience in detail as how you were important to your previous company.
Tip 2 : Try to keep your resume to 1 page if work experience < 5 years
Tip 3 : Update your resume according to role you are applying for and never put false things on resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Uber user image Anonymous

posted on 15 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

Timing: evening
Environment: Online round took at home

  • Q1. 

    Smallest Subarray with K Distinct Elements Problem

    Given an array A consisting of N integers, find the smallest subarray of A that contains exactly K distinct integers.

    Input:

    The first line contains tw...
  • Ans. 

    At first sight this can be solved easily by using two loops to iterate over contiguous subarrays in O(n^2) and counting number of arrays and breaking the outer loop if number of odds exceed 'k'.

    Optimised solution is to take two pointer approach where right pointer is incremented till num of odds not exceed 'k'. If limit is reached, increment left pointer and add number of arrays (right - left+1)*(right-left)/2 to the r

  • Answered Anonymously
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Medium

Machine coding round

Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Rat In a Maze Problem Statement

    Given a N * N maze with a rat placed at position MAZE[0][0], find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]. The rat is allowed to...

  • Ans. Backtracking Approach

    Initialize, all the cells of the solution matrix used to print the path matrix to 0. First, you cannot make use of the existing maze to print the solution maze as you have to distinguish b/w 1 of maze or 1 of ‘SOLUTION matrix.

     

    Form a recursive function, which will follow a path and check if the path reaches the destination or not. If the path does not reach the destination then backtrack and t...

  • Answered Anonymously
Round 4 - Face to Face 

Round duration - 60-90 minutes
Round difficulty - Medium

Round 5 - HR 

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager round

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNone as such. Only eligible criteria for SDE-2 role is that one should have prior experience working as SDEUber interview preparation:Topics to prepare for the interview - Data structures and algorithms, Design patterns, System design, DatabasesTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Do some basic research about the interview process and types of rounds while appearing for a company interview. Narrow down the topics and draft a realistic plan afterwards.
Tip 2 : Try to solve as many problems as possible as this is primarily what you will be doing in live interview rounds.

Application resume tips for other job seekers

Tip 1 : Tailor your resume as per expectations from the role you are applying for.
Tip 2 : Order your experiences and skills by relevance.
Tip 3 : Try to fit the content in a single page.

Final outcome of the interviewRejected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 16 Sep 2021

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

I got a call from an Amazon recruiter regarding the schedule of the test . She sent me the coding test link which I had to complete within a week. we can attempt the online test anytime, when we have time for a period of 90 minutes at a stretch.Once I completed the test, I got a call to schedule the interviews in two weeks.

  • Q1. 

    Shopping Options Problem Statement

    Given arrays representing the costs of pants, shirts, shoes, and skirts, and a budget amount 'X', determine the total number of valid combinations that can be purchased ...

  • Ans. Brute Force

    We can check all possible combinations to buy items. That can be done by maintaining a variable “answer” and iterating over all four lists in a nested way such that each pant, shirt, shoe, and skirt pair can get selected and find the sum of that pair. If sum is less than or equal to budget then increment “answer” by one. Return the “answer”.


    Algorithm:

     

    • Create an integer “answer” equal to 0.
    • First iterate ...

  • Answered Anonymously
  • Q2. 

    Max Submatrix Problem Statement

    You are provided with a matrix MAT consisting of integers, with dimensions N x M (i.e., N rows and M columns). Your objective is to determine the maximum sum submatrix with...

  • Ans. Brute Force

    The brute force approach is we check for every possible submatrix in the given ‘MAT’.

    • 4 nested loops are required to select every submatrix of the matrix.
    • 2 nested loops are required to take the sum of all the elements of the submatrix.

    Here is the algorithm :

    1. We declare a variable ‘MAX_SUM’ in which we store the maximum sum over all submatrices in the matrix.
    2. We run a loop for ‘i’ = 0 to ‘N’:
      • We run a loop for ‘j...
  • Answered Anonymously
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Virtual interview occured in amazon chime.The interviewer gave his introduction, asked me a bit on the kind of projects I’ve worked on. Then he started with a data structure problem.

  • Q1. 

    Clone a Binary Tree with Random Pointers

    Given a binary tree where each node has pointers to its left, right, and a random node, create a deep copy of the binary tree.

    Input:

    The first line contains an ...
  • Ans. HashMap based approach

    The idea is to use a HashMap to map the tree nodes to each clone node. We will traverse the binary tree and create a clone tree with the random pointer equal to NULL and map each node of the given tree to its clone node. Now we will again iterate through the tree and add the random pointer of each node by looking up the HashMap. 

     

    The steps are as follows:

    1. Let’s define a HashMap to map eac...
  • Answered Anonymously
  • Q2. 

    The Ninja Port Problem

    Ninja is in a city with 'N' colonies, where each colony contains 'K' houses. He starts at house number "sourceHouse" in colony number "sourceColony" and wants to reach house number ...

  • Ans. Breadth First Search

    We can initially create a graph with 2 nodes from each colony i.e. the first and last house of each colony would be included in the graph. We also create an edge from the node representing the last node of each colony to the node representing the first node of the next colony, and vice versa.
     

    Now, we add into the graph each house that has an outgoing or incoming secret path. We also make edges ...

  • Answered Anonymously
Round 3 - Video Call 

Round duration - 75 Minutes
Round difficulty - Easy

This was taken by an engineering manager who asked me regarding my projects for around 10-15 mins and then we moved to a system design problem. He asked me to design Slack messenger.
I started by listing the functional and non-functional requirements(on which he questioned me a bit), then I moved to draw the high-level architecture. The components which I drew were the clients, gateway service(LB + authentication, etc), Messaging Service, User Service, Web Socket Manager service, Fan Out service(I added this for the group messages thing, but he didn’t interrogate much on that).

He asked me what would be the schema of my messages table and the scenarios in which the recipient user is online/offline.Also asked about the partitioning key and primary key of the 2-3 tables which I had made

Round 4 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Hard

BarRaiser Round

This was again taken by an engineering manager who discussed my projects in depth for around 20-25 mins. In the remaining time he asked me 2 dsa questions. (Yes I too was surprised that he didn’t ask anything regarding design).

In almost all the rounds, I was asked questions related to Amazon Leadership principles, so do make sure you go through those before sitting for the interview process. You can refer to this link(https://www.codingninjas.com/codestudio/problem-lists/top-amazon-coding-interview-questions) for practicing the same, I found it useful. 
In the design rounds, interviewer doesn’t expect the most ideal answer from you and unless your choice of technology is outrageously wrong, he won’t pinpoint that.

  • Q1. 

    Group Anagrams Together

    Given an array/list of strings STR_LIST, group the anagrams together and return each group as a list of strings. Each group must contain strings that are anagrams of each other.

    E...

  • Ans. Sorting based Approach

    The idea behind this approach is that two or more than two strings are anagrams if and only if their sorted strings are equal. So we will use a HashMap, let’s say “anagramGroup”, where each key is a sorted string, and the key will be mapping to the list of indices from the given list of strings that form a group of anagrams. This means that if we sort the strings at those indices, we will get the ...

  • Answered Anonymously
  • Q2. 

    Add Two Numbers Represented by Linked Lists

    Your task is to find the sum list of two numbers represented by linked lists and return the head of the sum list.

    Explanation:

    The sum list should be a linked...

  • Ans. Recursive approach

    One way is to recursively add the two linked lists. Keep the nodes in the recursion stack and add the last nodes first and then second last and so on. Initially, find the size of both the linked lists. If both the linked lists are of the same size, add them using recursion. Else if their sizes differ, move the head pointer of the larger linked list forward K times, where K is the difference between th...

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Sathyabama Institute Of Science And Technology. I applied for the job as SDE - 2 in HyderabadEligibility criteriaNo CGPA criteriaAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS concepts, cpp, operating systems, dbmsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Expect questions related to Amazon Leadership principles in all rounds, so go through those thoroughly before sitting for the interview process.
Tip 2 : In the design rounds, interviewer doesn’t expect the most ideal answer from you and unless your choice of technology is outrageously wrong, he won’t pinpoint that.
Tip 3 : Data Structures questions are a must in all rounds, so try to master them thoroughly

Application resume tips for other job seekers

Tip 1 : Make sure you know everything you mention in your resume
Tip 2 : Have some hands on with hackathons and contests ,which brings an added value to your resume

Final outcome of the interviewRejected

Skills evaluated in this interview

Flipkart Interview FAQs

How many rounds are there in Flipkart SDE-2 interview?
Flipkart interview process usually has 3 rounds. The most common rounds in the Flipkart interview process are Coding Test, Resume Shortlist and Assignment.
What are the top questions asked in Flipkart SDE-2 interview?

Some of the top questions asked at the Flipkart SDE-2 interview -

  1. Design a 2/3rd Winning ga...read more
  2. NoSQL vs SQL differe...read more
  3. Discussion around how would you scale a applicati...read more

Tell us how to improve this page.

Flipkart SDE-2 Interview Process

based on 3 interviews

Interview experience

4.3
  
Good
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5.1k Interviews
BigBasket Interview Questions
3.9
 • 357 Interviews
PolicyBazaar Interview Questions
3.6
 • 346 Interviews
JustDial Interview Questions
3.5
 • 329 Interviews
Zomato Interview Questions
3.7
 • 322 Interviews
Info Edge Interview Questions
3.9
 • 320 Interviews
Myntra Interview Questions
4.0
 • 216 Interviews
Naukri Interview Questions
4.0
 • 186 Interviews
Uber Interview Questions
4.2
 • 167 Interviews
View all
Flipkart SDE-2 Salary
based on 51 salaries
₹22 L/yr - ₹45 L/yr
5% less than the average SDE-2 Salary in India
View more details

Flipkart SDE-2 Reviews and Ratings

based on 5 reviews

3.9/5

Rating in categories

4.4

Skill development

3.5

Work-life balance

3.4

Salary

4.2

Job security

3.8

Company culture

3.1

Promotions

3.9

Work satisfaction

Explore 5 Reviews and Ratings
Senior Executive
2.7k salaries
unlock blur

₹1.8 L/yr - ₹9 L/yr

Team Lead
1.9k salaries
unlock blur

₹1.2 L/yr - ₹9.9 L/yr

Operations Executive
1.8k salaries
unlock blur

₹1.2 L/yr - ₹6.3 L/yr

Assistant Manager
1.6k salaries
unlock blur

₹6 L/yr - ₹20.4 L/yr

Executive
1.3k salaries
unlock blur

₹1.2 L/yr - ₹7 L/yr

Explore more salaries
Compare Flipkart with

Amazon

4.1
Compare

Myntra

4.0
Compare

Snapdeal

3.8
Compare

Meesho

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview