MASAI School Product Manager Interview Questions and Answers

Q1. Basic profile-related questions, job role, salary, location
Add your answer

Q1. It was conducted face-to-face in Noida and lasted for only 5 minutes as the Interviewer (CEO) did not ask any questions related to Product Design, problem-solving. or key aspects that I believe are importa...read more
Add your answer

Q1. Experience, salary and notice period.
Add your answer

Q1. Work experience and the projects you worked on.
Add your answer

Q1. Very basic work experience, salary and notice period questions
Add your answer

Q1. Work experience and salary discussion
Add your answer

Q1. Your relevant experience.
Ans. 
I have 5 years of experience as a Project Manager in the IT industry.
• Managed multiple projects simultaneously

• Led cross-functional teams to successful project completion

• Developed and implemented project plans, timelines, and budgets

• Monitored project progress and ensured adherence to deadlines

• Identified and resolved project issues and risks

• Communicated project updates to stakeholders

• Implemented project management best pr
Answered by AI
Add your answer
Q2. Your willingness to work under strict time.
Ans. 
I am willing to work under strict time constraints.
• I thrive in high-pressure environments and can effectively manage my time to meet deadlines.

• I am skilled at prioritizing tasks and allocating resources efficiently.

• I have experience working on time-sensitive projects and have successfully delivered results within tight timelines.
Answered by AI
Add your answer
Q3. Your previous role and expectations.
Ans. 
In my previous role, I was a Senior Project Manager responsible for overseeing multiple projects and ensuring their successful completion.
• Managed a team of 10 project managers and coordinated their efforts

• Developed and implemented project plans, timelines, and budgets

• Monitored project progress and identified and resolved any issues or risks

• Collaborated with stakeholders to define project scope and objectives

• Regularly c...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Path Queries Problem Statement
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...read more
Ans. 
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
• Use Dijkstra's algorithm to find the shortest path between the given vertices.

• Create a graph data structure to represent the weighted, undirected graph.

• Handle cases where no path exists between the given vertices by returning -1.

• Optimize the algorithm to handle multiple queries efficiently.

• Consider edge cases such as...read more
Answered by AI
Add your answer
Q2. 
Merge Sort Algorithm Problem Statement
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Explanation:
Merge Sort is a divide-an...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively

• Sort the two halves separately

• Merge the sorted halves to produce a fully sorted array

• Time complexity of Merge Sort is O(n log n)

• Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
Answered by AI
Add your answer
Q3. 
Rat in a Maze: All Paths Problem
You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...read more
Ans. 
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
• Use backtracking to explore all possible paths from the starting cell to the destination cell.

• At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.

• Keep track of the path taken so far and mark the cells accordingly.

• Once the destination cell i...read more
Answered by AI
Add your answer

Q1. SQL question difference between having and where
Ans. 
HAVING is used with GROUP BY to filter groups, WHERE is used to filter rows
• HAVING is used with GROUP BY to filter groups based on aggregate functions

• WHERE is used to filter rows based on conditions

• HAVING is applied after GROUP BY, WHERE is applied before GROUP BY

• Example: SELECT department, AVG(salary) FROM employees GROUP BY department HAVING AVG(salary) > 50000;

• Example: SELECT * FROM employees WHERE department = 'S
Answered by AI
Add your answer

2 coding questions with aptitude question(logical aptitude and quantitative aptitude)

This was a Machine Coding. We need to design a system and then they will check our design by running test cases. It was 2.5 hrs long.

Q1. Basic questions on computer core subjects(Deadlock, Networking, Tcp connection, process scheduling etc, DNS Lookup etc)
Add your answer
Q2. Questions on React, Node and the libraries which I used in my project(My project was a full stack project)
Add your answer