# Insert Delete Getrandom O1 Duplicates Allowed: Walkthrough
Insert Delete Getrandom O1 Duplicates Allowed shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A RandomizedCollection stores duplicates. Map value -> set of indices in a packed array. insert appends and records the index; remove swaps the target index with the tail (updating the moved value's index set) then pops; getRandom picks array[rand() % n] so duplicates are naturally weighted.
## 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
Using a map to a single index (breaks duplicates) or removing by scanning the array.
## 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 the Linkjob AI app.