'''

design a data structure that:
has a fixed size
supports the following API:
add(key, value) -> adds a key/value to the structure
pop(key) -> returns a stored value and removes it
pop() -> return next item in queued and removes it


considerations:
overwrite oldest keys if the structure fills up




notes:
1. how would you prevent a user from visiting a website with microsoft intune, on their device?
2.


questions:
what is the difference between a process and a thread?
what are some of the considerations that come up when building a distributed system?

didn't really know


how do you maintain extremely high throughput in a servER?
load balancer


'''
7428f54545010224768cc293e7dcda6384424348
<mask token>

'''

design a data structure that:
has a fixed size
supports the following API:
add(key, value) -> adds a key/value to the structure
pop(key) -> returns a stored value and removes it
pop() -> return next item in queued and removes it


considerations:
overwrite oldest keys if the structure fills up




notes:
1. how would you prevent a user from visiting a website with microsoft intune, on their device?
2.


questions:
what is the difference between a process and a thread?
what are some of the considerations that come up when building a distributed system?

didn't really know


how do you maintain extremely high throughput in a servER?
load balancer


'''