i
Flipkart
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I applied via Campus Placement
Tell me something about yourself.
Share your previous work experience.
How did you expand your company's business?
Flipkart is going to launch wallpapers for the Indian market what kind of wallpaper you are going to launch, formulate the complete strategy.
This was a typical market entry case, the only thing you ought to think is the type of wallpaper you will launch and here your out of the box thinking comes into the picture, I mentioned I will be launching a PVC based economical segment wallpaper.
What is the professional achievement you’re most proud of?
This was a typical market entry case, the only thing you ought to think about is the type of wallpaper you will launch, and here your out-of-the-box thinking comes into the picture, I mentioned I would be launching a PVC-based economical segment wallpaper
Tell me something about yourself.
How in Flipkart are we going to sell real estate?
Over here they are looking at what ideas you can bring to the table. I mentioned the problem that why people are reluctant to deal in real estate online, then I presented the ideas whatever I was able to think off.
What are parameters you will leverage on to promote IIM Lucknow as a brand?
Again a typical marketing question on promotion, where I described the elements like Alumni base, the government rankings, the world-class infrastructure, the available courses like ABM, MDP
I applied via Campus Placement
Topic- Customer Centricity.
Flipkart has offered various deals in the past to attract customers and increase sales.
Flipkart's Big Billion Days sale offers huge discounts on various products.
Flipkart also offers daily deals and discounts on specific products.
Flipkart has tie-ups with various banks to offer additional discounts and cashback offers.
Flipkart also offers exchange offers on certain products.
Flipkart has introduced various payment optio...
OTT services are a game-changer in the entertainment industry.
OTT services have disrupted traditional cable TV and movie rental industries
They offer on-demand content and personalized viewing experiences
Examples include Netflix, Hulu, Amazon Prime Video, and Disney+
OTT services have also led to the rise of cord-cutting and cord-nevers
OTT services have faced challenges with content licensing and piracy
Yes, video streaming services are a must-have in today's market.
Video streaming services are in high demand and have become a necessity for many consumers.
It can attract a younger audience who prefer to watch content online.
It can also increase revenue through subscription fees and advertising.
Examples of successful video streaming services include Netflix, Hulu, and Amazon Prime Video.
Yes, I have a clear understanding of the type of content your company wants to provide.
Your company aims to provide informative and engaging content that is relevant to your target audience.
The content should be well-researched, accurate, and up-to-date.
Examples of content could include blog posts, articles, videos, and social media posts.
The content should align with your company's values and goals.
It should also be o...
I will enhance the category by introducing new and innovative products.
Conduct market research to identify gaps in the category
Collaborate with R&D team to develop new products
Create a marketing strategy to promote the new products
Offer promotions and discounts to attract customers
Monitor sales and customer feedback to make necessary improvements
Keeping acquired brands separate helps maintain their unique identity and customer loyalty.
Preserving the acquired brand's reputation and customer base
Avoiding confusion among customers
Leveraging the acquired brand's strengths and market position
Maintaining a diverse portfolio of brands
Examples: Nestle's acquisition of Starbucks' retail business, Unilever's acquisition of Dollar Shave Club
I applied via Campus Placement
How to expand Flipkart in rural areas?
No, e-commerce will not destroy Kirana shops.
Kirana shops offer personalized service and convenience to customers.
They also have a loyal customer base who prefer to shop locally.
E-commerce may pose a challenge, but it can also be an opportunity for Kirana shops to expand their reach.
For example, Kirana shops can use e-commerce platforms to sell their products online and reach a wider audience.
Additionally, Kirana shops...
I applied via Campus Placement
What do you think E-commerce should focus on next 5 years?
We can improve the visual experience similar to what Lenskart is doing, try & buy options for metro cities.
Flipkart interview questions for designations
Top trending discussions
I applied via Campus Placement
Amazon's principles are customer obsession, ownership, long-term thinking, and more.
Customer obsession: putting the customer first in everything they do
Ownership: taking responsibility and being accountable for results
Long-term thinking: making decisions that benefit the company in the long run
Invent and simplify: constantly innovating and finding ways to simplify processes
Are right, a lot: making data-driven decisions...
To make Amazon more customer centric, I will focus on personalization and improving customer experience. To reduce inventory cost, I will optimize supply chain and implement efficient inventory management strategies.
Implement personalized recommendations and targeted marketing
Improve customer service and support
Streamline checkout process and reduce shipping times
Optimize supply chain and reduce lead times
Implement jus...
I applied via Walk-in and was interviewed in Jul 2024. There were 5 interview rounds.
In the next 5 years, I plan to enhance my leadership skills, drive business growth, and foster a positive work culture.
Focus on developing strong leadership qualities through training and mentorship programs
Implement strategies to drive business growth and increase profitability
Create a positive work environment by promoting teamwork and employee engagement
Stay updated on industry trends and technologies to remain comp...
Coding questions on DSA
Grammatical as well as Mathematical
Coding questions on DSA
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedI was interviewed in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I was interviewed before May 2021.
Round duration - 90 minutes
Round difficulty - Medium
Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.
- 28 MCQs based on core CS
- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.
Round duration - 60 minutes
Round difficulty - Easy
Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions
Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.
You are given the 'Head' of a sorted linked list. Modify the l...
Remove duplicates from a sorted linked list without adjacent duplicates.
Traverse the linked list while comparing current and next nodes.
If they are equal, skip the next node by updating the current node's next pointer.
Repeat until the end of the list is reached.
You are enrolled as a student and must complete N
courses, numbered from 1 to N, to earn your degree.
Some courses have prerequisites, which means that to take course i
,...
Check if it is feasible to complete all courses with prerequisites.
Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.
Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).
If there is no cycle, then it is feasible to complete all courses.
Round duration - 60 minutes
Round difficulty - Medium
This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.
You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.
The LC...
Find the Lowest Common Ancestor of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the Lowest Common Ancestor.
Implement a recursive function to efficiently find the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
Round duration - 60 minutes
Round difficulty - Medium
Pretty Good Round. Fast Paced. We covered a lot of ground.
Design and implement a class BSTIterator
to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...
Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).
Implement a parameterized constructor to initialize the iterator with the root of the BST.
Implement a method 'next()' to return the next smallest element in in-order traversal.
Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.
Ensure the output is the in-order traversal of the
Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...
Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.
Iterate through the array and keep track of the current window of 1's and zeroes.
Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.
Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.
Return the maximum length ...
You are given an undirected and disconnected graph G(V, E)
having V
vertices numbered from 0
to V-1
and E
edges. Your task is to print its BFS traversal starting from the 0t...
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.
Use a queue to keep track of nodes to visit next.
Keep a visited array to avoid revisiting nodes.
Print the BFS traversal path as the nodes are visited.
Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].
Given an undirected graph with V
vertices (labeled 0, 1, ..., V-1) and E
edges, each edge connects two nodes X
and Y
with a specified weight representing the dis...
Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.
Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.
Use a priority queue to efficiently select the next node with the shortest distance.
Initialize distances to all nodes as infinity, except for the source node which is 0.
Update distances t...
Round duration - 60 minutes
Round difficulty - Hard
Bar Raised Round. Definitely felt the difficulty.
You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...
Identify and return the first non-repeating character in a string, or the first character if all characters repeat.
Iterate through the string to count the frequency of each character
Iterate through the string again to find the first character with frequency 1
If no such character is found, return the first character of the string
Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews.
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.
Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.
I was interviewed before Dec 2019.
based on 1 review
Rating in categories
Senior Executive
2.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
1.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
1.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
1.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Entry Operator
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Myntra
Snapdeal
Meesho