Upload Button Icon Add office photos

MapmyIndia

Compare button icon Compare button icon Compare

Filter interviews by

MapmyIndia Software Trainee Interview Questions and Answers

Updated 20 Nov 2024

MapmyIndia Software Trainee Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Basics of CS fundamentals
  • Q2. Deep diving into projects and college curriculum
  • Ans. 

    I have experience deep diving into projects and college curriculum, gaining valuable skills and knowledge.

    • I have completed multiple projects during my college years, where I delved deep into the subject matter to understand it thoroughly.

    • I have a strong academic background in software development, which has equipped me with the necessary skills to analyze and comprehend complex topics.

    • I actively seek out opportunities ...

  • Answered by AI
Round 2 - Technical 

(2 Questions)

  • Q1. Explain 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. Family background and General QnA

Interview Preparation Tips

Interview preparation tips for other job seekers - Just prepare everything from your resume

Interview questions from similar companies

I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Given a 2d matrix with some D doors and W walls, we need fill distance matrix with minimum distance to the nearest door
  • Ans. 

    Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.

    • Iterate through the matrix and find the doors

    • Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door

    • Update the distance matrix with the minimum distances

  • Answered by AI
  • Q2. Given a read-only array we want to find kth smallest element in unordered array with O(1) space
  • Ans. 

    Find kth smallest element in unordered array with O(1) space

    • Use the QuickSelect algorithm to partition the array and find the kth smallest element

    • Choose a pivot element and partition the array into two subarrays

    • Recursively partition the subarray that contains the kth smallest element

    • Repeat until the pivot element is the kth smallest element

    • Time complexity: O(n) average case, O(n^2) worst case

  • Answered by AI
  • Q3. Design question
  • Q4. Find friends of friend who already are not friends with you
  • Ans. 

    To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.

    • Get your list of friends

    • For each friend, get their list of friends

    • Exclude yourself and your friends from the final list of friends of friends

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Tips: Just walk the interviewer through the solution you're proposing.

Round: Other Interview
Experience: He started with a design question with how to stream an image such that all clients see the same image at the same time. You need to take care of delays, network problems. He kept on adding new elements like compression, streaming, utc time related issues, client rendering delays and so on.

Round: Other Interview
Experience: This was bar-raiser round.

Skills: Design, Algorithms And Data Structures, Graph Theory
College Name: IIT Madras

Skills evaluated in this interview

I was interviewed before Apr 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.

  • Q1. 

    Kth Largest Element Problem Statement

    Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.

    Example:

    Input:
    Array: [2,1,5,6,3,8], K ...
  • Ans. 

    Find the Kth largest element in an array of distinct positive integers.

    • Sort the array in non-increasing order

    • Return the Kth element from the sorted array

    • Handle multiple test cases

  • Answered by AI
  • Q2. 

    Orange Rotting Problem Statement

    Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:

    • Value 0: Represents an empty cell.
    • Value 1: Represents a fresh orang...
  • Ans. 

    The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.

    • Create a queue to store the rotten oranges and their time of rotting.

    • Iterate through the grid to find the initial rotten oranges and add them to the queue.

    • Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.

    • Continue until the queue is empty, ke...

  • Answered by AI
Round 2 - Face to Face 

Round duration - 45 minutes
Round difficulty - Easy

This was a design round.

Interview Preparation Tips

Eligibility criteriaAbove 8 CGPAUber interview preparation:Topics to prepare for the interview - Design, Algorithms And Data Structures, Graph Theory, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

