Filter interviews by
I applied via Campus Placement and was interviewed before Jan 2022. There were 4 interview rounds.
posted on 14 Jul 2017
posted on 12 Jul 2016
I applied via Campus Placement
The question is about finding the minimum steps to reach from a source string to a destination string using three operations.
BFS and DFS are graph traversal techniques that can be used to solve this problem.
BFS is typically used when finding the shortest path or exploring all possible paths in a graph.
DFS is useful when searching for a specific path or exploring deeply into a graph.
In this case, BFS can be used to find...
I applied via Company Website and was interviewed before Mar 2020. There were 3 interview rounds.
I applied via Referral and was interviewed before Nov 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Sep 2019. There were 3 interview rounds.
I applied via Job Portal and was interviewed before Feb 2020. There was 1 interview round.
posted on 24 Mar 2023
I applied via Campus Placement and was interviewed in Sep 2022. There were 4 interview rounds.
Basics of electronics and two coding questions
I applied via Campus Placement
Variant of Binary Search
Implement a binary search with a twist, such as searching for a range of values instead of a single value
Modify the binary search algorithm to handle duplicates in the array
Consider implementing a binary search for a rotated sorted array
based on 1 interview
Interview experience
based on 7 reviews
Rating in categories
Software Design Engineer
16
salaries
| ₹9 L/yr - ₹25.5 L/yr |
Software Engineer
4
salaries
| ₹7.7 L/yr - ₹14 L/yr |
Engineering Manager
4
salaries
| ₹27 L/yr - ₹39 L/yr |
Software Engineering Manager
4
salaries
| ₹31.5 L/yr - ₹44 L/yr |
Senior UX Designer
4
salaries
| ₹15 L/yr - ₹27.5 L/yr |
Keysight Technologies
Agilent Technologies
Tektronix
Anritsu