AlphaSense Senior Software Engineer 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

The code inserts a given string at the specified position in a compact data structure that stores strings sequentially.

• To insert the string at the ith place, we need to shift all the strings after the ith position by the length of the new string.

• We can use a loop to iterate through the data structure and find the ith position.

• After finding the ith position, we can calculate the new length of the data structure and allo...read more

Constructing parse tree for ((a+b)*c)/d using data structures.

• Use stack data structure to keep track of operators and operands.

• Start with the innermost parentheses and work outwards.

• Create a node for each operator and operand and link them together.

• The root node will be the final result of the expression.

• Example: ((a+b)*c)/d can be represented as / -> * -> + -> a, b, c, d.

Merge 'n' identical linked lists from 'n' salespersons to handle insertions, deletions, and updates.

• Iterate through each linked list and merge them into a single linked list

• Handle insertions, deletions, and updates by traversing the merged list and making necessary changes

• Repeat the process for the next day by resetting the merged list