32 Questions

  • Q1. Discussion on the rectangular board question asked in prev round
  • Q2. How will you implement a shuffle function for a playlist of songs
  • Ans. 

    Implementing a shuffle function for a playlist of songs

    • Create a new empty playlist

    • Randomly select a song from the original playlist and add it to the new playlist

    • Remove the selected song from the original playlist

    • Repeat until all songs have been added to the new playlist

    • Return the new shuffled playlist

  • Answered by AI
  • Q3. What is memory leak?
  • Ans. 

    Memory leak is a situation where a program fails to release memory it no longer needs.

    • Memory leaks can cause a program to consume more and more memory over time, eventually leading to crashes or other issues.

    • Memory leaks can be caused by programming errors such as not freeing memory after it is no longer needed.

    • Tools like valgrind can be used to detect memory leaks in C and C++ programs.

    • Examples of memory leaks include...

  • Answered by AI
  • Q4. What is the problem with arrays?
  • Ans. 

    Arrays have fixed size and can lead to memory wastage and performance issues.

    • Arrays have a fixed size and cannot be resized dynamically.

    • Inserting or deleting elements in an array can be time-consuming.

    • Arrays can lead to memory wastage if they are not fully utilized.

    • Arrays can cause performance issues if they are too large and need to be traversed frequently.

    • Arrays can also be prone to buffer overflow attacks.

    • Example: A...

  • Answered by AI
  • Q5. Write a function in javascript to hide text on mouse click
  • Ans. 

    Function to hide text on mouse click in JavaScript

    • Create a function that takes an element as input

    • Add an event listener to the element for a mouse click

    • Toggle the element's display property between 'none' and its original value

  • Answered by AI
  • Q6. A unsorted array was given and a number x.find out the two elements whose sum is equal to x
  • Ans. 

    Find two elements in an unsorted array whose sum is equal to a given number x.

    • Use a hash table to store the difference between x and each element in the array.

    • Iterate through the array and check if the current element is in the hash table.

    • Return the pair of elements that add up to x.

  • Answered by AI
  • Q7. More questions on basic OS concepts related to storage, memory
  • Q8. Puzzle : -----/
  • Q9. What is BST ?
  • Ans. 

    BST stands for Binary Search Tree, a data structure used for efficient searching and sorting operations.

    • BST is a tree-like data structure where each node has at most two children.

    • The left child of a node contains a value less than the parent node, while the right child contains a value greater than the parent node.

    • BST allows for efficient searching and sorting operations with a time complexity of O(log n).

    • Examples of a...

  • Answered by AI
  • Q10. How many BSTs are possible with two nodes and three nodes?
  • Ans. 

    Number of possible BSTs with 2 and 3 nodes.

    • For 2 nodes, only 2 BSTs are possible.

    • For 3 nodes, 5 BSTs are possible.

    • Number of BSTs can be calculated using Catalan numbers formula.

    • Catalan(2) = 2, Catalan(3) = 5.

  • Answered by AI
  • Q11. How many trees are possible with two and three nodes?
  • Ans. 

    Answering the question about possible trees with two and three nodes.

    • For two nodes, there is only one possible tree.

    • For three nodes, there are three possible trees.

    • The formula for calculating the number of possible trees with n nodes is (2n-3)!!.

    • The double exclamation mark represents the double factorial function.

    • The double factorial function is defined as n!! = n(n-2)(n-4)...(1 or 2).

  • Answered by AI
  • Q12. Puzzle : 100 people are standing in a circle .each one is allowed to shoot a person infront of him and he hands the gun to the next to next person for e.g 1st person kills 2nd and hands gun to 3rd .This c...
  • Q13. What is indexing? Why it is used?
  • Q14. What are B+ trees?what is the advantage?
  • Ans. 

    B+ trees are balanced trees used for indexing and searching large amounts of data.

    • B+ trees are similar to binary search trees but have multiple keys per node.

    • They are commonly used in databases and file systems.

    • B+ trees have a high fanout, reducing the number of disk accesses required for searching.

    • They are also self-balancing, ensuring efficient performance even with large amounts of data.

    • Example: In a database, a B+ ...

  • Answered by AI
  • Q15. Any questions you want to ask?
  • Ans. 

    Yes, I have a few questions.

    • Can you tell me more about the team I'll be working with?

    • What is the company culture like?

    • What are the biggest challenges the team is currently facing?

    • Can you walk me through the development process for a typical project?

    • What opportunities are there for professional growth and development?

  • Answered by AI
  • Q16. Asked me about the skills i have mentioned in my resume
  • Q17. Which data structure i like?
  • Ans. 

    I prefer hash tables for their constant time lookup and insertion.

    • Hash tables are efficient for storing and retrieving data.

    • They have constant time complexity for both insertion and lookup.

    • They can be implemented using arrays or linked lists.

    • Examples include Python's dictionary and Java's HashMap.

  • Answered by AI
  • Q18. Can you implement a stack using queue
  • Ans. 

    Yes, we can implement a stack using two queues.

    • Push operation: Enqueue the element to the first queue.

    • Pop operation: Dequeue all elements from the first queue and enqueue them to the second queue until the last element. Dequeue and return the last element. Swap the names of the queues.

    • Top operation: Same as pop operation but don't dequeue the last element.

    • Example: Push 1, 2, 3. Queue 1: 1 2 3. Queue 2: empty. Pop opera...

  • Answered by AI
  • Q19. Two arrays of arrival time of trains and departure time of trains were given. find the minimum no of platforms require so that no collision occurs
  • Ans. 

    Find minimum no of platforms required to avoid collision between trains based on their arrival and departure times.

    • Sort both arrays in ascending order

    • Initialize platform count and max count to 1

    • Loop through both arrays and compare arrival and departure times

    • If arrival time is less than or equal to departure time, increment platform count

    • Else, decrement platform count

    • Update max count if platform count is greater than ma

  • Answered by AI
  • Q20. What is JVM ? Difference between JVM and compiler
  • Ans. 

    JVM stands for Java Virtual Machine. It is an abstract machine that provides a runtime environment for Java programs.

    • JVM is responsible for interpreting the compiled Java code and executing it.

    • It provides platform independence by converting bytecode into machine-specific code.

    • JVM has various components like class loader, bytecode verifier, and execution engine.

    • Compiler converts source code into bytecode, while JVM exec...

  • Answered by AI
  • Q21. He asked me to write a html code for a page design he gave
  • Q22. He asked me to write a query for a relational schema and problem statement given by him
  • Q23. Tell me about Yourself
  • Ans. 

    I am a software engineer with experience in developing web applications and a passion for learning new technologies.

    • Experienced in developing web applications using technologies such as Java, Spring, and Angular

    • Passionate about learning new technologies and keeping up with industry trends

    • Strong problem-solving skills and ability to work in a team environment

    • Completed a Bachelor's degree in Computer Science from XYZ Uni

  • Answered by AI
  • Q24. She asked me if i was nervous
  • Q25. What do i know about PayTM ?
  • Ans. 

    PayTM is an Indian e-commerce payment system and digital wallet company.

    • PayTM was founded in 2010 by Vijay Shekhar Sharma.

    • It started as a mobile recharge and bill payment platform.

    • PayTM has expanded to offer services like online shopping, movie ticket booking, and travel bookings.

    • It also offers a digital wallet that can be used to pay for various services and products.

    • PayTM has over 350 million registered users and is ...

  • Answered by AI
  • Q26. Any feature i would like to add in PayTM app?
  • Ans. 

    I would like to add a feature for splitting bills among friends.

    • The feature would allow users to split bills for movies, dinners, etc.

    • Users can select friends from their contact list and split the bill equally or unequally.

    • The app would send a notification to the selected friends to pay their share.

    • The feature would make it easier for users to split expenses and avoid awkward conversations.

    • It would also encourage more

  • Answered by AI
  • Q27. What is my favourite app and any improvements in it which i want to implement?
  • Ans. 

    My favourite app is Spotify. I would like to see improvements in the algorithm for personalized playlists.

    • Improved algorithm for personalized playlists

    • Better integration with social media platforms

    • Option to create collaborative playlists with friends

  • Answered by AI
  • Q28. She asked me about my school and which school i like the most and why?
  • Q29. She asked me about my family
  • Q30. What is my favourite subject?
  • Ans. 

    My favourite subject is Computer Science.

    • I enjoy programming and problem-solving.

    • I find algorithms and data structures fascinating.

    • I am interested in artificial intelligence and machine learning.

    • I like learning about new technologies and keeping up with industry trends.

  • Answered by AI
  • Q31. Have i ever been to delhi?
  • Q32. Why do I choose NIT Hamirpur? what do i like about Hamirpur?
  • Ans. 

    I choose NIT Hamirpur because of its excellent academic reputation and beautiful campus.

    • NIT Hamirpur has a strong focus on academics and research, which aligns with my career goals.

    • The campus is located in a serene and picturesque location, which provides a conducive environment for learning.

    • The faculty members are highly experienced and knowledgeable, and are always willing to help students.

    • The college has state-of-th...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: General aptitude was easy.It was of 30 mins.
