Filter interviews by
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
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.
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
Process a string based on specific instructions to manipulate its content effectively.
Identify the instructions: Understand what operations need to be performed on the string.
Use string methods: Utilize built-in functions like split(), join(), replace(), etc.
Consider edge cases: Handle empty strings, special characters, and whitespace appropriately.
Example: For instruction 'reverse', apply string slicing: str[::-1...
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 or...
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
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
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.
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 nu...
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).
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.
A queen can attack another queen if they are...
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.
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'.
...
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.
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 t...
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 ...
I applied via Campus Placement
Coding test was really good it was easier to tackle the problem and writting code for it.
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
I applied via Company Website and was interviewed in Nov 2024. There were 2 interview rounds.
Total two DSA question and 25 mcqs
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.
General on Online editors
Find the first occurrence of an element in a rotated sorted array efficiently using binary search.
A rotated array is a sorted array that has been rotated at some pivot. Example: [4, 5, 6, 7, 0, 1, 2] is a rotated version of [0, 1, 2, 4, 5, 6, 7].
To find the first occurrence, use binary search to reduce time complexity to O(log n).
Check the middle element; if it matches the target, continue searching in the left half to...
Pattern question based on Alphabets
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
Easy 1 hr test and can be completed easily
I applied via Naukri.com and was interviewed in Jun 2024. There were 3 interview rounds.
All type of nalr topics
Dsa basis question on array and string and linked list
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Aptitude and coding of 2 hours
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
It was an 1hr interview session
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
I applied via Company Website and was interviewed in Apr 2023. There were 4 interview rounds.
Leetcode easy, medium
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.
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
Basic aptitude questions
3 basic questions they asked
Pointer and SQL related questions
I applied via Campus Placement and was interviewed in May 2022. There were 4 interview rounds.
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
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
Process a string based on specific instructions to manipulate its content effectively.
Identify the instructions: Understand what operations need to be performed on the string.
Use string methods: Utilize built-in functions like split(), join(), replace(), etc.
Consider edge cases: Handle empty strings, special characters, and whitespace appropriately.
Example: For instruction 'reverse', apply string slicing: str[::-1].
Exa...
Top trending discussions
The duration of MAQ Software Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 13 interview experiences
Difficulty level
Duration
based on 9 reviews
Rating in categories
Software Engineer
814
salaries
| ₹8 L/yr - ₹13.7 L/yr |
Software Engineer Level 1
653
salaries
| ₹6 L/yr - ₹14.2 L/yr |
Software Engineer2
371
salaries
| ₹10 L/yr - ₹17 L/yr |
Associate Software Engineer
144
salaries
| ₹4.5 L/yr - ₹10 L/yr |
Senior Software Engineer
94
salaries
| ₹14.8 L/yr - ₹25.7 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Capital Numbers Infotech