Filter interviews by
Retest is the process of testing a previously failed test case again after the defects have been fixed. Test Load refers to the amount of work that a system can handle.
Retest is done to ensure that the defect has been fixed and the system is working as expected.
Test Load testing is done to determine the maximum capacity of the system and to identify any performance issues.
Retest is a part of regression testing while Te...
Test case scenario is a detailed description of a specific test case that includes input data, expected output, and steps to be followed.
Test case scenario is a set of steps that a tester follows to validate a particular functionality of the software.
It includes input data, expected output, and steps to be followed.
Test case scenarios are designed to ensure that the software meets the requirements and specifications.
Th...
Regression testing is the process of testing changes made to a software application to ensure that existing functionality still works.
It is performed after making changes to the software application
It ensures that existing functionality is not affected by the changes
It helps to identify any new defects introduced by the changes
It can be automated to save time and effort
Examples include testing after bug fixes, new feat
Test Strategy is a high-level plan to achieve testing objectives and goals.
It outlines the testing approach, scope, and objectives.
It defines the testing methods, techniques, and tools to be used.
It identifies the roles and responsibilities of the testing team.
It includes the test environment, test data, and test schedule.
It is created based on project requirements and risks.
Example: A test strategy for a web applicati...
Load testing is a type of performance testing that checks how a system handles a high volume of users or transactions.
It involves simulating a high volume of users or transactions to test the system's response time, throughput, and resource utilization.
Load testing can be done using tools like JMeter, LoadRunner, or Gatling.
It helps identify bottlenecks and performance issues in the system.
Load testing can be used to d...
Top trending discussions
I applied via Company Website and was interviewed in Sep 2022. There were 4 interview rounds.
Basic Aptitude questions like quantitative and logical
Programs have to written for given questions
I applied via Company Website and was interviewed in May 2022. There were 4 interview rounds.
The test contains basic programming output questions and some aptitude questions.
We have to solve 5 programming questions in 1 hour. Questions are on arrays and strings.
Three technical questions related to string manipulation and clock calculations.
For parenthesis balancing, use a stack data structure to keep track of opening and closing brackets.
To reverse a string, use two pointers starting from the beginning and end of the string and swap characters until they meet in the middle.
To find the angle between hour and minute hand of clock, use the formula (30H - 11/2M) degrees, where H
The question asks to check if a number is prime and add all its digits.
To check if a number is prime, we can use a loop to divide it by all numbers from 2 to its square root.
If the number is divisible by any of these numbers, it is not prime.
To add all digits in a number, we can use a loop to extract each digit and add it to a running total.
I applied via Campus Placement and was interviewed in Jun 2022. There were 6 interview rounds.
20 questions were given.
aptitude + simple coding output based.
5 questions were shared on a doc file. We need to code them paste their solutions in the file. Level was easy to medium. Array-string based Questions.
Find minimum angle between hour and minute hand.
Calculate the angle made by hour hand with 12 o'clock position and minute hand with 12 o'clock position.
Calculate the difference between the two angles.
If the difference is greater than 180 degrees, subtract it from 360 degrees to get the minimum angle.
Sort an array of 0s and 1s with low complexity.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0s from the beginning with 1s from the end until the pointers meet.
Time complexity: O(n), space complexity: O(1).
Find the maximum span of 1 in a 0,1 array.
Iterate through the array and keep track of the first and last occurrence of 1.
Calculate the difference between the last and first occurrence of 1.
Repeat the process for all 1's in the array and return the maximum difference.
Find the first non-repeating character in a string.
Create a hash table to store the frequency of each character in the string.
Iterate through the string and update the frequency in the hash table.
Iterate through the string again and return the first character with a frequency of 1.
Sort a binary array using one traversal and no extra space.
Use two pointers, one starting from the beginning and one from the end of the array.
Swap the elements if the left pointer points to 1 and the right pointer points to 0.
Continue traversing until the pointers meet in the middle.
posted on 22 Oct 2023
I applied via Campus Placement and was interviewed before Feb 2023. There were 3 interview rounds.
Very easy basic logical questions
Easy level array string questions
2 questions asked should give optimized approach
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
posted on 15 Jul 2022
I applied via Recruitment Consulltant and was interviewed in Jun 2022. There were 3 interview rounds.
Some Questions are based on programming and some are aptitude questions.
This is coding round here 5 coding questions is there?
Find the first non-repeated character in a string.
Iterate through the string and count the frequency of each character.
Return the first character with a count of 1.
Find the second maximum difference in an integer array.
Sort the array in descending order
Calculate the difference between adjacent elements
Return the second maximum difference
Given an integer, find the sum of all its digits.
Convert the integer to a string and iterate over each character to get the sum.
Use modulo operator to get the last digit and add it to the sum, then divide by 10 to remove the last digit.
Recursively call the function with the integer divided by 10 and add the remainder to the sum.
Basic technical que on java c++
Google docs paltform
5 coding ques
I applied via Referral and was interviewed before Dec 2021. There were 5 interview rounds.
20 basic coding and non coding mcq with 60 min time.
5 basic coding problems with 60 min time based on arrays string and numbers.
based on 1 interview
Interview experience
Software Developer
44
salaries
| ₹1 L/yr - ₹4.9 L/yr |
Associate Software Engineer
15
salaries
| ₹3 L/yr - ₹6.7 L/yr |
Junior Software Developer
15
salaries
| ₹1 L/yr - ₹3.3 L/yr |
Senior Software Engineer
12
salaries
| ₹4.2 L/yr - ₹15 L/yr |
Software Engineer
9
salaries
| ₹3.4 L/yr - ₹9 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services