Next technical aptitude and coding questions were of 50 mins duration.
Technical aptitude questions were from OS,C,C++,DBMS.Questions were based on basic concepts.
There were 3 coding questions.
1.A girl eat fish of exact length of 10.She can cut the fish to get the desired length.An array of lengths of fish and maximum possible cuts allowed were given.Find out the max number of fish the girl can eat.
2. A 2-D rectangular board which contains sand grains : 'o' ,obstacles: 'x' and empty cells : '.' .The board is kept vertical. The sand grain can move down into and empty cell but it cannot cross obstacle. find out the final position of all sand grains in the board.
3.It was question on subsequence .
Tips: Just keep your basic concepts clear. Practice questions on strings,dynamic programming and recursion.Go through Geeksforgeeks .It'll help you a lot.
Duration: 80mins minutes
Total Questions: 50

Round: Technical Interview
Experience: The interviewer was very calm and polite. He was giving me hints and enough time to solve the questions.
Tips: Keep talking with the interviewer .Discuss your approach. Do take hints they give you.

Round: Technical Interview
Experience: I was stuck in one or two questions but they keep giving me hints. Interviewers were very nice. They were asking me the approach for each question. They were very cool.

Tips: Stay calm and go ahead. Apply whatever basic knowledge you have . keep asking doubts for the questions if you have any.

