i
Flipkart
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Sort an array of strings by the difference of a given element to each array element.
Iterate through the array and calculate the absolute difference between the given element and each array element.
Sort the array based on the calculated differences.
Return the sorted array.
Sort an array of strings in descending order.
Use a built-in sorting function like sort() with a custom comparator function.
In the comparator function, compare each pair of strings and return -1, 0, or 1 based on the desired order.
Example: array.sort((a, b) => b.localeCompare(a));
Design a cheese board that accommodates various cheeses, pairings, and user preferences for an enjoyable tasting experience.
Include a variety of cheeses: soft (Brie), hard (Cheddar), blue (Gorgonzola), and fresh (Mozzarella).
Add complementary pairings: fruits (grapes, figs), nuts (almonds, walnuts), and spreads (honey, chutney).
Consider dietary restrictions: offer vegan cheese options or gluten-free crackers.
Desig...
Ps ds round leetcode medium questions focus on problem-solving and data structure skills in coding interviews.
Understand the problem statement clearly before attempting to solve it.
Break down the problem into smaller parts and tackle each part individually.
Use examples to visualize the problem; for instance, if the problem involves arrays, consider edge cases like empty arrays.
Practice common data structures like ...
What people are saying about Flipkart
It was a machine coding round
Sort an array of strings by the difference of a given element to each array element.
Iterate through the array and calculate the absolute difference between the given element and each array element.
Sort the array based on the calculated differences.
Return the sorted array.
Nothing challenging- Coffee Machine Vending System
Nothing Challenging - Coffee machine vending system
Design a cheese board that accommodates various cheeses, pairings, and user preferences for an enjoyable tasting experience.
Include a variety of cheeses: soft (Brie), hard (Cheddar), blue (Gorgonzola), and fresh (Mozzarella).
Add complementary pairings: fruits (grapes, figs), nuts (almonds, walnuts), and spreads (honey, chutney).
Consider dietary restrictions: offer vegan cheese options or gluten-free crackers.
Design for...
Ps ds round leetcode medium questions focus on problem-solving and data structure skills in coding interviews.
Understand the problem statement clearly before attempting to solve it.
Break down the problem into smaller parts and tackle each part individually.
Use examples to visualize the problem; for instance, if the problem involves arrays, consider edge cases like empty arrays.
Practice common data structures like array...
I applied via Approached by Company and was interviewed before Oct 2023. There were 2 interview rounds.
IT was a 1 hour test.
Easy topics were asked.
I applied via Job Portal and was interviewed in Jun 2021. There were 3 interview rounds.
Sorts an array of strings in ascending order.
Use a sorting algorithm like bubble sort, selection sort, or merge sort.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat the process until the array is sorted.
I appeared for an interview before May 2016.
Yes, I am comfortable with reallocating as needed.
I am flexible and adaptable to changing circumstances.
I have experience working in dynamic environments where priorities can shift.
I am willing to take on new challenges and responsibilities as required.
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This round consist of two questions and we have to solve both the questions to qualify for the next round.
Round duration - 40 minutes
Round difficulty - Easy
A single coding question was asked that had a lot of corner cases.
Round duration - 45 minutes
Round difficulty - Easy
It had 3 coding questions followed by basic concepts of DP.
To find the maximum difference between a node and its descendant in the same path in a binary tree, we can perform a depth-first search while keeping track of the minimum value encountered so far.
Perform a depth-first search on the binary tree, keeping track of the minimum value encountered so far in the path.
At each node, calculate the difference between the current node value and the minimum value encountered so far ...
Round duration - 30 minutes
Round difficulty - Easy
It had 2 coding questions which were of good level.
Kruskal's algorithm finds MST by sorting edges, adding smallest edge that doesn't create a cycle, repeat until all vertices are connected.
Sort all edges in non-decreasing order of their weights.
Initialize an empty graph to store the MST.
Iterate through sorted edges and add the smallest edge that doesn't create a cycle in the MST.
Repeat until all vertices are connected in the MST.
Round duration - 30 minutes
Round difficulty - Easy
This was the last round.
Don’t create panic in any case in the interview , as even if you are not selected you will learn a lot from your interview experience and perform well in the future. Also I would recommend you Coding Ninjas as according to me it is a good platform to learn basic coding concepts and to practice coding.
Application resume tips for other job seekersWrite whatever you are sure about and have actually done that. CGPA plays a good role but not a complete role as it is just eligibility criteria for some companies. Have at least 1 or 2 good projects from which you know everything involved in the project.
Final outcome of the interviewSelectedbased on 9 interview experiences
Difficulty level
Duration
based on 25 reviews
Rating in categories
Senior Executive
2.7k
salaries
| ₹4 L/yr - ₹9.1 L/yr |
Team Lead
2.1k
salaries
| ₹3.5 L/yr - ₹8 L/yr |
Operations Executive
1.9k
salaries
| ₹2.3 L/yr - ₹6.4 L/yr |
Assistant Manager
1.8k
salaries
| ₹10 L/yr - ₹18 L/yr |
Executive
1.4k
salaries
| ₹2.2 L/yr - ₹7 L/yr |
Amazon
Myntra
Snapdeal
Meesho