System Engineer

You need to update the given array, meaning you have to do all the modifications in the same array without using any data structure. Return the length of the updated array which was the goal

1.Good thing in the question was that the array was sorted. All the duplicate elements will be adjacent to each other.
2. I checked if the current and the next element are equal.
3. If they are, I just skip the next element and continued the procedure as long as I encounter the duplicates.
4. If the elements are not duplicate, I just place the next (different) element next to the current element.

The interviewer was very happy with the solution

1. The inorder traversal of a bst returns the nodes in asc order. 
2. To find the k th smallest node, you just perform inorder traversal and store the output in an array. 
3. Then the k th largest node would be the (n-k) th smallest node, where n is the total nodes in the bst

I first explained this approach to the interviewer. He looked pretty convinced with the approach.
The time complexity of the above solution is O(n), which was the minimum requirement of the interviwer

Tip 1: If you've worked in an internship, then you can definitely answer these
Tip 2: Answer confidently always! Also, Don't second guess your answers
Tip 3: Replay these kind of management related past experiences in your head before the interview.