Massmutual Global Business Services Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on DSA were discussed.

Q1. 
Ninja and Sorted Array Merging Problem
Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...read more
Ans. 
Merge two sorted arrays into one sorted array within the first array.
• Create a pointer for the last index of ARR1 and ARR2 to start merging from the end.

• Compare elements from both arrays and place the larger element at the end of ARR1.

• Continue this process until all elements are merged in sorted order within ARR1.
Answered by AI
Add your answer
Q2. 
Reverse Alternate Levels of a Perfect Binary Tree Problem Statement
Given a perfect binary tree consisting of 'N' nodes, reverse the nodes at alternate levels in the tree (i.e., reverse level 2, level 4, ...read more
Ans. 
Reverse alternate levels of a perfect binary tree by reversing nodes at even levels starting from level 2.
• Traverse the tree in level order and store nodes at even levels in a separate list.

• Reverse the list of nodes at even levels.

• Update the tree with the reversed nodes at even levels.

• Repeat the process for alternate levels starting from level 2.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on OS, Java were discussed.

Q1. What are the characteristics of distributed file systems?
Ans. 
Characteristics of distributed file systems include scalability, fault tolerance, and data replication.
• Scalability: Distributed file systems can easily scale to accommodate a large amount of data and users.

• Fault tolerance: They are designed to continue functioning even if some components fail, ensuring high availability.

• Data replication: Data is often replicated across multiple nodes to ensure reliability and performan...read more
Answered by AI
Add your answer
Q2. Design a file sharing mechanism between two users.
Ans. 
Design a file sharing mechanism between two users.
• Implement a secure login system for both users.

• Allow users to upload files to a shared server.

• Provide a way for users to view and download files shared by the other user.

• Implement access control to ensure only authorized users can access the shared files.
Answered by AI
Add your answer
Q3. What is ConcurrentHashMap in Java?
Ans. 
ConcurrentHashMap is a thread-safe implementation of the Map interface in Java.
• ConcurrentHashMap allows multiple threads to read and write to the map concurrently without causing any issues like deadlocks or data corruption.

• It achieves thread-safety by dividing the map into segments, each of which can be locked independently.

• ConcurrentHashMap is more efficient than using synchronized maps for concurrent access.

• Example:...read more
Answered by AI
Add your answer
Q4. How do you analyze the usage history of an application?
Ans. 
Analyzing usage history involves tracking user interactions, patterns, and trends to improve application performance.
• Collect and store user interaction data such as clicks, page views, and time spent on each feature.

• Use analytics tools to generate reports and visualize usage patterns.

• Identify popular features, user preferences, and areas for improvement based on usage data.

• Implement A/B testing to compare different ver...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical interview round with questions based on DSA.

Q1. 
Binary Tree Traversals
Your task is to compute the In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes, where each node has an integer value.
Input:
T
For each test cas...read more
Ans. 
Compute In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes.
• Implement tree traversal algorithms: In-Order, Pre-Order, and Post-Order.

• Use recursion to traverse the binary tree efficiently.

• Handle null nodes represented by -1 in the input.

• Follow the order of nodes as they appear in the level order traversal.

• Ensure the output is space-separated lists for each traversal type.
Answered by AI
Add your answer
Q2. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
• Use a combination of hashmap and doubly linked list to implement the LRU cache.

• Keep track of the least recently used item and update it accordingly.

• Ensure to handle cache capacity by evicting the least recently used item when the cache is full.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA, OS etc.

Q1. 
Number of Islands II Problem Statement
You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....read more
Ans. 
The task is to determine the number of islands present on a 2D grid after each query of converting water to land.
• Create a function that takes the grid dimensions, queries, and coordinates as input.

• For each query, convert the water at the given coordinates to land and update the grid.

• Use depth-first search (DFS) to find connected lands and count the number of islands.

• Return the number of islands after each query.
Answered by AI
Add your answer
Q2. Why are synchronized blocks needed in Java?
Ans. 
Synchronized blocks are needed in Java to ensure thread safety by allowing only one thread to access a block of code at a time.
• Prevents multiple threads from accessing critical sections of code simultaneously

• Ensures data consistency and prevents race conditions

• Improves performance by reducing contention for shared resources

• Example: synchronized block in a method that updates a shared variable
Answered by AI
Add your answer