MapmyIndia Product Intern Interview Questions and Answers

Online MCQs about various CS topics like, SQL, DSA etc.

2 DSA Questions based on arrays, strings etc

Q1. Went through my Resume, asked me to expalain my project, then asked a few standard HR Questions.
Add your answer
Q2. Explain the Project HR Questions about where do you see yourself in 5 years.
Add your answer

Q1. Explain C++ memory management & pointers
Ans. 
C++ memory management involves allocating and deallocating memory for variables, while pointers store memory addresses.
• Pointers are variables that store memory addresses.

• They are used to access and manipulate data stored in memory.

• Example: int* ptr = new int; *ptr = 10; delete ptr;
Answered by AI
Add your answer
Q2. Puzzle question -> 12 people on island with a seesaw. 11 of them have identical weight, one has higher or lower. How can you find out which one? You can only use the seesaw 3 times
Add your answer

Test on hackerrank, was easy to crack

Q1. 2nd round was telephonic interview Started with a puzzle question. Asked about C++ pointers in depth, specially memory management
Add your answer

Q1. Questions related to Projects in Resume
Add your answer
Q2. 2 Leetcode Medium questions
Add your answer

2 medium-hard leetcode problem

Q1. 1. Binary tree traversal 2. Multiply 2 big numbers represented in the form of string. 3. Detect the k-th node from the back of a linked list.
Ans. 
Questions on binary tree traversal, multiplying big numbers represented as strings, and detecting k-th node from the back of a linked list.
• Binary tree traversal can be done in three ways: in-order, pre-order, and post-order.

• To multiply two big numbers represented as strings, you can use the grade-school algorithm or Karatsuba algorithm.

• To detect the k-th node from the back of a linked list, you can use two pointers app
Answered by AI
Add your answer

Round duration - 138 minutes
Round difficulty - Easy

Webcam and microphone were mandatory .
There was 16 mcqs (45 min),2 coding questions(60 min),1 essay writing(10 min) and gamified assessment(23 min).

Q1. 
Maximum Non-Adjacent Subsequence Sum
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
Input:
The first line consists of an...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was from 2 pm to 3pm. Interviewer was really friendly and provided me hints whenever I was stuck.

Q1. 
Power Calculation Problem Statement
Given a number x and an exponent n, compute xn. Accept x and n as input from the user, and display the result.
Note:
You can assume that 00 = 1.
Input:
Two integers...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

It was an online round with coding questions, MCQs and a technical writing part

Q1. 
Sort Array by Set Bit Count
Given an array of positive integers, your task is to sort the array in decreasing order based on the count of set bits in the binary representation of each integer.
If two num...read more
Add your answer
Q2. 
Minimum Number of Lamps Needed
Given a string S containing dots (.) and asterisks (*), where a dot represents free spaces and an asterisk represents lamps, determine the minimum number of additional lamps...read more
Add your answer
Q3. Technical Article
A situation is given, we have to write a technical article of around 300-500 words (I dont remember exact word limit)
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was an online telephonic round, I was aksed to share my screen and to open my code editor. I generally code in VS Code, So I shared my VS code screen with the interviewer.
Timing - 4pm
Environment was good
Interviewer was nice person

Q1. 
Validate BST Problem Statement
Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.
A binary search tree (BST)...read more
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Add your answer