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

Filter interviews by

Clear (1)

Flipkart Associate Product Manager Interview Questions and Answers

Updated 21 May 2024

Flipkart Associate Product Manager Interview Experiences

4 interviews found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Case Study 

Prepare a slide deck

Round 2 - Group Discussion 

You will be mapped with seniors from flipkart.

Round 3 - One-on-one 

(1 Question)

  • Q1. Basics of Product management, questions from resume and your interests.
Round 1 - Case Study 

Product Case Study

Round 2 - One-on-one 

(1 Question)

  • Q1. Product Interview - Problem Solving
Round 3 - One-on-one 

(1 Question)

  • Q1. Guesstimates and Product Design Problem

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep a notebook with you to solve cases

Associate Product Manager Interview Questions Asked at Other Companies

asked in Leucine
Q1. 2. You have water filled Jar X and empty Jar Y. You transferred a ... read more
Q2. 2nd Call with VP: How would you measure the effectiveness of feat ... read more
Q3. What are all the important attributes you think a Product manager ... read more
asked in InMobi
Q4. Design: Ad publishers would not want ads with restricted content ... read more
asked in LEAD School
Q5. Design a referral dashboard for Parents/students on Lead school w ... read more
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed before May 2023. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. Should Flipkart enter the cattle trading market?
  • Ans. 

    No, Flipkart should not enter the cattle trading market due to lack of expertise and potential ethical concerns.

    • Lack of expertise in the cattle trading market may lead to poor decision-making and financial losses.

    • Cattle trading involves ethical considerations such as animal welfare and sustainability, which may not align with Flipkart's values.

    • Entering a new market requires significant resources and investment, which m

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be clear and structured with your approach

I applied via Campus Placement and was interviewed in Nov 2021. There were 3 interview rounds.

Round 1 - Case Study 

We had to pitch a product that solved any real-life problem.

Round 2 - One-on-one 

(1 Question)

  • Q1. Questions related to the prepared deck and product design
Round 3 - One-on-one 

(1 Question)

  • Q1. Product Design Exercise

Interview Preparation Tips

Interview preparation tips for other job seekers - Be creative and logical. Don't jump over to the solutions.

Flipkart interview questions for designations

 Product Manager

 (14)

 Senior Product Manager

 (1)

 Associate Manager

 (1)

 Product Designer

 (1)

 Associate

 (4)

 Product Engineer

 (2)

 Senior Associate

 (3)

 Operations Associate

 (2)

Interview questions from similar companies

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

I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. How many cars are their in my hometown
  • Q2. Suddenly on a particular day login count has gone down. How would you proceed ahead to check it
  • Ans. 

    I would start by analyzing the data to identify any potential issues or changes that could have caused the decrease in login count.

    • Check for any recent changes or updates that could have affected the login process

    • Review server logs to identify any errors or issues that may have occurred

    • Reach out to the technical team to investigate any potential technical issues

    • Analyze user feedback or complaints to see if there are an...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basic product management questions

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

Evening test around 5
Platform :- SHL
Environment was amazing

  • Q1. 

    Subtree of Another Tree Problem Statement

    Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.

    Explanation:

    ...
  • Ans. 

    Given two binary trees T and S, determine if S is a subtree of T with the same structure and node values.

    • Check if the second tree is a subtree of the first tree by comparing their structures and node values.

    • Use a recursive approach to traverse both trees and check for equality.

    • Handle cases where one tree is null or the values do not match.

    • Return true if S is a subtree of T, false otherwise.

  • Answered by AI
  • Q2. 

    Search in a Row-wise and Column-wise Sorted Matrix Problem Statement

    You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...

  • Ans. 

    Given a sorted N*N matrix, find the position of a target integer X.

    • Iterate over each row and column to find the target integer X

    • Utilize the sorted nature of the matrix to optimize the search process

    • Return the position of X if found, else return -1 -1

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

