Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in Dec 2024. There were 2 interview rounds.
Everything was fine. The Hr was nice and the manager also.
I have 5 years of experience working as a Test Engineer in the software industry.
Developed and executed test cases to ensure software quality
Performed regression testing to identify bugs and issues
Collaborated with developers to resolve defects and improve product performance
I have 5 years of experience working as a Test Engineer in the software industry.
Developed and executed test cases to ensure software quality
Performed regression testing to identify bugs and issues
Collaborated with developers to resolve issues and improve product quality
I applied via Naukri.com and was interviewed in Sep 2021. There was 1 interview round.
Top trending discussions
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
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There was 1 interview round.
Check if left child is less than right child in a binary tree
Traverse the tree recursively and compare left and right child values
Use a stack to traverse the tree iteratively and compare left and right child values
Return true if all left children are less than right children, else false
Use built-in string method to check substring presence for faster execution.
Use 'indexOf' method to check if substring is present in the main string.
If the method returns -1, the substring is not present.
If the method returns a non-negative integer, the substring is present.
posted on 21 Aug 2016
I applied via Campus Placement
based on 2 interviews
Interview experience
based on 16 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
931
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Engineer
904
salaries
| ₹0 L/yr - ₹0 L/yr |
Bose
Jbl
Sennheiser
Sony