Mahendra & Co Interview Questions and Answers

Round duration - 90 Minutes
Round difficulty - Medium

2 coding questions and 20 mcq
 

Q1. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Find the minimum time required to rot all fresh oranges in a grid.
• Use Breadth First Search (BFS) to simulate the rotting process.

• Track the time taken to rot all oranges and return -1 if any fresh oranges remain.

• Handle edge cases like no fresh oranges or all oranges already rotten.

• Consider using a queue to efficiently process adjacent oranges.

• Ensure to update the grid with the new state of oranges after each second.
Answered by AI
Add your answer
Q2. 
Calculate Sum of Proper Divisors
Given a natural number N, return the sum of all its proper divisors.
A proper divisor of Y is defined as a number X such that X < Y and Y % X = 0.
Example:
Input:
T...read more
Ans. 
Calculate the sum of proper divisors of a given natural number.
• Iterate from 1 to sqrt(N) and check for divisors

• If a divisor is found, add it to the sum and also add N/divisor if it is not the same as divisor

• Return the sum as the result
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Technical interview

Q1. 
Rearrange Array to Form Largest Number
Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.
...read more
Ans. 
Rearrange the array elements to form the largest possible number by concatenating them.
• Sort the array elements in a custom comparator function to get the largest number.

• Convert the sorted array elements to strings and concatenate them to form the final number.

• Handle cases where the numbers have the same prefix by comparing the concatenated forms.
Answered by AI
Add your answer