Upload Button Icon Add office photos

Filter interviews by

Clear (1)

MAQ Software Software Developer Interview Questions, Process, and Tips

Updated 25 Dec 2024

Top MAQ Software Software Developer Interview Questions and Answers

  • Q1. Find the Duplicate Number Problem Statement Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there i ...read more
  • Q2. Character Frequency Problem Statement You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string. Examp ...read more
  • Q3. 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 ...read more
View all 22 questions

MAQ Software Software Developer Interview Experiences

14 interviews found

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 120 minutes
Round difficulty - Easy

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

  • Q1. 

    Reverse Only Letters Problem Statement

    You are given a string S. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.

    Example:

    Input:
    S = "...
  • Ans. 

    Reverse the letters of a string while keeping non-alphabet characters in their original position.

    • Iterate through the string and store the non-alphabet characters in their original positions

    • Reverse the letters using two pointers technique

    • Combine the reversed letters with the non-alphabet characters to get the final reversed string

  • Answered by AI
  • Q2. 

    Find the Duplicate Number Problem Statement

    Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...

  • Ans. 

    Find the duplicate number in an array of integers from 0 to N-2.

    • Iterate through the array and keep track of the frequency of each number using a hashmap.

    • Return the number with a frequency greater than 1 as the duplicate number.

  • Answered by AI
  • Q3. 

    Reverse Array Elements

    Given an array containing 'N' elements, the task is to reverse the order of all array elements and display the reversed array.

    Explanation:

    The elements of the given array need to...

  • Ans. 

    Reverse the order of elements in an array and display the reversed array.

    • Iterate through the array from both ends and swap the elements until the middle is reached.

    • Use a temporary variable to store the element being swapped.

    • Print the reversed array after all elements have been swapped.

  • Answered by AI
  • Q4. 

    Sum of Digits Problem Statement

    Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...

  • Ans. 

    Given an integer, find the final single-digit value after summing its digits iteratively.

    • Iteratively sum the digits of the given integer until the result is a single-digit number

    • Output the final single-digit integer for each test case

    • Handle multiple test cases efficiently

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

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

  • Q1. 

    Nth Fibonacci Number Problem Statement

    Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

    Input:

    ...
  • Ans. 

    Calculate the Nth Fibonacci number efficiently using dynamic programming.

    • Use dynamic programming to store and reuse previously calculated Fibonacci numbers.

    • Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.

    • Optimize the solution to avoid redundant calculations by storing intermediate results.

    • Time complexity can be reduced to O(N) using dynamic programming.

    • Example: For N = 5, the 5th F

  • Answered by AI
  • Q2. Write an SQL query to find the second highest salary from a table.
  • Ans. 

    SQL query to find the second highest salary from a table

    • Use the MAX() function to find the highest salary

    • Use the NOT IN operator to exclude the highest salary from the results

    • Order the results in descending order and limit the query to return only the second row

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was not good.

  • Q1. 

    Character Frequency Problem Statement

    You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.

    Example:

    Input:
    S : abcdg
    Output:
    1...
  • Ans. 

    The task is to find the frequency of each character from 'a' to 'z' in a given string.

    • Create an array of size 26 to store the frequency of each character from 'a' to 'z'.

    • Iterate through the string and increment the corresponding index in the array for each character encountered.

    • Print the array of frequencies as the output for each test case.

  • Answered by AI
  • Q2. What is normalization and can you explain the concept of Third Normal Form (3NF)?
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.

    • Normalization is a database design technique used to structure a relational database in a way that reduces data redundancy and improves data integrity.

    • Third Normal Form (3NF) is a level of database normalization where every non-prime attribute of a table is dependent on the primary key.

    • To achieve 3NF, a table m...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Do 2 projects.
Tip 2 : Practice data structures programs.
Tip 3 : Take a course on Coding Ninjas.

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Mar 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 120 minutes
Round difficulty - Medium

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

  • Q1. 

    Reverse Only Letters Problem Statement

    You are given a string S. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.

    Example:

    Input:
    S = "...
  • Ans. 

    Reverse the letters of a string while keeping non-alphabet characters in their original position.

    • Iterate through the string and maintain two pointers, one at the start and one at the end, to reverse only the letters

    • Use isalpha() function to check if a character is an alphabet or not

    • Swap the letters at the two pointers until they meet in the middle

  • Answered by AI
  • Q2. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a set to store duplicates.

    • Example: For input [0, 3, 1, 2, 3], output should be [3].

  • Answered by AI
  • Q3. 

    Pancake Sorting Problem Statement

    You are given an array of integers 'ARR'. Sort this array using a series of pancake flips. In each pancake flip, you need to:

    Choose an integer 'K' where 1 <= 'K' <...
  • Ans. 

    Sort an array using pancake flips and return the sequence of flips made.

    • Iterate through the array and find the position of the maximum element in each iteration.

    • Perform pancake flips to move the maximum element to the correct position.

    • Continue this process until the array is sorted.

    • Return the sequence of positions from where flips were made.

  • Answered by AI
  • Q4. 

    Sum of Digits Problem Statement

    Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...

  • Ans. 

    Given an integer, find the final single-digit value after summing its digits iteratively.

    • Iteratively sum the digits of the given integer until the result is a single-digit number

    • Output the final single-digit integer for each test case

    • Handle multiple test cases efficiently

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

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

  • Q1. 

    Fibonacci Number Verification

    Identify if the provided integer 'N' is a Fibonacci number.

    A number is termed as a Fibonacci number if it appears in the Fibonacci sequence, where each number is the sum of...

  • Ans. 

    Check if a given number is a Fibonacci number or not.

    • Iterate through the Fibonacci sequence until you find a number greater than or equal to the given number.

    • Check if the given number matches the Fibonacci number found in the sequence.

    • If the number matches, output 'YES'; otherwise, output 'NO'.

  • Answered by AI
  • Q2. Write an SQL query to find the second highest salary from a table.
  • Ans. 

    SQL query to find the second highest salary from a table

    • Use the MAX() function to find the highest salary

    • Use the WHERE clause to exclude the highest salary

    • Order the salaries in descending order and limit the result to 1

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 30 Minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was not good.

  • Q1. 

    Character Frequency Problem Statement

    You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.

    Example:

    Input:
    S : abcdg
    Output:
    1...
  • Ans. 

    The task is to find the frequency of each character from 'a' to 'z' in a given string.

    • Create an array of size 26 to store the frequency of each character from 'a' to 'z'.

    • Iterate through the string and increment the count of the corresponding character in the array.

    • Print the array of frequencies as the output for each test case.

  • Answered by AI
  • Q2. What is normalization and can you explain the concept of Third Normal Form (3NF)?
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.

    • Normalization is a technique used to organize data in a database efficiently.

    • Third Normal Form (3NF) is a level of normalization that ensures that data is stored in a way that prevents certain types of data anomalies.

    • In 3NF, every non-prime attribute is fully functionally dependent on the primary key.

    • For exampl...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, DBMS, OSTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do 2 projects.
