MAQ Software Software Developer Intern Interview Questions and Answers

The test had 2 standard DSA questions and 9 MCQs based on CS fundamentals.

Q1. Two Sum Of leetcode
Ans. 
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
• Use a hashmap to store the difference between the target and current element

• Iterate through the array and check if the current element's complement exists in the hashmap

• Return the indices of the two numbers if found
Answered by AI
Add your answer
Q2. SQL Top 2 candidates query
Ans. 
Retrieve the top 2 candidates based on their scores using SQL.
• Use the SELECT statement to choose the candidate details.

• Utilize the ORDER BY clause to sort candidates by score in descending order.

• Limit the results to the top 2 using the LIMIT clause.

• Example query: SELECT * FROM candidates ORDER BY score DESC LIMIT 2;
Answered by AI
Add your answer

Q1. DBMS Qs were asked
Add your answer
Q2. SQL queries, Normalization etc
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Aptitude + Coding round:
Aptitude Questions (30 questions in 30 minutes), easy-medium level. Just after finishing the Coding round was there, 4 coding questions in 60 minutes.

Q1. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity of the algorithm should be O(N) where N is the size of the array.
Answered by AI
Add your answer
Q2. 
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 an array of integers.
• Iterate through the array and keep track of the current sum and maximum sum.

• Update the maximum sum whenever a new maximum subarray sum is found.

• Handle cases where all elements are negative or the array is empty.

• Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.
Answered by AI
Add your answer
Q3. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. 
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
• Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

• Once the loop is detected, use two pointers to find the start of the loop.

• Adjust the pointers to remove the loop and return the modified linked list.
Answered by AI
Add your answer
Q4. 
Count Distinct Substrings
You are provided with a string S. Your task is to determine and return the number of distinct substrings, including the empty substring, of this given string. Implement the solut...read more
Ans. 
Count distinct substrings of a given string using trie data structure.
• Implement a trie data structure to store all substrings of the given string.

• Count the number of nodes in the trie to get the distinct substrings count.

• Handle empty string case separately.

• Example: For 'ab', distinct substrings are: '', 'a', 'b', 'ab'.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

He started with "Hello Rahul, Tell me about yourself briefly". Then he asked few theoretical questions and asked me about my favourite subject in engineering and why i like it. I named DS and Algorithms and reason is problem solving. He shared two coding questions in chatbox and asked me to write the code on given platform.

Q1. 
Nth Element Of Modified Fibonacci Series
Given two integers X and Y as the first two numbers of a series, and an integer N, determine the Nth element of the series following the Fibonacci rule: f(x) = f(x...read more
Ans. 
Calculate the Nth element of a modified Fibonacci series given the first two numbers and N, with the result modulo 10^9 + 7.
• Implement a function to calculate the Nth element of the series using the Fibonacci rule f(x) = f(x - 1) + f(x - 2)

• Return the answer modulo 10^9 + 7 due to the possibility of a very large result

• The series is 1-based indexed, so the first two numbers are at positions 1 and 2 respectively
Answered by AI
Add your answer

Round duration - 45-60 minutes
Round difficulty - Hard

He started round with coding question + SQL + Coding question and some questions from my projects.

Round duration - 40 minutes
Round difficulty - Medium

Round started with introduce yourself then they provide me link and tell me to share my screen then gave me a problem statement and asked me give approach and solve the question 
and after i coded that question then he asked me write one sql query for finding second highest salary, then started asking technical question on DBMS, OS , Data Structure and after that some question based on my project and technologies which i mentioned in my resume.

Q1. 
Equilibrium Index Problem Statement
Given an array Arr consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elem...read more
Ans. 
Find the equilibrium index of an array where sum of elements on left equals sum on right.
• Iterate through array to calculate prefix and suffix sums

• Compare prefix and suffix sums to find equilibrium index

• Return -1 if no equilibrium index is found
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This time interviewer asked tell me about yourself and then cross questions on my projects. I answered all the questions and he seems satisfied. Then he asked me to share screen and provide me a problem statement and after reading i came to know that it is spiral matrix problem so i started coding and then he asked me 2 to 3 puzzles.

Q1. 
Spiral Matrix Problem Statement
You are given a N x M matrix of integers. Your task is to return the spiral path of the matrix elements.
Input
The first line contains an integer 'T' which denotes the nu...read more
Ans. 
The task is to return the spiral path of elements in a given matrix.
• Iterate through the matrix in a spiral path by adjusting the boundaries of rows and columns.

• Keep track of the direction of traversal (right, down, left, up) to form the spiral path.

• Handle edge cases like when the matrix is a single row or column.

• Implement a function that takes the matrix dimensions and elements as input and returns the spiral path.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This rounded started with one more coding question after that one puzzle like you have 10 balls and 5 lines you have to arrange ball in the lines in a manner that each line have 4 balls. After that they asked Hr questions like, Why MAQ , what is different in MAQ then other top MNCs , Why we should hire you etc.

Q1. 
Minimum Travel Time Problem Statement
Mr. X plans to explore Ninja Land, which consists of N cities numbered from 1 to N and M bidirectional roads connecting these cities. Mr. X needs to select a city as ...read more
Ans. 
The task is to determine the minimum time required to visit all cities and roads in Ninja Land.
• Create a graph representation of the cities and roads.

• Use a traversal algorithm to find the minimum time to visit all cities and roads.

• Return -1 if it is impossible to visit all roads.

• Consider the constraints provided in the problem statement.

• Implement the function to calculate the minimum travel time.
Answered by AI
Add your answer