Filter interviews by
I applied via Campus Placement and was interviewed in Dec 2023. There were 2 interview rounds.
The test had 2 standard DSA questions and 9 MCQs based on CS fundamentals.
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
I applied via Campus Placement and was interviewed before Mar 2023. There was 1 interview round.
I appeared for an interview in Jan 2021.
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.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
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.
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.
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.
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.
A...
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.
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...
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'.
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.
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...
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
Round duration - 45-60 minutes
Round difficulty - Hard
He started round with coding question + SQL + Coding question and some questions from my projects.
Tip 1 : Be very good with basic data structures.
Tip 2 : Try writing code on notepad sometimes.
Tip 3 : Focus on problem solving, during interview speak out your approach simultaneously while you are thinking about approach
Tip 1 : Write only what you know.
Tip 2 : Make it short.
I appeared for an interview in Dec 2020.
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.
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...
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
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.
You are given a N x M
matrix of integers. Your task is to return the spiral path of the matrix elements.
The first line contains an integer 'T' which denotes the nu...
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.
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.
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 ...
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.
Tip 1 : Practice coding questions from geeksforgeeks it will help you.
Tip 2 : Learn concepts so well like OS, DBMS, Sql Query.
Tip 3 : Prepare your resume so well, highlight projects, achievements and skills
Tip 1 : Should have some good projects in your resume and mention if you have done coding in any platform
Tip 2 : Have knowledge about technologies related to ML or Data Analytics or Azure.
MAQ Software interview questions for designations
I appeared for an interview before Sep 2020.
Round duration - 30 Minutes
Round difficulty - Easy
Your task is to rearrange a given array ARR
such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...
Rearrange array to move zeros to the left while maintaining relative order of non-zero elements.
Iterate through the array and maintain two pointers, one for zero elements and one for non-zero elements.
Swap elements at the two pointers until all zeros are moved to the left.
Ensure to maintain the relative order of non-zero elements while rearranging the array.
Round duration - 50 Minutes
Round difficulty - Medium
You are provided with an array ARR
consisting of N
distinct integers in ascending order and an integer TARGET
. Your objective is to count all the distinct pairs in ARR
whose sum...
Count distinct pairs in an array whose sum equals a given target.
Use two pointers approach to iterate through the array and find pairs with sum equal to target.
Keep track of visited pairs to avoid counting duplicates.
Return -1 if no such pair exists with the given target.
Tip 1 : Write good optimized code
Tip 2 : Prepare Data Structures
Tip 3 : Should have atleast one good project
Tip 1 : Don't make resume too lengthy.
Tip 2 : Have some projects on resume.
Get interview-ready with Top MAQ Software Interview Questions
Top trending discussions
I appeared for an interview in Jul 2024.
Leet code medium level question
Hashmap is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.
Hashmap uses a hashing function to map keys to indices in an array.
It allows for constant time complexity O(1) for insertion, deletion, and retrieval operations.
Example: HashMap<String, Integer> map = new HashMap<>(); map.put("key", 123); int value = map.get("key");
posted on 12 Mar 2025
I appeared for an interview before Mar 2024, where I was asked the following questions.
posted on 25 Jun 2021
Microservices design pattern focuses on breaking down a monolithic application into smaller, independent services. Java design patterns are reusable solutions to common software problems.
Microservices design pattern promotes modularity, scalability, and fault tolerance.
Java design patterns include creational, structural, and behavioral patterns.
Examples of Java design patterns include Singleton, Factory, and Observer.
E...
Joins are used to combine data from two or more tables based on a related column.
Types of joins include inner join, left join, right join, and full outer join.
Inner join returns only the matching rows from both tables.
Left join returns all rows from the left table and matching rows from the right table.
Right join returns all rows from the right table and matching rows from the left table.
Full outer join returns all row...
posted on 28 Oct 2023
It was basic test. online.
2 questions on arrays. online.
The general topic. Be point to point
based on 2 interviews
Interview experience
Software Engineer
703
salaries
| ₹5 L/yr - ₹15.5 L/yr |
Software Engineer Level 1
603
salaries
| ₹5 L/yr - ₹13.6 L/yr |
Software Engineer2
310
salaries
| ₹8 L/yr - ₹18 L/yr |
Associate Software Engineer
134
salaries
| ₹3.6 L/yr - ₹10 L/yr |
Senior Software Engineer
87
salaries
| ₹11.5 L/yr - ₹26 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions