Just finished my meta phone screen yesterday : Was asked 1 easy and 1 midium question , Joined the interview 1 minute late and my laptop webcam decided to throw a tantrum , which immediately threw me off and anxiety kicked in making my mind to go blank . A good lesson for everybody to keep everything ready an hour before , turned out my laptop comes iwth a shutter key at the base of the laptop which i should have been able to to flick it off , took me 5 minutes to figure out post interview but at that moment i had to go grab my other laptop and set everything up while the interviewer was waiting for me .
Questions :
- Max top k Elements in an array . [ Very easy 10 lines problem ] Completely messed up time and space complexity , kept getting mixed up n with k and k with n . Interviewer understood i was nervous and after 25 minutes of finally getting the right solution with Min heap.
- Implement the following interfaces for a class
int get(string key) -> get the value for a key
void Put(string key, itn val) -> inserts the key and corresponding value with the key.
void Delete(string key) -> Deletes an existing key
int Last() -> return the most recently accessed non deleted key.
all of these should run in O(n) time.
I initally suggested to use a stack to keep track of the most recent accessed non deleted element , but that would push the T.C for Delte() operation to O(n). I then thought of using a list instead of stack and managing the list with an index int to point to the most recent position on the stack, but i ran out of time and the interviewer was not very helpful. Did not agree to disagree to anything much and ended the interview.
Hope this help anybody who is looking to crack meta , Meta phone screen is compartively easy just practice most leetcode medium / easy , and one design / coding type of question. and also know thy space and time complexeties. Happy leeting!
