Adda 247 Product Manager Interview Questions and Answers

Test was of 1.5 hrs and it was online. It was completely based on technical questions.

This test was offline and it was a pen paper test wherein 10 questions will be given you have to write code or spot the error and correct them.

Q1. Asked questions about React
Add your answer
Q2. Question based on project
Add your answer

Data structure and algorithm, easy and medium 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
Add your answer
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
Add your answer

Create a student support system

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

Basic Aptitude test followed by 2 coding questions. Test was very easy.

This was pen and paper coding test, where we were given 20 questions and we had to write code on paper. Total time was 2-3 hr.

Q1. Technical Interview, 2 coding questions asked, 1 math question and Basics like OOP, Language specific, etc.
Add your answer

I have given the online aptitude test of zeus learning (on campus) , which was the very first round and the test was divided into two parts, first part was mostly coding-decoding questions (aptitude) which was easy according to me but it was tricky too and second part included 2 dsa question and both the questions were of easy level.

1st round
25 mcq apptitude + 10 DSA question

Q1. Project review , opps, sql
Add your answer

Questions in aptitude section was easy and would require good analytical and quantitative skills.

Total 10 questions
6 debugging question
4 easy-medium level coding questions (2 Marks + 3 Marks + 3 Marks + 3 Marks)

Q1. OOPs, Project, SQL Queries, Puzzle/Apptitude
Add your answer