In person: Design an LRU cache in Go.
Sigiloso
HashiCorp has one, go get it :-) Can probably use either a slice on top of a map or a bi-directional linked list, not sure if list is going to be as performant as slice if number of LRU entries is small. Benchmark it yo :-)