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 appeared for an interview in Aug 2016.
posted on 21 Aug 2016
I applied via Campus Placement
To test if every left child's value is less than the right child's value in a binary tree.
Traverse the binary tree using any traversal algorithm (e.g., in-order, pre-order, post-order)
Compare the value of each left child with its right child
If any left child's value is greater than or equal to its right child's value, return false
If all left child's values are less than their right child's values, return true
Cloning a linked list-like structure
Create a new node for each node in the original linked list
Set the value of the new node to the value of the corresponding node in the original linked list
Set the next pointer of the new node to the new node corresponding to the next node in the original linked list
Repeat the above steps until all nodes in the original linked list are cloned
To find the nth character in a stream of bytes, we need to read the stream byte by byte until we reach the nth position.
Start reading the stream byte by byte until you reach the nth position
Return the byte at the nth position
If the stream ends before reaching the nth position, return null or throw an exception
Rearrange a string to avoid consecutive same characters.
Iterate through the string and keep track of the previous character.
If the current character is the same as the previous, swap it with the next different character.
Repeat until no consecutive same characters are left.
The task is to find the next highest palindrome number given a number.
Convert the given number to a string
Check if the number is already a palindrome
If not, increment the number by 1 and check if it is a palindrome
Repeat the previous step until a palindrome is found
Canonicalizing a directory path involves simplifying and standardizing the path to remove any redundant or unnecessary elements.
Remove any consecutive slashes and replace them with a single slash
Remove any trailing slashes
Resolve any relative paths (e.g., '..' and '.')
Handle special cases like the root directory ('/')
Normalize the path by removing any unnecessary elements
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