Randomized Set, LRU Cache, Linked List Arithmetic & Majority Element
Filed under Goldman Sachs
The question
Design a data structure supporting insert, delete, search, and getRandom in O(1) time. Implement an LRU Cache. Add 1 to a number represented as a linked list. Find all elements appearing more than n/k times in an array.
No write-up yet. Related questions below have one.
Related Goldman Sachs questions
Collected from public candidate posts and coding forums. Updated Nov 2026.