Meta USA E4/E5 Phone Screen -- Update Through to Onsite !

Hello,

Giving back to the community since reading the problems that people got in the interviews here has been super helpful for me. Just got done with my phone screen.

Was asked the following.

1. Range Sum of BST (No variant)
2. LRU Cache with some additional conditions and constraints.

Was able to solve the first question easily and was asked test conditions etc. Seemed like this was important and I went over how we can have negative values, low should be less than high, etc. etc.

For LRU cache, I had not solved it recently, but remembered the Double linked list solution as I had done it at some point in the past. Was not entirely sure what to store as the hashmap value so started off by saying we should store the node value and then remove the node for the get statement.

Interviewer pointed out that it would be O(N) to traverse linkedList to the node again. So then realized that we need to store pointer/reference to the node as hashmap value (Interviewer hinted and helped me get ther). Once I realized the solution, since we were running out of time interviewer just made me implement the get() method and the get_most_recent() method.

Fingers crossed to be put through to onsites. Will update once I know more.

Update: Through to Onsite!!