# Randomized Set: Study Guide

Randomized Set shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Insert/delete/getRandom in O(1) with no duplicates: packed array plus value->index map. Delete swaps with the last element, updates that element's index, and pops. getRandom is array[rand() % n].

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(1) expected.

## Common mistake

Deleting with pop on an unordered map alone (no array, so getRandom would need extra work) or forgetting to update the swapped index.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at interview copilot app.