1 Hour 
Afternoon

  • Q1. 

    Intersection of Linked List Problem

    You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.

    Your task is to determine t...

  • Ans. 

    Find the node where two linked lists merge, return -1 if no merging occurs.

    • Traverse both lists to find their lengths and the difference in lengths

    • Move the pointer of the longer list by the difference in lengths

    • Traverse both lists simultaneously until they meet at the merging point

  • Answered by AI
  • Q2. 

    Problem: Pair Sum in a Binary Search Tree

    Given a Binary Search Tree (BST) and an integer 'S', your task is to find all pairs of nodes within the BST that total to 'S' and return these pairs. If no such p...

  • Ans. 

    Find pairs of nodes in a BST that sum up to a given value 'S'.

    • Traverse the BST in-order to get a sorted list of nodes.

    • Use two pointers approach to find pairs with sum 'S'.

    • Keep track of visited nodes to avoid using the same node twice in a pair.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Online Round held on Chime

  • Q1. 

    Is Binary Heap Tree Problem Statement

    You are given a binary tree of integers. Your task is to determine if it is a binary heap tree or not.

    Input:

    The first line of input contains an integer ‘T’ denoti...
  • Ans. 

    Determine if a given binary tree is a binary heap tree or not based on certain properties.

    • Check if the binary tree is a complete binary tree where every level, except the last level, is completely filled and the last level is as far left as possible.

    • Ensure that every parent node is greater than all its children nodes, forming a max-heap.

    • If any node does not have a left or right child, it should be represented as -1 in

  • Answered by AI
  • Q2. 

    Edit Distance Problem Statement

    Given two strings S and T with lengths N and M respectively, your task is to find the "Edit Distance" between these strings.

    The Edit Distance is defined as the minimum nu...

  • Ans. 

    The task is to find the minimum number of operations required to convert one string into another using delete, replace, and insert operations.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the edit distances between substrings of the two input strings.

    • Fill up the array based on the minimum of three possible operations: insert, delete, or replace.

    • The final answer will be the value at...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo backlogsAmazon interview preparation:Topics to prepare for the interview - Data Structures, OOPS, OS, DBMS, Dynamic Programming, Trees/Graph, Tries, Hashing, Algorithms, HadoopTime required to prepare for the interview - 4.5 monthsInterview preparation tips for other job seekers

Tip 1 : 1 Programming Language
Tip 2 : Practice Data Structures with atleast 300 ques.
Tip 3 : CS Fundamental

Application resume tips for other job seekers

Tip 1 : 1 Pager
Tip 2 : Add top 3 projects in Resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 180 minutes
Round difficulty - Medium

The online test consisted of 2 coding questions, 30 aptitude MCQs, 30 behavioral MCQs and 10 code snippets to debug. The coding questions were of medium level, aptitude MCQs were easy and the code snippets to debug was also of easy level. Each section had a time constraint.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space beyond constant space complexity.

    • Create a dummy node to start the merged list

    • Iterate through both linked lists and compare nodes to merge them in sorted order

    • Update the next pointers accordingly

    • Handle cases where one list is empty or both lists are empty

    • Return the head of the merged linked list

  • Answered by AI
  • Q2. 

    Minimum Path Sum Problem Statement

    Consider a 2-dimensional grid 'GRID' with 'N' rows and 'M' columns in Ninjaland. Each cell in the grid has an associated cost. The goal is to determine the minimum path ...

  • Ans. 

    The Minimum Path Sum Problem involves finding the minimum sum of costs along a path from the top-left to the bottom-right of a grid.

    • Use dynamic programming to calculate the minimum path sum by considering the costs of moving down or right at each cell.

    • Initialize a 2D array to store the minimum path sum values for each cell in the grid.

    • Iterate through the grid to calculate the minimum path sum for each cell based on the...

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

