Hey guys I just finished my onsite yesterday and I got the following questions:
- you want to travel to different cities and each city has a certain amount of fun in it. So you are given a dictionary like
cities = {california: 10000, LA: 1000, ...}
you can only travel to cities that there is a flight. list of the flights is also given to you
california <> LA (there is a flight between LA and california)
.
.
.
find the max amount of fun I can have visiting extacly 4 cities only.
(solved this using DFS and backtracking and then memoization) the time complexity for mine was n! but the interviewer said they are looking for something better. like n^2 or n^3. Any suggestions here?
-
design a restaurant waiting list.
-
given a string like 1+(x)+5 come up with a datastructure that you can parse this expression there. This question is not about parsing the string. Someone else will do that for you to your datastructure. Your job is to design the datastructure and use that datastructure to solve the expression.
-
This was a ML design round. I was asked to design a youtube recommendation system.
I did really well in interview 3 and 4. I solved the non optimized version of 1 and solved the first part of 2. Do you think I have a chance in getting an offer?