The process consisted of an algorithm coding test.

The first interview had 3 questions, which included two medium level and one hard level, and they also asked for some project information.

The second interview asked 3 questions, consisting of 2 medium and one hard.

There were no more other questions.

e.g.

leetcode LRU

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.

Implement the LRUCache class:

LRUCache(int capacity) Initialize the LRU cache with positive size capacity.

int get(int key) Return the value of the key if the key exists, otherwise return -1.

void put(int key, int value) Update the value of the key if the key exists. Otherwise, add the key-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recently used key.

The functions get and put must each run in O(1) average time complexity.