Round: Technical Interview
Experience: He asked me about my projects. What was my role. It was an hour long round. Enough time was given to solve each question.I was asked to write code with minimum complexity.
Tips: Keep discussing the questions. Try to reach to the best approach .keep smiling.Never fake your resume.

Round: HR Interview
Experience: The HR was very polite.I was a bit nervous at first but then I was relaxed.
Tips: Just be yourself .You are almost done when you are selected for HR. :) Keep Smiling and be confident about what ever you say.

General Tips: Be confident and have clear basic concepts of all subjects.
Skill Tips: Practise as many questions as you can on geeksforgeeks.
Skills: Coding skills, Logical skills, Aptitude, Basic Knowledge of DBMS
College Name: NIT Hamirpur
Motivation: My recent project work related to E-commerce and the reputation and ecstatic growth of the company in recent months.
Funny Moments: after one of the technical round , interviewer asked me if i had any questions about the company.I asked them what kind of rewards will be given .. do you guys go for trips and get any free coupons :P

Skills evaluated in this interview

Interview Questionnaire 

7 Questions

  • Q1. Given an array find the number of conitnuous sequences having equal number of 0's and 1's
  • Ans. 

    Count the number of continuous sequences with equal number of 0's and 1's in an array.

    • Iterate through the array and keep track of the count of 0's and 1's encountered so far.

    • Store the difference between the counts in a hash table and increment the count for that difference.

    • If the difference is already present in the hash table, add the count to the existing value.

    • Return the sum of all values in the hash table.

  • Answered by AI
  • Q2. Number of substrngs which are palindrome
  • Ans. 

    Count the number of palindromic substrings in a given string.

    • A substring is a contiguous sequence of characters within a string.

    • A palindrome is a string that reads the same backward as forward.

    • Use dynamic programming to count all palindromic substrings.

    • Time complexity can be reduced to O(n^2) using Manacher's algorithm.

  • Answered by AI
  • Q3. Longest Palindrom in a string in O(n)
  • Ans. 

    Find the longest palindrome in a given string in linear time complexity.

    • Use Manacher's algorithm to find the longest palindrome in a string in O(n) time complexity.

    • The algorithm involves preprocessing the string to add special characters to handle even and odd length palindromes.

    • Then, it uses a combination of dynamic programming and symmetry properties to find the longest palindrome.

    • For example, in the string 'babad',

  • Answered by AI
  • Q4. Find the value of pie
  • Ans. 

    The value of pie is a mathematical constant approximately equal to 3.14159.

    • Pie is the ratio of the circumference of a circle to its diameter.

    • It is an irrational number, meaning it cannot be expressed as a finite decimal or fraction.

    • Pie is commonly used in geometry and trigonometry calculations.

    • The value of pie is often approximated as 3.14 or 22/7.

  • Answered by AI
  • Q5. Project discussion
  • Q6. Tell me about yourself
  • Ans. 

    I am a passionate software engineer with experience in developing web applications using various technologies.

    • Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular

    • Proficient in backend development with Node.js and databases like MongoDB and MySQL

    • Familiar with version control systems like Git and deployment tools like Docker

    • Strong problem-solving skills and ability

  • Answered by AI
  • Q7. Will u be able to fit in the company ?
  • Ans. 

    Yes, I believe I will be able to fit in the company based on my experience, skills, and values.

    • I have experience working in diverse teams and adapting to different work cultures.

    • I share the company's values and vision, which align with my own.

    • I am eager to learn and contribute to the team, fostering a positive work environment.

    • I have strong communication skills, which are essential for collaboration and teamwork.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 20 minutes
