Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by MASAI School Team. If you also belong to the team, you can get access from here

MASAI School Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

MASAI School Associate Product Manager Interview Questions and Answers

Updated 23 May 2024

MASAI School Associate Product Manager Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. RCA questions, Questions through your resume

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Internshala and was interviewed before Jan 2023. There were 2 interview rounds.

Round 1 - HR 

(2 Questions)

  • Q1. Tell us about yourself.
  • Q2. Why do you want to become a product manager?
Round 2 - Technical 

(1 Question)

  • Q1. I was asked questions based on my assignment to test my product sense.

I applied via Campus Placement and was interviewed in Aug 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

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

Round 3 - Coding Test 

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.

Round 4 - One-on-one 

(2 Questions)

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

Interview Preparation Tips

Topics to prepare for BrightCHAMPS Software Developer interview:
  • Computer Networking
  • Operating Systems
  • Database Management
  • React.Js
  • Data Structures
Interview preparation tips for other job seekers - Prepare your resume well and be prepared for project based questions. ( They will deep dive in that subject). Besides that have a basic understanding of core cs subjects and common dsa problems.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. What is OOPS concepts.
  • Ans. 

    OOPS concepts refer to Object-Oriented Programming principles like inheritance, encapsulation, polymorphism, and abstraction.

    • Inheritance: Allows a class to inherit properties and behavior from another class.

    • Encapsulation: Bundling data and methods that operate on the data into a single unit.

    • Polymorphism: Ability to present the same interface for different data types.

    • Abstraction: Hiding the complex implementation detail

  • Answered by AI
  • Q2. What is PDO and uses in PHP.
  • Ans. 

    PDO stands for PHP Data Objects, a database access layer providing a uniform method of access to multiple databases.

    • PDO is a PHP extension that provides a data-access abstraction layer.

    • It supports multiple database systems like MySQL, PostgreSQL, SQLite, etc.

    • PDO helps prevent SQL injection attacks by using prepared statements.

    • It allows for error handling and supports transactions.

    • Example: $pdo = new PDO('mysql:host=loc...

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Oct 2023. There were 3 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Find duplicates in an array
  • Ans. 

    Use a hash set to find duplicates in an array of strings.

    • Create a hash set to store unique elements.

    • Iterate through the array and check if the element is already in the hash set.

    • If it is, then it is a duplicate. If not, add it to the hash set.

  • Answered by AI
  • Q2. Find single duplicate element in an array where contents of the array are length of array - 1
  • Ans. 

    Find the single duplicate element in an array of strings with length n-1.

    • Iterate through the array and use a HashSet to keep track of elements seen so far.

    • If an element is already in the HashSet, that is the duplicate element.

    • Return the duplicate element once found.

  • Answered by AI
Round 2 - Assignment 

Create a student support system

Round 3 - One-on-one 

(1 Question)

  • Q1. Design an order and payments system for an EdTech company
  • Ans. 

    Design an order and payments system for an EdTech company

    • Allow users to browse and select courses

    • Implement a shopping cart for users to add courses

    • Integrate payment gateways for secure transactions

    • Provide order confirmation and receipt to users

    • Allow users to track their order status

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview in Nov 2020.

Round 1 - Coding Test 

(3 Questions)

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...

  • 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...

  • Answered by AI
  • 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...

  • 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
  • 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...

  • 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...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dronacharya College of Engineering. I applied for the job as SDE - 1 in NoidaEligibility criteriaNo criteriaLido Learning interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming etcTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
 

Application resume tips for other job seekers

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • 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
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Basic coding and MySQL queries. Like Types of join, having and where difference etc.

Round 2 - HR 

(1 Question)

  • Q1. Salary Discussion.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

A general apti round

Round 2 - Assignment 

Data analysis assignment

Round 3 - Technical 

(1 Question)

  • Q1. Sql questions askes
Round 4 - One-on-one 

(1 Question)

  • Q1. Product sense round
Round 5 - HR 

(1 Question)

  • Q1. Culture fit round
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Jul 2024. There were 3 interview rounds.

Round 1 - HR 

(2 Questions)

  • Q1. About Myself in details
  • Q2. Past internships and work experiences
Round 2 - Technical 

(2 Questions)

  • Q1. Primary keys, Unique key
  • Q2. Usage advantages and disadvantages of Indexing
Round 3 - Coding Test 

SQL- 1 departments with no users
2 dept_id and their respective no. of users

DSA1: Most frequent no. in an array
DSA2: Zero Sum subarray exists

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basis DSA well

MASAI School Interview FAQs

How many rounds are there in MASAI School Associate Product Manager interview?
MASAI School interview process usually has 1 rounds. The most common rounds in the MASAI School interview process are One-on-one Round.

Tell us how to improve this page.

MASAI School Associate Product Manager Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Testbook.com Interview Questions
3.5
 • 99 Interviews
Teachnook Interview Questions
3.1
 • 87 Interviews
Internshala Interview Questions
3.9
 • 56 Interviews
Lido Learning Interview Questions
2.3
 • 55 Interviews
Acadecraft Interview Questions
3.5
 • 52 Interviews
FastInfo Interview Questions
4.1
 • 50 Interviews
Coding Ninjas Interview Questions
3.8
 • 49 Interviews
BrightCHAMPS Interview Questions
3.7
 • 40 Interviews
View all
MASAI School Associate Product Manager Salary
based on 4 salaries
₹8.5 L/yr - ₹20 L/yr
13% less than the average Associate Product Manager Salary in India
View more details
Operations Manager
40 salaries
unlock blur

₹5 L/yr - ₹13 L/yr

Full Stack Web Developer
29 salaries
unlock blur

₹1 L/yr - ₹8 L/yr

Data Analyst
18 salaries
unlock blur

₹4.2 L/yr - ₹8.5 L/yr

Full Stack Developer
17 salaries
unlock blur

₹1 L/yr - ₹8 L/yr

Software Engineer
16 salaries
unlock blur

₹5 L/yr - ₹10 L/yr

Explore more salaries
Compare MASAI School with

FastInfo

4.1
Compare

Testbook.com

3.5
Compare

Lido Learning

2.3
Compare

Acadecraft

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview