Domanda di colloquio di Ring

A version of the below leetcode hard problem. https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/

Risposta di colloquio

Anonimo

5 mag 2019

Implemented with forced probability with a similar technique to LRU cache