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.

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
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:
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 - 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...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in increasing order.

    • Use a three-pointer approach to sort the array in a single pass.

    • Initialize three pointers for 0, 1, and 2 values and iterate through the array.

    • Swap elements based on the values encountered to achieve the sorted array.

    • Example: Input array [0, 2, 1, 1] should be sorted as [0, 1, 1, 2].

  • Answered by AI
  • 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...
  • Ans. 

    Find the maximum sum of the path from the root to any leaf node in an n-ary tree.

    • Traverse the tree from root to leaf nodes, keeping track of the sum along the path.

    • At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.

    • Consider using depth-first search (DFS) to traverse the tree efficiently.

    • Handle cases where nodes are absent (-1) by appropriately updating the pat...

  • Answered by AI
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.
  • Ans. 

    Design a system for BookMyShow to allow users to book movie tickets.

    • Create a user-friendly website and mobile app for users to browse movies and showtimes.

    • Implement a secure payment gateway for users to purchase tickets online.

    • Develop a database to store movie information, showtimes, and user bookings.

    • Include features like seat selection, ticket confirmation, and booking history for users.

    • Integrate with cinema partners

  • Answered by AI
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)

 User Interface Engineer 2

 (2)

 Product Solution Engineer 2

 (2)

 Ml Data Associate 2

 (1)

Interview questions from similar companies

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...

  • Ans. 

    Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.

    • Use Breadth First Search (BFS) algorithm to find the shortest path from start to end cell.

    • Keep track of visited cells and the number of dice throws required to reach each cell.

    • Consider the presence of snakes and ladders while calculating the next possible moves.

    • Return the minimum number of dice throws to reach the last

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 1hour
Round difficulty - Hard

  • Q1.  Stack using queue

    Mvvm architecture

  • Ans. 

    Implement a stack using a queue in MVVM architecture

    • Use two queues to simulate a stack

    • Push operation: Enqueue the element to queue 1

    • Pop operation: Dequeue all elements from queue 1 to queue 2, dequeue the last element from queue 2 (which is the top of the stack)

    • Ensure proper synchronization between the two queues

    • Example: Push(1), Push(2), Pop() should return 2

  • Answered by AI
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 2 Apr 2015

Interview Questionnaire 

