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

Software Engineer Interview Questions & Answers

Adobe user image Devendra Bendkhale

posted on 4 Dec 2015

Interview Questionnaire 

8 Questions

  • Q1. WRITE A GENERIC SWAP FUNCTION
  • Ans. 

    A generic swap function swaps two values of any data type.

    • The function should take two parameters of any data type.

    • Use a temporary variable to store the value of one parameter.

    • Assign the value of the second parameter to the first parameter.

    • Assign the value of the temporary variable to the second parameter.

  • Answered by AI
  • Q2. SEARCH AN ELEMENT IN ROTATED SORTED LINKLIST .
  • Ans. 

    Search for an element in a rotated sorted linked list.

    • Find the pivot point where the list is rotated.

    • Divide the list into two sublists based on the pivot point.

    • Perform binary search on the appropriate sublist.

    • Handle edge cases such as empty list and list with only one element.

  • Answered by AI
  • Q3. SEARCH AN ELEMENT IN ROTATED SORTED ARRAY. WRITED A CODE FOR IT
  • Ans. 

    Search an element in a rotated sorted array

    • Find the pivot point where the array is rotated

    • Divide the array into two sub-arrays based on pivot point

    • Perform binary search on the appropriate sub-array

    • Repeat until element is found or sub-array size is 1

  • Answered by AI
  • Q4. In an Array of size 95 contain numbers in range 1 to 100. each number is at max once in the array. find the 5 missing numbers in array between 1-100
  • Ans. 

    Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.

    • Create a boolean array of size 100 and mark the present numbers

    • Iterate through the boolean array and find the missing numbers

    • Alternatively, use a HashSet to store the present numbers and find the missing ones

  • Answered by AI
  • Q5. Given sudoku as id array of size . in a given empty cell find the possible numbers that could be possible. Asked me to write code for it
  • Ans. 

    Given a Sudoku board, find possible numbers for an empty cell.

    • Iterate through empty cells and check possible numbers using row, column, and box constraints.

    • Use a set to keep track of possible numbers for each empty cell.

    • Return the set of possible numbers for the given empty cell.

  • Answered by AI
  • Q6. Given 4 unsigned integers find their integer average (eg. (2,2,2,3) => (2+2+2+3)/4 = 2) consider integer division ) without typecasting
  • Ans. 

    Find integer average of 4 unsigned integers without typecasting

    • Add all the integers and divide by 4

    • Use bit shifting to divide by 4

    • Handle overflow by using long long data type

    • Use unsigned int data type for input

  • Answered by AI
  • Q7. Write a code to identify wheter given processor is of 32 bit architecture or 64 bit architecture
  • Ans. 

    Code to identify 32 bit or 64 bit architecture of a processor

    • Check if the operating system is 32 bit or 64 bit

    • If OS is 32 bit, processor is 32 bit

    • If OS is 64 bit, check if processor supports 64 bit architecture

    • Use CPUID instruction to check if processor supports 64 bit architecture

  • Answered by AI
  • Q8. Convert a binary number into base 64 integer
  • Ans. 

    Convert binary number to base 64 integer

    • Divide the binary number into groups of 6 bits

    • Convert each group of 6 bits to decimal

    • Map the decimal value to the corresponding base 64 character

    • Concatenate the base 64 characters to form the final integer

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: SIMPLE CODING QUESTIONS SPEED MATTERS.
Duration: 60 minutes
Total Questions: 3

Skills: Analytics And Coding
College Name: IIT Guwahati

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Salary discussion and notice period
  • Q2. Core java, collections and coding

Interview Preparation Tips

Round: Manager Round
Experience: About project and previous company experience , daily activity

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. C++/Java
  • Q2. Puzzles and Project

Interview Preparation Tips

Round: Test
Tips: Maintain speed . Questions were basic and easy.

Round: Technical Interview
Experience: Technical PI:
1.C:Basic topics of C.Malloc and Clloc difference.Storage classes.Let us C is enough .
2.C++/Java: OOPs concept with real life examples,Collection in Java,Constructors etc . Site i referred: JAVATPOINT
3.DBMS: Explain normalization with the help of examples,ACID properties,Triggers,SQL queries.
4.Project related questions.
5.puzzles from programmer interview.com




