@akashbabu/lfu-cache

LFU cache implementation with a complexity of `O(1)` for all transactions

non-replacement-random-item-sampler

An efficient random item sampler that ensures O(1) sampling complexity, and equal selection probability for all items across cycles. Each cycle ensures unique, non-repeating item selections, with each item sampled only once per cycle. Upon cycle completio