Implement lru cache 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 interview process typically starts with a phone interview to discuss your experience and basic qualifications. Next, you'll receive a home test with 3 coding questions. After that, there will be a first technical interview focused on problem-solving and coding challenges. Finally, you'll have a second interview with the team lead to discuss your projects, teamwork, and overall fit with the team and company culture.