The interview was scheduled after I passed the coding challenge.
The coding challenge was kinda simple, it was a grid, with each cell connected to its neighbors with some cost, you are allowed to move right and down, and you are required to calculate the minimum total cost for some employees (defined on the grid) to reach the bottom corner.
The grid size was a max of 1000*1000, so a simple Dijkstra could solve it.
The interview started about 20 minutes late due to technical problems with Skype connection, so the interviewer dived in quickly to the technical question.
So the technical question was as follows:
We want to create LRU Cache, a data structure that stores pairs