10 Questions

  • Q1. Find sum of all numbers that are formed from root to leaf path (code) expected time complexity O(n)
  • Ans. 

    Find sum of all numbers formed from root to leaf path in a binary tree

    • Traverse the binary tree using DFS

    • At each leaf node, add the number formed from root to leaf path to a sum variable

    • Return the sum variable

    • Time complexity: O(n)

    • Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25

  • Answered by AI
  • Q2. Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -> A BC, AB C, ABC, A B C
  • Ans. 

    Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.

    • Use recursion to generate all possible combinations of spaces

    • For each recursive call, either add a space or don't add a space between the current character and the next character

    • Base case is when there are no more characters left to add spaces between

    • Time complexity is O(2^n) where n is the length of the string

  • Answered by AI
  • Q3. Preorder traversal without using recursion
  • Ans. 

    Preorder traversal without recursion

    • Use a stack to keep track of nodes

    • Push right child first and then left child onto stack

    • Pop top of stack and print value

    • Repeat until stack is empty

  • Answered by AI
  • Q4. There is a 12 km road and a contractor who is in-charge of repairing it. Contractor updates you about the work which is done in patches. Like “Road between 3.2 km to 7.9 km repaired ”, “Road between 1.21 k...
  • Ans. 

    Find longest continuous patch on a 12 km road with updates in patches

    • Maintain a variable to keep track of current patch length

    • Update the variable whenever a new patch is added

    • Maintain a variable to keep track of longest patch so far

    • Compare current patch length with longest patch length and update if necessary

    • Use a sorted data structure like a binary search tree to store the patches for efficient search

    • Time complexity: ...

  • Answered by AI
  • Q5. Several Questions were asked from my project
  • Q6. Find median of an unsorted array. (code
  • Ans. 

    Find median of an unsorted array.

    • Sort the array and find the middle element

    • Use quickselect algorithm to find the median in O(n) time

    • If the array is small, use brute force to find the median

  • Answered by AI
  • Q7. General discussion on heaps
  • Q8. A stream of characters is coming, at any moment you have to tell ‘k’ elements closest to a given number (code)
  • Ans. 

    Find 'k' elements closest to a given number from a stream of characters.

    • Use a priority queue to keep track of closest elements.

    • Update the queue as new characters come in.

    • Return the 'k' closest elements from the queue.

  • Answered by AI
  • Q9. Design data structure that supports insert(), remove(), find-max(), delete-max() operations. All operations should run in O(1) time. Lots of discussion was there, discussed many approaches.
  • Ans. 

    Design a data structure with O(1) insert, remove, find-max, and delete-max operations.

    • Use a doubly linked list to maintain the elements in sorted order.

    • Use a hash table to store the pointers to the nodes in the linked list.

    • Maintain a pointer to the maximum element in the hash table.

    • Update the pointers in the hash table when inserting or removing elements.

    • Update the maximum pointer when deleting or inserting the maximum

  • Answered by AI
  • Q10. Check whether given link list represents palindrome
  • Ans. 

    Check if a given linked list is a palindrome.

    • Traverse the linked list and store the values in an array.

    • Compare the first and last elements of the array, then move towards the center.

    • If all elements match, the linked list is a palindrome.

    • Alternatively, use two pointers to find the middle of the linked list and reverse the second half.

    • Compare the first half with the reversed second half to check for a palindrome.

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Recently I attended Amazon Bangalore interview for SDE 2 position. All f2f and no phone/written screening as I had attended one before and cleared those. Total 4 rounds wer der. The first techh round dey asked mi questions listed above.
Tips: NA

Round: Technical Interview
Experience: ROUND 2 dey asked mi above questions
Tips: NA

Round: Technical Interview
Experience: Round 3 Above questions wer asked.

Round: Technical Interview
Experience: This was the last round. thy asked mi above questions

College Name: NA

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 12 Apr 2022

I applied via Recruitment Consulltant and was interviewed before Apr 2021. There were 2 interview rounds.

Round 1 - Coding Test 

2 coding questions

Round 2 - Technical 

(1 Question)

  • Q1. Ds algo round 2 medium questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well from leet code medium and few hard questions

Interview Questionnaire 

1 Question

  • Q1. All algorithms and system design

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. 

    Determine total number of valid shopping combinations within budget

    • Iterate through all possible combinations of items from each array

    • Check if the total cost of the combination is within the budget

    • Return the count of valid combinations

  • Answered by AI
  • 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. 

    Find the maximum sum submatrix in a given matrix.

    • Iterate over all possible submatrices and calculate their sums

    • Use Kadane's algorithm to find the maximum sum subarray in each row

    • Combine the sums of rows to find the maximum sum submatrix

  • Answered by AI
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. 

    Clone a binary tree with random pointers and verify if cloning was successful by printing inorder traversal.

    • Create a deep copy of the binary tree with random pointers.

    • Print the inorder traversal of the cloned binary tree.

    • Verify cloning success by printing '1' if successful, '0' otherwise.

  • Answered by AI
  • 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. 

    The Ninja Port Problem involves finding the minimum time for a ninja to travel between colonies and houses using secret paths and teleportation.

    • Calculate the minimum time considering teleportation within colonies, traveling between colonies, and secret paths.

    • Keep track of the number of secret paths used and ensure they are one-way.

    • Consider the constraints provided to optimize the solution.

    • Example: N=2, K=3, S=1, P=1, s...

  • Answered by AI
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. 

    Group anagrams together in a list of strings.

    • Iterate through the list of strings and sort each string to group anagrams together.

    • Use a hashmap to store the sorted string as key and the original string as value.

    • Return the values of the hashmap as the grouped anagrams.

  • Answered by AI
  • 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. 

    Add two numbers represented by linked lists and return the head of the sum list.

    • Traverse both linked lists simultaneously while keeping track of carry from previous sum

    • Create a new linked list to store the sum of the two numbers

    • Handle cases where one linked list is longer than the other by padding with zeros

    • Update the sum and carry values accordingly while iterating through the linked lists

  • Answered by AI

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

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 16 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2D array or list containing 'N' rows and 'M' columns, filled with 1s and 0s. Here, 1 indicates land, and 0 indicates water.

    Your task is to ide...

  • Ans. 

    Count the number of islands in a 2D matrix filled with 1s and 0s.

    • Iterate through the matrix and perform depth-first search (DFS) to find connected islands.

    • Use a visited array to keep track of visited cells to avoid redundant calculations.

    • Increment the island count whenever a new island is encountered.

    • Consider all eight directions (horizontal, vertical, and diagonal) while exploring the island.

    • Handle edge cases like out

  • Answered by AI
  • Q2. 

    Add First and Second Half Problem Statement

    You are provided with a Singly Linked List having 'N' nodes, where each node contains a single digit.

    Your task is to return a node 'X', which serves as the he...

  • Ans. 

    Return a node representing the head of a new Linked List with the sum of the 1st and 2nd half of the given Linked List.

    • Split the Linked List into two halves

    • Reverse the 2nd half of the Linked List

    • Add the corresponding digits from both halves while considering carry

    • Create a new Linked List with the sum digits

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Next Greater Element Problem Statement

    You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...

  • Ans. 

    The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.

    • Use a stack to keep track of elements for which the next greater element is not found yet.

    • Iterate through the array from right to left, popping elements from the stack until a greater element is found.

    • Store the next greater element for each element in a separate array.

    • If the stack is empty aft...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

  • Q1. 

    Word Break Problem Statement

    You are given a non-empty string without spaces, referred to as 'sentence', and a list of non-empty strings representing a dictionary. Your task is to construct and return all...

  • Ans. 

    Given a sentence and a dictionary, construct and return all possible sentences by inserting spaces to form words from the dictionary.

    • Use backtracking to generate all possible combinations of words from the dictionary to form sentences.

    • Check if a substring of the sentence matches any word in the dictionary, if so, recursively call the function with the remaining substring.

    • Continue this process until the entire sentence ...

  • Answered by AI
  • Q2. 

    Valid Parenthesis Problem Statement

    Given a string str composed solely of the characters "{", "}", "(", ")", "[", and "]", determine whether the parentheses are balanced.

    Input:

    The first line contains ...
  • Ans. 

    Check if given string of parentheses is balanced or not.

    • Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.

    • If stack is empty at the end and all parentheses are matched, the string is balanced.

    • If stack is not empty at the end or mismatched parentheses are encountered, the string is not balanced.

  • Answered by AI
Round 4 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. Design a local transport system similar to BMTC.
  • Ans. 

    Design a local transport system similar to BMTC

    • Introduce a fleet of buses covering various routes within the city

    • Implement a smart card system for easy payment and tracking

    • Include different types of buses like regular, AC, and Volvo for passenger comfort

    • Have designated bus stops with real-time information on bus arrivals

    • Offer discounted fares for students and senior citizens

  • Answered by AI
Round 5 - Video Call 

Round duration - 60 minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNAAmazon interview preparation:Topics to prepare for the interview - Graph , Dynamic Programming, Array, String, System DesignTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice a lot.
Tip 2 : Focus on system design 
Tip 3 : Focus on amazon Leadership principles.

Application resume tips for other job seekers

Tip 1: Mention relevant details for job you are applying. 
Tip 2: Be objective and concise.

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, One-on-one Round and Resume Shortlist.
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
7% 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

₹0 L/yr - ₹0 L/yr

Operations Executive
1.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
1.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
1.5k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Executive
1.3k salaries
unlock blur

₹0 L/yr - ₹0 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