Tip 2 : Practice data structures programs.
Tip 3 : Take a course on Coding Ninjas.

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

There were two section Aptitude and Coding.

  • Q1. 

    Buy and Sell Stock Problem Statement

    Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...

  • Ans. 

    The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

    • Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.

    • Keep track of the maximum profit after the first transaction and the maximum profit overall by considering different combinations of buy a...

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This was the first technical interview.

  • Q1. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • Keep track of pairs in a hash set to avoid duplicates.

    • Sort the pairs based on the criteria mentioned in the question.

    • Return the sorted list of pairs.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from National Institute of Technology, Raipur. I applied for the job as SDE - 1 in HyderabadEligibility criteria7 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, Operating System, DBMS, Computer NetworksTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare theory subjects well
Tip 2 : Start doing some development and learn a framework from 2nd year
 

Application resume tips for other job seekers

Tip 1: Mention projects with technologies
Tip 2: Make important words in bold

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Coding Test 

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

  • Q1. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate all valid configurations and print them out.

  • Answered by AI
  • Q2. 

    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...
  • 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 should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

  • Q1. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading, trailing, and multiple spaces.

    • Split the input string by spaces to get individual words

    • Reverse the order of the words

    • Join the reversed words with a single space in between

  • Answered by AI
  • Q2. 

    Circular Linked List Detection

    You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.

    Note:
    • A linked list is considered circula...
  • Ans. 

    Detect if a given linked list is circular by checking if it forms a closed loop.

    • Traverse the linked list using two pointers, one moving at double the speed of the other.

    • If the two pointers meet at any point, the linked list is circular.

    • If the faster pointer reaches the end of the list (NULL), the linked list is not circular.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

MAQ Software interview questions for designations

 Software Developer Intern

 (5)

 Software Engineer

 (26)

 Software Engineer2

 (2)

 Software Intern

 (2)

 Associate Software Engineer

 (12)

 Software Engineer Intern

 (2)

 Senior Software Engineer

 (1)

 Software Engineer Level 1

 (9)

Contribute & help others!
anonymous
You can choose to be anonymous

MAQ Software Interview FAQs

How many rounds are there in MAQ Software Software Developer interview?
MAQ Software interview process usually has 3 rounds. The most common rounds in the MAQ Software interview process are Coding Test, Technical and Aptitude Test.
What are the top questions asked in MAQ Software Software Developer interview?

Some of the top questions asked at the MAQ Software Software Developer interview -

  1. find the occurrence of each element in an ar...read more
  2. sort a vector according to other other vecto...read more
  3. Minimum swaps to group all ones toget...read more
How long is the MAQ Software Software Developer interview process?

The duration of MAQ Software Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.

Recently Viewed

INTERVIEWS

Transrail Lighting

No Interviews

INTERVIEWS

LTIMindtree

No Interviews

INTERVIEWS

NeuralMetrics

No Interviews

INTERVIEWS

Cloud Analogy

No Interviews

INTERVIEWS

MAQ Software

No Interviews

INTERVIEWS

ClearTax

No Interviews

INTERVIEWS

Samsung E&A

No Interviews

INTERVIEWS

Hitachi Astemo

No Interviews

INTERVIEWS

Zomato

No Interviews

INTERVIEWS

Schaeffler India

No Interviews

Tell us how to improve this page.

MAQ Software Software Developer Interview Process

based on 12 interviews

4 Interview rounds

  • Coding Test Round - 1
  • Coding Test Round - 2
  • Technical Round
  • HR Round
View more
MAQ Software Software Developer Salary
based on 47 salaries
₹4.8 L/yr - ₹15.9 L/yr
18% more than the average Software Developer Salary in India
View more details

MAQ Software Software Developer Reviews and Ratings

based on 9 reviews

2.9/5

Rating in categories

3.4

Skill development

2.0

Work-life balance

3.1

Salary

2.4

Job security

1.8

Company culture

2.6

Promotions

2.1

Work satisfaction

Explore 9 Reviews and Ratings
Software Engineer
708 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer Level 1
593 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer2
296 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Software Engineer
133 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
83 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare MAQ Software with

TCS

3.7
Compare

Infosys

3.6
Compare

Wipro

3.7
Compare

HCLTech

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent