HARMAN Associate Software Developer Interview Questions and Answers

Find A-B of two sorted arrays A and B in O(m+n) time complexity.

• Create two pointers, one for each array, and compare the elements at those pointers.

• If the element in A is smaller, add it to the result array and move the A pointer forward.

• If the element in B is smaller, move the B pointer forward.

• Repeat until one of the pointers reaches the end of its array.

• Add any remaining elements in A to the result array.

• Time comple...read more

The routine should output the elements of the inorder traversal of a binary tree one by one in each call.

• Implement an inorder traversal algorithm recursively

• Use a global variable or pass a reference to keep track of the current element

• Call the routine repeatedly to get the next element in each call

Program to find minimum semesters required to complete courses with prerequisites

• Create a graph with courses as nodes and prerequisites as edges

• Use topological sorting to find the order of courses to be taken

• Calculate the minimum number of semesters based on the order obtained

• Handle cases where there are cycles in the graph

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

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.