Assistant System Engineer

Design and implement a data structure for Least Recently Used (LRU) cache to support the following operations:

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

2. put(key, value), Insert the value in the cache if the key is not already present or update the value of the given key if the key is already present. When the cache reaches its capacity, it should invalidate the least recently used item before inserting the new item.

You will be given ‘Q’ queries. Each query will belong to one of these two types:

Type 0: for get(key) operation.
Type 1: for put(key, value) operation.

Note :

1. The cache is initialized with a capacity (the maximum number of unique keys it can hold at a time).

2. Access to an item or key is defined as a get or a put operation on the key. The least recently used key is the one with the oldest access time.

1. Introduction and all the subjects that I have learned during my B.Tech journey.
2. My favourite coding language and subject.
3. What is the difference between overloading and overriding
4. Questions related to my projects.
5. DBMS-related simple queries.
6.What is normalization

This round was Managerial Round
1. A situation in which I have to lead a group
2. A situation in which I failed to meet the deadline on time.
3. My hobbies are apart from technical.
4. How do I manage work and life?

Are you willing to relocate?
Are you comfortable with shifts?
My percentage in 10th, 12th, and B.Tech degree.