My interview was at 9:00 am. The interview was conducted on Amazon Chime and my webcam was on. The interviewer also asked me to write the code on a document which can be edited by both me and the interviewer. The difficulty of the questions was of medium level. I was asked 3 coding questions along with 2 questions related to OOPS at the end. The interview ended with the discussion of one of my projects. The interviewer was good and also gave me hints wherever required.

  • Q1. 

    Palindrome Partitioning Problem Statement

    You are given a string S. Your task is to partition S such that every substring of the partition is a palindrome. Your objective is to return all possible palindr...

  • Ans. 

    Given a string, partition it into palindromes and return all possible configurations.

    • Use backtracking to generate all possible palindrome partitions

    • Check if each substring is a palindrome before adding it to the partition

    • Return all valid partitions as an array of strings

  • Answered by AI
  • Q2. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to solve this problem efficiently.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the array as the result.

  • Answered by AI
  • Q3. 

    Find Missing Number In String Problem Statement

    You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S without any separators. During this pro...

  • Ans. 

    Find the missing number in a string of consecutive nonnegative integers.

    • Iterate through the string and check for missing numbers by comparing adjacent integers

    • If a missing number is found, return it as the output

    • Handle cases where there are multiple missing numbers or the string is invalid by returning -1

  • Answered by AI
  • Q4. What are the ACID properties in DBMS?
  • Ans. 

    ACID properties in DBMS ensure data integrity and consistency.

    • Atomicity: All operations in a transaction are treated as a single unit of work, either all succeed or all fail.

    • Consistency: Database remains in a consistent state before and after the transaction.

    • Isolation: Transactions are isolated from each other until they are completed.

    • Durability: Once a transaction is committed, the changes made by it are permanent and...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Punjab Engineering College(Deemed To be University). Eligibility criteriaCandidate must be femaleAmazon interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Graphs, Dynamic Programming, OOPS, Operating System, Database Management, C++,Computer Networks.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : You must have a grip over Data Structures and algorithms. Your concepts must be crystal clear. Pick one coding platform and try to practice at least 7-10 coding questions everyday. I completed around 200+ questions on Leetcode, 200+ questions on Geek For Geeks and around 30-40 questions on InterviewBit. 
Tip 2 : After attempting any coding problem, analyze its time and space complexity. See, if you can further optimize your solution. You can always check the editorials and compare your solution with it.
Tip 3 : Apart from coding questions keep studying concepts of Operating Systems, databases and object oriented programming. You can always refer to Geeks For Geeks articles for it. Also, Coding Ninja's Data Structures and algorithms course in C++ helped me a lot in improving my OOPS concepts specifically.

Application resume tips for other job seekers

Tip 1 : You do not need to have a long list of projects on your resume. One good project with proper knowledge of it will do good. Similarly, do not list down several number of skills. Few skills but roper knowledge of them are enough.
Tip 2 : Do not fake anything on your resume. The interviewer gets to know about it by asking questions. If you aren't able to answer, it leaves a negative impact.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Walk-in and was interviewed in Sep 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Aptitude question
  • Q2. Interview panalam questions

Interview Preparation Tips

Interview preparation tips for other job seekers - How many rounds of interview and aptitude questions models
Contribute & help others!
anonymous
You can choose to be anonymous

Flipkart Interview FAQs

How many rounds are there in Flipkart Associate Product Manager interview?
Flipkart interview process usually has 2-3 rounds. The most common rounds in the Flipkart interview process are One-on-one Round, Case Study and Resume Shortlist.
What are the top questions asked in Flipkart Associate Product Manager interview?

Some of the top questions asked at the Flipkart Associate Product Manager interview -

  1. Should Flipkart enter the cattle trading mark...read more
  2. Questions related to the prepared deck and product des...read more
  3. Product Interview - Problem Solv...read more

Recently Viewed

INTERVIEWS

Capgemini

No Interviews

INTERVIEWS

JustDial

No Interviews

LIST OF COMPANIES

Country Holidays Inn & Suites

Overview

SALARIES

Bharat Aluminium Company (BALCO)

INTERVIEWS

Deutsche Bank

No Interviews

SALARIES

Bharat Aluminium Company (BALCO)

DESIGNATION

LIST OF COMPANIES

Bharat Aluminium Company (BALCO)

Overview

INTERVIEWS

Deutsche Bank

No Interviews

SALARIES

L&T Construction

Tell us how to improve this page.

Flipkart Associate Product Manager Interview Process

based on 2 interviews

Interview experience

3.5
  
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
 • 168 Interviews
View all
Flipkart Associate Product Manager Salary
based on 23 salaries
₹8 L/yr - ₹28.8 L/yr
13% more than the average Associate Product Manager Salary in India
View more details
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
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent