AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Flipkart
Compare
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Flipkart SDE-2 Interview Questions and Answers
6 Interview questions
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
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 No...
Scaling an application involves optimizing performance, managing load, and ensuring reliability as user demand increases.
Horizontal scaling: Add more machines to distribute load (e.g., using load balancers).
Vertical scaling: Upgrade existing machines with more resources (CPU, RAM).
Database sharding: Split databases into smaller, more manageable pieces to improve performance.
Caching strategies: Use caching layers (...
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 star...
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].
What people are saying about Flipkart
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 give...
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 th...
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 par...
Flipkart SDE-2 Interview Experiences
4 interviews found
Anonymous
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.
Shubham Jain
Selected
I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 5 interview rounds.
2 Coding questions both easy-medium level.
1. Based on the Sliding Window
2. Graph Question
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.
(4 Questions)
- Q1. Basic discussion around the project & past experience.
- Q2. Design a 2/3rd Winning game.
- Q3. Discussion around how would you scale a application.
- Ans.
Scaling an application involves optimizing performance, managing load, and ensuring reliability as user demand increases.
Horizontal scaling: Add more machines to distribute load (e.g., using load balancers).
Vertical scaling: Upgrade existing machines with more resources (CPU, RAM).
Database sharding: Split databases into smaller, more manageable pieces to improve performance.
Caching strategies: Use caching layers (e.g.,...
- Q4. NoSQL vs SQL difference
(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
- Data Structures
- Algorithms
- System Design
- Microservices
- Java
- Spring Boot
Along with that, you should be well-versed in System design concepts.
Skills evaluated in this interview
ankur kumar
I applied via Referral and was interviewed in Jan 2023. There were 3 interview rounds.
This was a machine coding round in which we have to implement an online cab booking service.
Standard problem solving round consists of two questions on tree and dp.
Interview Preparation Tips
I appeared for an interview in May 2021.
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
(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
ARRconsisting 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].
- 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...
(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...
(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?
- Ans.
I'm seeking new challenges and opportunities for growth that align with my career goals and aspirations.
Desire for professional growth: I'm looking for a role that offers more responsibilities and opportunities to lead projects.
Interest in new technologies: I want to work with cutting-edge technologies that can enhance my skills and knowledge.
Cultural fit: I'm seeking a company culture that aligns more closely with my ...
Interview Preparation Tips
Tip 1 : Practice Atleast 200 Questions
Tip 2 : Practice company specific interview question
Tip 3 : Prepare resume nicely
Tip 1 : Prepare resume very nicely.
Tip 2 : don't mention any tech stack you are confident of.
Skills evaluated in this interview
Interview questions from similar companies
I appeared for an interview before Sep 2020.
(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 ...
(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
Round duration - 1hour
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : be confident
Tip 2 : always say truth about your experience
Tip 3 : don't be nervous
Tip 1 : mentioned project u worked on
Tip 2 : technical skills
Skills evaluated in this interview
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
- 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
- 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
- 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: ...
- 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
- 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.
- 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.
- 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.
Interview Preparation Tips
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
I appeared for an interview before Sep 2020.
(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
Aconsisting ofNintegers, find the smallest subarray ofAthat contains exactlyKdistinct integers.Input:
The first line contains tw... - Ans.
Find the smallest subarray with exactly K distinct integers in an array.
Use a sliding window approach to keep track of the subarray with K distinct integers.
Use a hashmap to store the frequency of each integer in the current window.
Update the window size based on the number of distinct integers found.
Keep track of the smallest subarray meeting the criteria.
Return the starting and ending indices of the smallest subarray...
Round duration - 90 minutes
Round difficulty - Medium
Machine coding round
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
- Q1.
Rat In a Maze Problem Statement
Given a
N * Nmaze with a rat placed at positionMAZE[0][0], find and print all possible paths for the rat to reach its destination atMAZE[N-1][N-1]. The rat is allowed to... - Ans.
The problem involves finding all possible paths for a rat to reach its destination in a maze.
Use backtracking to explore all possible paths in the maze.
Mark visited cells to avoid revisiting them.
Return the path once the destination is reached.
Handle edge cases like blocked cells and out-of-bounds movements.
Round duration - 60-90 minutes
Round difficulty - Medium
Round duration - 60 minutes
Round difficulty - Medium
Hiring Manager round
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I appeared for an interview before May 2021.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Easy
- Q1.
Balanced Parentheses Combinations
Given an integer
Nrepresenting the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.Explanati...
- Ans.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Terminate recursion when the number of open and close parentheses used equals the given number of pairs.
(1 Question)
Round duration - 45 Minutes
Round difficulty - Easy
- Q1.
Boundary Traversal of Binary Tree Problem Statement
You are given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the ro...
- Ans.
Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.
Traverse the left boundary nodes from top to bottom
Traverse the leaf nodes from left to right
Traverse the right boundary nodes from bottom to top
Handle cases where nodes are null (-1)
Print the boundary nodes in the specified order
(1 Question)
Round duration - 45 Minutes
Round difficulty - Easy
- Q1.
Bottom View of Binary Tree Problem Statement
Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...
- Ans.
The task is to print the bottom view of a binary tree from left to right.
Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.
For each horizontal distance, update the node value in a map to get the bottom view nodes.
Print the values of the map in sorted order of horizontal distance to get the bottom view sequence.
(1 Question)
Round duration - 45 minutes
Round difficulty - Easy
Bar raiser
- Q1. Can you design a parking lot using low-level design (LLD) and a tiny URL service using high-level design (HLD)?
- Ans.
Yes, I can design a parking lot using LLD and a tiny URL service using HLD.
For designing a parking lot using LLD, we can create classes like ParkingLot, ParkingSpot, Vehicle, etc. with their respective attributes and methods.
For designing a tiny URL service using HLD, we can focus on scalability, fault tolerance, and performance. We can use techniques like sharding, caching, load balancing, etc.
In the parking lot LLD, ...
Interview Preparation Tips
Tip 1 : Prepare 1-2 examples for each Leadership Principles
Tip 2 : Prepare questions from the latest interview experiences
Tip 1 : Concise, without errors
Tip 2 : Highlight years of experience
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(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
Aof lengthNconsisting of distinct integers and a target integerM. Your task is to determine the position where... - Ans.
Find the best insert position for a target in a sorted array to maintain order.
Use binary search to find the correct position for the target integer in the sorted array.
If the target is already present in the array, return its index.
Maintain the sorted order of the array after inserting the target integer.
Handle edge cases like empty array or target being smaller than the first element or larger than the last element.
(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.
House Robber problem - find maximum amount of money Mr. X can rob without triggering alarm in circular street.
Use dynamic programming to keep track of maximum money robbed at each house.
Consider two cases - robbing the first house and not robbing the first house.
Handle circular arrangement by considering the first and last houses separately.
Return the maximum amount of money that can be robbed without triggering the al...
(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.
Calculate and print the median after each new integer is added to the stream.
Use a min heap to store the larger half of the numbers and a max heap to store the smaller half of the numbers.
Keep the two heaps balanced by ensuring the size difference is at most 1.
If the total number of elements is odd, the median is the top element of the larger heap. If even, it's the average of the tops of both heaps.
Round duration - 60 minutes
Round difficulty - Medium
The interview was at 1 AM.
Round duration - 60 minutes
Round difficulty - Easy
The meeting was at 2 PM in the office meeting room.
(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?
Interview Preparation Tips
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
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
Skills evaluated in this interview
Seema Sharma
Interview Questionnaire
1 Question
- Q1. All algorithms and system design
Flipkart Interview FAQs
Tell us how to improve this page.
Flipkart Interviews By Designations
- Flipkart Data Entry Operator Interview Questions
- Flipkart Operations Executive Interview Questions
- Flipkart Senior Executive Interview Questions
- Flipkart Team Lead Interview Questions
- Flipkart Software Developer Interview Questions
- Flipkart Executive Interview Questions
- Flipkart Graduate Trainee Interview Questions
- Flipkart Team Lead Operations Interview Questions
- Show more
Overall Interview Experience Rating
based on 3 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Flipkart SDE-2 Reviews and Ratings
based on 5 reviews
Rating in categories
|
Senior Executive
2.5k
salaries
|  ₹2 L/yr - ₹9.1 L/yr |
|
Operations Executive
1.9k
salaries
| ₹1.2 L/yr - ₹7 L/yr |
|
Assistant Manager
1.8k
salaries
| ₹6 L/yr - ₹22.4 L/yr |
|
Team Lead
1.6k
salaries
| ₹1.2 L/yr - ₹10.1 L/yr |
|
Executive
1.4k
salaries
| ₹1.2 L/yr - ₹7 L/yr |
Amazon
Myntra
Snapdeal
Meesho
- Home >
- Interviews >
- Flipkart Interview Questions