Total Questions: 20

Round: Technical Interview
Experience: Nice
Tips: Cormen
Programming contests
Interviewbit.com
geeksforgeeks.com

Round: Technical Interview
Experience: niice
Tips: Cormen
Programming contests
Interviewbit.com
geeksforgeeks.com

Round: Technical Interview
Experience: nice
Tips: do some projects

Round: HR Interview
Experience: nice
Tips: read on google on how to answer such questions

General Tips: geeksforgeeks.com
Skill Tips: Cormen
Programming contests
Interviewbit.com
geeksforgeeks.com
Skills: c , algorithms , data structures
College Name: Delhi Technological University, Delhi

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 120 minutes
Round difficulty - Easy

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium levels. Time was enough and no sectional time was present. 1-2 MCQs on SQL was also present.

  • Q1. 

    Boolean Matrix Transformation Challenge

    Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...

  • Ans. 

    Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.

    • Iterate through the matrix to find elements with value 1

    • Store the row and column indices of these elements

    • Update the entire row and column for each element found to be 1

  • Answered by AI
Round 2 - Video Call 

Round duration - 60 minutes
Round difficulty - Easy

It was an online video interview round on HackerEarth with a simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class that required inheritance was asked by the interviewer to write. I was helped by the interviewer if I got stuck somewhere, Some questions on the implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in HyderabadEligibility criteriaAbove 7 CGPAUber interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, Aptitude , Programming Language.Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Clear basics
Tip 2 : Prepare well
Tip 3 : Do at-least 2 projects

Application resume tips for other job seekers

Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Find the k-th Node from the End of a Linked List

    Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...

  • Ans. 

    To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.

    • Iterate through the linked list to determine its size.

    • Calculate the position of the k-th node from the end based on the size of the list.

    • Traverse the list again to reach the k-th node from the end.

    • Return a pointer to the k-th node from the end.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

High level System Design

  • Q1. Can you design a system like Uber, explaining the various components and architecture involved?
  • Ans. 

    Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.

    • User app for booking rides and tracking

    • Driver app for accepting rides and navigation

    • Server for handling requests and communication between apps

    • Database for storing user, driver, and ride information

    • Algorithms for matching riders with drivers and routing

  • Answered by AI
Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

