Filter interviews by
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
I applied via Referral and was interviewed in Feb 2022. There was 1 interview round.
I applied via LinkedIn and was interviewed before Oct 2023. There was 1 interview round.
I have strong skills in manual and automated testing, test planning, test case design, defect tracking, and regression testing.
Proficient in using testing tools such as Selenium, JIRA, and TestRail
Experience in creating test plans, test cases, and test scripts
Skilled in identifying and documenting software defects
Knowledge of regression testing and test automation frameworks
Ability to work effectively in a team environ
My expected salary is based on my experience, skills, and the market rate for QA Engineers.
Consider my years of experience in QA testing
Take into account my relevant certifications or qualifications
Research the average salary range for QA Engineers in this location
I applied via Recruitment Consulltant and was interviewed in Oct 2023. There were 3 interview rounds.
Test automation architecture involves designing frameworks, tools, and processes to automate testing. Test optimization techniques aim to improve efficiency and effectiveness of testing.
Design a modular framework to promote reusability of test scripts
Implement data-driven testing to cover various test scenarios
Utilize continuous integration tools for automated test execution
Leverage parallel testing to reduce overall t...
Write the combination of binary and linear search program using java or c#
Logical reasoning question
I was interviewed in Dec 2016.
I applied via Campus Placement
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Jan 2016. There were 5 interview rounds.
To find a loop in a directed graph, use Floyd's cycle-finding algorithm. To find the last element in a binary tree, traverse the tree and return the rightmost leaf node.
For finding a loop in a directed graph, use Floyd's cycle-finding algorithm which uses two pointers moving at different speeds.
To find the last element in a binary tree, traverse the tree recursively or iteratively and return the rightmost leaf node.
The question is about finding the last number in a circular queue that has the highest number of digits.
Implement a circular queue data structure
Iterate through the circular queue to find the last number with the highest number of digits
Compare the number of digits of each number in the circular queue
Keep track of the last number with the highest number of digits
based on 4 reviews
Rating in categories
Senior Software Engineer
1.7k
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
1.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
1.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
929
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Engineer
904
salaries
| ₹0 L/yr - ₹0 L/yr |
Bose
Jbl
Sennheiser
Sony