Mastek Enterprise Solutions Interview Questions and Answers

Round duration - 30 Minutes
Round difficulty - Medium

It is the technical interview round. I was provided the slot of 11:40 AM - 12:20 PM. It is scheduled on the hirepro platform. The interview platform is already integrated with a coding editor. The interviewer joined at 11:50 AM. They asked me a lot of questions regarding OOPS, SQL and also give me coding questions along with test cases to build and run at that time.

Q1. 
Maximum Non-Crossing Ropes Problem
In a village with a river at its center, there are ‘N’ houses on each bank of the river. The northern bank’s houses have distinct X-coordinates given by an array A[1], A...read more
Ans. 
The task is to find the maximum number of non-crossing rope connections possible between houses on each bank of a river.
• Sort the arrays A and B in ascending order.

• Use dynamic programming to find the longest increasing subsequence between A and B.

• The length of the longest increasing subsequence is the maximum number of non-crossing connections.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

I was asked 2 coding questions, questions from my projects and questions related to different java concepts. One question from cloud computing was also asked.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Explanation...read more
Ans. 
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
• Iterate through the array and keep track of the current sum and maximum sum seen so far.

• If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.

• Return the maximum sum as the result.

• Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.
Answered by AI
Add your answer
Q2. 
Add Two Numbers as Linked Lists
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...read more
Ans. 
Add two numbers represented as linked lists and return the sum as a linked list.
• Traverse both linked lists simultaneously while keeping track of carry

• Create a new linked list to store the sum

• Handle cases where one list is longer than the other

• Consider edge cases like carry at the end of addition
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was a normal discussion about the role, the job expectations and about the company culture.