Filter interviews by
I applied via Company Website and was interviewed in Aug 2022. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Jun 2022. There were 2 interview rounds.
I applied via Approached by Company and was interviewed before Feb 2022. There were 2 interview rounds.
The application follows a microservices architecture with a front-end layer, API layer, and multiple backend services.
The front-end layer is built using React and communicates with the API layer through RESTful APIs.
The API layer is built using Node.js and Express.js and acts as a gateway for all the backend services.
The backend services are built using different technologies like Java, Python, and Go and communicate w...
What people are saying about HARMAN
I appeared for an interview 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 4 interviews
2 Interview rounds
based on 53 reviews
Rating in categories
Senior Software Engineer
1.7k
salaries
| ₹8.1 L/yr - ₹30.4 L/yr |
Technical Lead
1.5k
salaries
| ₹10.5 L/yr - ₹37 L/yr |
Software Engineer
1.3k
salaries
| ₹3.8 L/yr - ₹14.4 L/yr |
Senior Product Engineer
985
salaries
| ₹6 L/yr - ₹25.2 L/yr |
Senior Engineer
960
salaries
| ₹7.5 L/yr - ₹29.9 L/yr |
Bose
Jbl
Sennheiser
Sony