Update:
I just got a call that the application is going to get forwarded to HC. I will update on their decision when I know. Hope for the best!
Round 1:
Code APIs for a Leaderboard type application.
It should handle:
updateScore()
findKthHighestScorer(k)
I started with basic implementations and of course it went to the point where I was told to make both operations efficient. I tried to design a binary tree apprach which would come to log(n) both operations. Unfortunately, I stumbled a lot in this first interview and could not finish my solution in time. I don't think this was a LC Hard question, more like a LC Medium but I think I was too nervous to think straight.
Round 2:
Modify a sorted array by operating f(x) on each element and return a sorted array where:
f(x) = ax^2 + bx + c
This was more of a math question IMO. We talked about parabollic curves and differentiating the curve etc. I could design and write the code to be O(n). I would imagine this is also an LC Medium. I could get through it in time for questions. Much better than round 1. Had a good chat with the interviewer afterwards
Round 3:
Googlyness
No way for me to know how this is judged. I think it was a good conversation. The interviewer seemed to relate to my answers. Beyond that, ¯_(ツ)_/¯
Round 4:
You are given a binary tree and an API shouldBeRemoved(node). You are supposed to go through the tree and remove every node that needs to removed and return a list of subtrees that will remain as a result of this operation. (Not stitch/balance it together into the original one tree)
Another LC Medium/Easy I think. I could do this standard traverals so O(n) in time with questions about testcases.
Round 5:
Event/Program Scheduler question. Started simple and eventually got to this:
You have n intervals in a day and scheduler can handle at most k events in each interval. You are given a valid scheduled event list and a new event that wants to be scheduled. Return if it can be scheduled or not.
Another LC Medium. I did it in O(n) time and O(n) space complexity. Had follow-ups about test cases.
My thoughts
Based on my gut feeling, I feel I totally tanked the first round. So I don't think I can be optimistic about the result. Writing down my expiernce before I hear back since I wanted to note the questions before I forget them. I'll update when I know the decision. Thanks for reading!