Basic HR questions

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in HyderabadEligibility criteriaAbove 7 CgpaUber interview preparation:Topics to prepare for the interview - Data Structures, React JS, JavaScript, DBMS, AlgorithmsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practise DSA/coding consistently
Tip 2 : Choose a tech stack and Make side hobby projects
Tip 3 : Give mock interviews for your preparation evaluation

Application resume tips for other job seekers

Tip 1 : Pointers about your current job responsibility
Tip 2 : Side Projects with Tech stack

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Normal coding question medium level , approach focusing rounds actually how you get up to result

Interview Preparation Tips

Interview preparation tips for other job seekers - "GfG must do" should be solved properly alteast , otherwise go keep on practicing on any platform .

I applied via Referral and was interviewed before May 2021. There were 3 interview rounds.

Round 1 - Coding Test 

I dont remember exact questions but they are like leetcode easy and medium

Round 2 - One-on-one 

(2 Questions)

  • Q1. How web/internet works?
  • Ans. 

    The web/internet is a network of interconnected devices that communicate through standardized protocols to share information.

    • Devices connect to the internet through ISPs

    • Data is transmitted through packets using TCP/IP protocols

    • Web browsers use HTTP/HTTPS protocols to request and receive web pages

    • DNS servers translate domain names to IP addresses

    • Web servers host web pages and respond to requests

    • Search engines use web cr

  • Answered by AI
  • Q2. Coding questions with complete explanation
Round 3 - One-on-one 

(1 Question)

  • Q1. Coding and managerial round similar to round 2

Interview Preparation Tips

Interview preparation tips for other job seekers - practice coding well and some development skill. you are good to go

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Dec 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. What if you found that there is an error in your code which tester missed and the project is going to live in morning. What will you do even they issue remain after trying to fix in extra hours(night).
  • Ans. 

    I would immediately inform the project manager and the testing team about the error and work collaboratively to find a solution.

    • Notify the project manager and testing team about the error

    • Collaborate with the testing team to understand the issue

    • Analyze the code to identify the root cause of the error

    • Work with the development team to fix the error as quickly as possible

    • Perform thorough testing to ensure the issue is reso...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Stay honest and completely open about work and working style.

Skills evaluated in this interview

MapmyIndia Interview FAQs

How many rounds are there in MapmyIndia Software Trainee interview?
MapmyIndia interview process usually has 2 rounds. The most common rounds in the MapmyIndia interview process are Technical.
How to prepare for MapmyIndia Software Trainee interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at MapmyIndia. The most common topics and skills that interviewers at MapmyIndia expect are Angular, CSS, Front End, HTML and JQuery.
What are the top questions asked in MapmyIndia Software Trainee interview?

Some of the top questions asked at the MapmyIndia Software Trainee interview -

  1. Deep diving into projects and college curricu...read more
  2. Explain OOPS conce...read more
  3. Basics of CS fundament...read more

Tell us how to improve this page.

MapmyIndia Software Trainee Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Oracle Interview Questions
3.7
 • 848 Interviews
Paytm Interview Questions
3.3
 • 752 Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
PolicyBazaar Interview Questions
3.6
 • 349 Interviews
JustDial Interview Questions
3.5
 • 328 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
KPIT Technologies Interview Questions
3.4
 • 281 Interviews
Adobe Interview Questions
3.9
 • 234 Interviews
Salesforce Interview Questions
4.0
 • 223 Interviews
View all
MapmyIndia Software Trainee Salary
based on 8 salaries
₹2 L/yr - ₹3 L/yr
18% less than the average Software Trainee Salary in India
View more details

MapmyIndia Software Trainee Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

4.0

Skill development

5.0

Work-life balance

3.0

Salary

4.0

Job security

4.0

Company culture

4.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
GIS Engineer
198 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

GIS Executive
154 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
99 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
92 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

GIS Trainee
88 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare MapmyIndia with

TomTom

4.0
Compare

JustDial

3.5
Compare

CarDekho Group

3.7
Compare

Zomato

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