i
Moolya Software Testing
Filter interviews by
Clear (1)
I applied via Company Website and was interviewed before Mar 2023. There were 3 interview rounds.
Multiple choice questions
Common Java programs
Top trending discussions
I applied via Naukri.com and was interviewed in Jan 2024. There was 1 interview round.
final, finally, and finalize are keywords in Java with different meanings.
final is a keyword used to declare a constant value that cannot be modified
finally is a block used in exception handling to ensure a piece of code is always executed
finalize is a method in the Object class used for garbage collection before an object is destroyed
Var is used to declare implicitly typed local variables, while Ref is used for passing arguments by reference.
Var keyword allows the compiler to infer the type of the variable based on the assigned value.
Ref keyword is used to pass arguments by reference, allowing the called method to modify the original value.
Var example: var number = 10; // Compiler infers the type as int
Ref example: void ModifyValue(ref int value) {...
I was interviewed before Mar 2021.
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 duration - 60 minutes
Round difficulty - Medium
In this test round, 2 coding questions were given. Either write the code or pseudo code
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 ar...
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.
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 should be O(N) and space complexity should be O(1).
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DSA.
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...
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.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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.
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.
posted on 10 Nov 2015
posted on 16 Sep 2021
I was interviewed before Sep 2020.
Round duration - 50 minutes
Round difficulty - Medium
Round duration - 20 minutes
Round difficulty - Medium
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'.
Given an array and a target sum, find pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list. Otherwise, add the current element to the hash set.
Sort the pairs based on the first element and then the second element to meet the required output form
Round duration - 20 minutes
Round difficulty - Easy
Round duration - 40 minutes
Round difficulty - Hard
Pointers in C/C++ are variables that store memory addresses. They are used to manipulate memory directly and improve performance.
Pointers are declared using an asterisk (*) before the variable name.
Pointers can be used to dynamically allocate memory using functions like malloc() and free().
Pointers can be used to pass variables by reference to functions.
Tip 1 : Do atleast 1 project
Tip 2 : Practice Data structure programming questions
Tip 3 : Prepare concepts with examples (Coding/Numericals)
Tip 1 : Mention Projects
Tip 2 : Mention only those technologies which you are confident enough.
Tip 3 : Mention extra curricular activities if have.
I applied via Naukri.com and was interviewed in Aug 2019. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
I was interviewed before Oct 2020.
Round duration - 40 minutes
Round difficulty - Medium
Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.
Return the maximum count of 1s obtained by flipping a sub-array at most once.
Round duration - 20 minutes
Round difficulty - Medium
Asked 1 standard algorithm
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms
Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.
posted on 11 May 2021
I applied via Referral and was interviewed in Nov 2020. There were 3 interview rounds.
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Exploratory Software Tester
140
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
54
salaries
| ₹0 L/yr - ₹0 L/yr |
Sdet
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Test Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Sdet Automation Test Engineer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Cigniti Technologies
Think Future Technologies
Test Yantra Software Solutions
Qualitest