Insert Delete GetRandom O(1) - Duplicates allowed: coding question

Available question text

Design a data structure for a multiset that supports insert(val) (adding even duplicate occurrences), remove(val) (removing a single occurrence), and getRandom() (returning an element with probability proportional to its count), all in average O(1) time. The core challenge is handling duplicates and enabling O(1) arbitrary-removal while preserving uniform random access.

Continue with questions that share topics or the same question type.

Insert Delete GetRandom O(1)
Coding · Array · Design · Hash Table
Shuffle an Array
Coding · Array · Design · Math
Count Number of Nice Subarrays
Coding · Array · Hash Table · Math
Design Excel Sum Formula
Coding · Array · Design · Graph Theory

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

CrowdStrike
Leetcode 381. Insert Delete GetRandom O(1) - Duplicates allowed
Reported Sep 3, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 3 records

LinkedIn
Insert Delete GetRandom O(1) - Duplicates allowed
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 78.7. This is not an interview probability.
View source
LinkedIn
Insert Delete GetRandom O(1) - Duplicates allowed
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 78.3. This is not an interview probability.
View source

Available question text

Insert Delete GetRandom O(1) - Duplicates allowed

Available question text

Related questions

Insert Delete GetRandom O(1) - Duplicates allowed

Available question text

Related questions