Filter interviews by
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. You...
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.
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
.
...
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 ...
Given an array containing 'N' elements, the task is to reverse the order of all array elements and display the reversed array.
The elements of the given array need to ...
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.
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
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.
S = "a...
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
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 order...
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].
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 e...
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 ...
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'.
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' <...
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.
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 i...
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
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.8 L/yr |
Software Engineer Level 1
652
salaries
| ₹6 L/yr - ₹14.2 L/yr |
Software Engineer2
366
salaries
| ₹8 L/yr - ₹18.5 L/yr |
Associate Software Engineer
152
salaries
| ₹3.5 L/yr - ₹12 L/yr |
Senior Software Engineer
94
salaries
| ₹9 L/yr - ₹30 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Capital Numbers Infotech