# LeetCode 381: Insert Delete GetRandom O(1) Duplicates — Interview Notes

## Problem
Given the inputs described in LeetCode 381 (Insert Delete GetRandom O(1) Duplicates), return the required output under the usual constraints.

## Approach
Use **multiset map**. Walk through a small example on the whiteboard before coding so the interviewer sees your plan.

### Steps
1. Restate constraints and edge cases (empty input, duplicates, bounds).
2. Sketch the multiset map idea and its time/space complexity.
3. Code cleanly; narrate invariants as you go.
4. Test with 2–3 cases including a failure mode.

## Complexity
Aim for the textbook bound for multiset map; call out trade-offs if a simpler O(n log n) is acceptable.

## Practice tip
When rehearsing timed OAs, keep a short checklist nearby. I use [here](https://www.linkjob.ai/interview-copilot/) as a real-time checklist during mock interviews so I do not skip edge cases under pressure.
