OXYLOANS Interview Questions and Answers

Count occurrences of given element in a sorted array.

• Use binary search to find the first and last occurrence of the element.

• Subtract the indices to get the count of occurrences.

• Handle edge cases like element not present in array.

Given a binary tree, find the path with the largest sum of node values.

• Use depth-first search to traverse the tree and keep track of the current path sum.

• At each node, compare the current path sum with the maximum path sum seen so far.

• Return the path with the maximum sum.

• If the tree is empty, return an empty path.