Envié una solicitud electrónica. El proceso duró 2 días. Acudí a una entrevista en Nothing (Bengaluru) en sept 2024
Entrevista
I didn't remember exactly but it is similar like LRU least recently used So start with brute then go up to optimised. Be confident They want to hire you so don't feel nervous just give your best
Preguntas de entrevista [1]
Pregunta 1
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.
It was a great experience; they focused on basics and HR questions, mainly asking string problems, DSA concepts, and SQL queries, testing fundamentals, clarity, problem-solving skills, and overall confidence level.
