MAQ Software Software Developer Interview Questions, Process, and Tips

Basic dsa questions , basic recursion questions of trees ,graphs and searching algorithms there are some mcq questions that too on dsa

They asked few sql and dsa questions like a open board test

Q1. Sort a vector according to other other vector ?
Ans. 
Sort a vector based on another vector
• Use std::sort with a custom comparator function

• The comparator function should compare the indices of the elements in the second vector

• The first vector should be sorted based on the order of the indices in the second vector
Answered by AI
Add your answer
Q2. String processing question where we need to process a string by using given instructions .
Add your answer

Coding test was really good it was easier to tackle the problem and writting code for it.

Q1. Can you tell me about yourself?
Add your answer
Q2. What is the major project you have worked on, and can you provide an explanation of it?
Ans. 
Developed a web-based project management tool for tracking tasks and deadlines.
• Used React.js for front-end development

• Implemented RESTful APIs using Node.js and Express

• Utilized MongoDB for database storage

• Incorporated authentication and authorization features for user security
Answered by AI
Add your answer

Q1. SQL ques and concept
Add your answer

Total two DSA question and 25 mcqs

Q1. Zigzag traversal of binary tree
Ans. 
Zigzag traversal of binary tree involves alternating the direction of traversal at each level.
• Use a queue to perform level order traversal of the binary tree.

• For each level, alternate between adding nodes to the result list from left to right and right to left.

• Continue this process until all levels have been traversed.
Answered by AI
Add your answer
Q2. Minimum swaps to group all ones together
Ans. 
The minimum number of swaps needed to group all ones together in an array of 0s and 1s.
• Iterate through the array to count the total number of ones.

• Use a sliding window of size equal to the total number of ones to find the window with the minimum number of zeros.

• Calculate the number of swaps needed to move all ones to that window.
Answered by AI
Add your answer

General on Online editors

Q1. Find the first occurrence of an element in an rotated array.
Add your answer

Pattern question based on Alphabets

It was an 1hr interview session

Q1. Find the occurrence of each element in an array
Ans. 
Count the occurrence of each element in an array of strings
• Iterate through the array and use a hashmap to store the count of each element

• If element already exists in the hashmap, increment its count by 1

• Return the hashmap with element counts
Answered by AI
Add your answer

Q1. Tell me about yourself
Add your answer

Leetcode easy, medium

Q1. Cpp , dsa , os, cn, coa
Add your answer
Q2. Sort 0,1,2 array
Ans. 
Sort an array of strings containing '0', '1', and '2'.
• Use counting sort algorithm to count the occurrences of '0', '1', and '2'.

• Create a new array with the sorted counts of '0', '1', and '2'.

• Join the sorted array back into a single array of strings.
Answered by AI
Add your answer

Q1. Why should we hire you?
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

Timing was 9: 30 AM. Platform was quite good and easy to understand.

Q1. Reverse Only Letters
You are given a string, ‘S’. You need to reverse the string where characters that are not an alphabet stay in the same place, and the rest reverse their positions.
Eg: “a-bcd” become...read more
Ans. Two Pointer Approach
Approach: Just like in order to reverse a string ‘S’ = “abcd”, we can can swap(S[0], S[3]) and swap(S[1],S[2]) to get new string “dcba”.
 
Similarly in this problem, we do the same using two pointers while ignoring the non-letter characters.
 
Eg: S = “a-bcd” we swap(S[0], S[4]) and swap(S[2], S[3]) to get the result.
 
Algorithm:
1. In the given string what we can do is maintain two variables ...read more
Answered by CodingNinjas
Add your answer
Q2. Find Duplicate
You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N = 5, the array/list constitutes values ...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered by CodingNinjas
Add your answer
Q3. Reverse the array
Given an array with N elements, the task is to reverse all the array elements and print the reversed array.
Input Format:
The first line contains an integer N representing the size of ...read more
Ans. Brute Force approach
• Initialise start and end indices with start = 0, end = N-1 where N is the total number of elements in array.
• We then run a loop while start < end and swap arr[start] with arr[end].
• Finally, we increment start and decrement end variable
Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer
Q4. Sum of Digits
Ninja is given an integer ‘N’. One day Ninja decides to do the sum of all digits and replace the ‘N’ with the sum of digits until it becomes less than 10. Ninja wants to find what will be the...read more
Ans. Brute Force Approach
The main idea is to do the sum of digits until it becomes less than 10.
 
Algorithm:
• Add a condition if N is less than 10 then return N.
• Do the sum of all digits.
• Make a recursive call and pass the sum of digits as N.
• Return the answer which you get from a recursive call.
Space Complexity: O(1)Explanation:
O(1).
 
We are using constant space to solve this.
Time Complexity: OtherExplanation:
O(log10(...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 30 minutes
Round difficulty - Easy

Timing was 9:30 AM. The interviewer was very nice.

Q1. Nth Fibonacci Number
Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -
    F(n) = F(n-1) + F(n-2), 
    Where, F(1) = F(2) = 1
Provided N you have...read more
Ans. Recursive Approach
• In this approach, we use recursion and uses a basic condition that :
  • If ‘N’ is smaller than ‘1’(N<=1) we return ‘N’
  • Else we call the function again as ninjaJasoos(N-1) + ninjaJasoos(N-2).
• In this way, we reached our answer.
Space Complexity: O(n)Explanation:
O(N),  where ‘N’ is the given number.  
As recursion uses a stack of size ‘N’
Time Complexity: O(2^n)Explanation:
O(2^N), where ‘N’ i...read more
Answered by CodingNinjas
View 2 more answers
Q2. SQL Question
Write SQL query to find second highest salary from a Table.
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was not good.

Q1. Count Frequency
You are given a string 'S' of length 'N', you need to find the frequency of each of the characters from ‘a’ to ‘z’ in the given string.
Example :
Given 'S' : abcd...read more
Ans. Count Frequency
Since there are just 26 lower case characters, we can use an array of size 26 to store the result.
 
Here is the algorithm : 
 
1. Create an array (say, ‘FREQ’), where 0-th index stores the frequency of ‘a’, 1st index stores the frequency of ‘b’ and so on. So the last index i.e. 25th index stores the frequency of ‘z’.
2. Run a for loop from 0 to ‘N’ - 1 (say, iterator ‘i’), on the string and do the f...read more
Answered by CodingNinjas
Add your answer
Q2. DBMS Question
What is Normalization and 3NF?
Add your answer