Tips: DBMS and JAVA concepts should be clear.

Round: HR Interview
Experience: HR Round:
1.tell me about yourself.
2.Which activities are you involved in other than academics?
3.How many companies have you tried before and how many rounds cleared?
4.What you did in internship and how much they paid you?
5.Strenghts and weaknesses.
6.Any questions you have.

Skills: Puzzle Solving Capability, Basic C/C++, Java Programming, Basic Knowledge Of DBMS
College Name: NIT Raipur

I appeared for an interview before Jan 2016.

Interview Preparation Tips

College Name: NIT Hamirpur

Interview Preparation Tips

Round: Resume Shortlist
Experience: I had a standard resume for this company as per the norms of our institute’s placement cell. For Oracle I laid emphasis on my programming skills and projects related to it.

Round: Test
Experience: The first round was the written test that comprised of 5 sections – vocabulary, aptitude, pattern matching, logical reasoning and programming. The questions in the programming section were asked from data structures and C++. The questions in the programming section were mainly from trees (from data structures). Around 400 students appeared for their written test out of which around 100 were shortlisted.

Round: HR Interview
Experience: The next round was the interview round. They gave me some puzzles to solve and a program to write. One of the puzzles that I remember was that if I were to be given an egg then how would I determine its durability, i.e. how would I determine that from which floor do I need to throw the egg from so that the egg does not break if thrown from any floor below it.
For the coding question I was given a mathematical formula and I was asked to devise a code such that the program uses the formula and gives the output.
Tips: Prepare for Data Structures as well as the commonly asked puzzles for Oracle.

College Name: IIT ROORKEE
Motivation: Oracle is a reputed company in the space of software and ITeS. It had come to our campus with five profiles. The best means to know about all of them is to attend the pre-placement talk of the company.

Interview Questionnaire 

6 Questions

  • Q1. Solving puzzles(25 horses,ant and sweets,height of a building..) try as many as possible before appearing for interview
  • Q2. If experienced , then project details of previous companies a must prepare question
  • Q3. Writing test cases for random scenarios
  • Q4. Programming in whatsoever language you r comfortable with, basic coding problems of DS,Algos. eg. Zigzag tree traversal algo,random linked list copy
  • Q5. Some people asked me questions related to the work i will do if hired in the project
  • Q6. Be genuine in ur CV, and be prepared with everything you write there.

Interview Preparation Tips

College Name: Na

I appeared for an interview before May 2016.

Interview Preparation Tips

Round: Test
Experience: First section had questions on object oriented programming concepts and some basic questions related to c++
In the second section tables were given and we were asked to write the queries for the given questions.
Duration: 1 hour
Total Questions: 20

College Name: IIITDM Jabalpur

I applied via LinkedIn and was interviewed before May 2021. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Basics in Java, Microservices & Spring boot

Interview Preparation Tips

Interview preparation tips for other job seekers - Be thorough with your basics on Java 8, Spring boot

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
 • 857 Interviews
KPIT Technologies Interview Questions
3.4
 • 283 Interviews
Adobe Interview Questions
3.9
 • 234 Interviews
Salesforce Interview Questions
4.0
 • 226 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
NICE Interview Questions
3.6
 • 81 Interviews
View all
MapmyIndia Software Trainee Salary
based on 8 salaries
₹2 L/yr - ₹3 L/yr
23% 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
197 salaries
unlock blur

₹1.6 L/yr - ₹5 L/yr

GIS Executive
152 salaries
unlock blur

₹1.8 L/yr - ₹4 L/yr

Software Engineer
100 salaries
unlock blur

₹3 L/yr - ₹8.6 L/yr

Software Developer
93 salaries
unlock blur

₹2 L/yr - ₹8.6 L/yr

GIS Trainee
88 salaries
unlock blur

₹1.4 L/yr - ₹3 L/yr

Explore more salaries
Compare MapmyIndia with

TomTom

4.1
Compare

Oracle

3.7
Compare

KPIT Technologies

3.4
Compare

Intellect Design Arena

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