TomoLink
CompaniesMetaData Structures & AlgorithmsInsert Delete GetRandom O(1) - Duplicates allowed
DSA
HardArray

Insert Delete GetRandom O(1) - Duplicates allowed

arrayhash tablemath

Problem Statement

RandomizedCollection is a data structure that contains a collection of numbers, possibly duplicates (i.e., a multiset). It should support inserting and removing specific elements and also reporting a random element.

Implement the RandomizedCollection class:

RandomizedCollection() Initializes the empty RandomizedCollection object.

bool insert(int val) Inserts an item val into the multiset, even if the item is already present. Returns true if the item is not present, false otherwise.

bool remove(int val) Removes an item val from the multiset if present. Returns true if the item is present, false otherwise. Note that if val has multiple occurrences in the multiset, we only remove one of them.

int getRandom() Returns a random element from the current multiset of elements. The probability of each element being returned is linearly related to the number of the same values the multiset contains.

You must implement the functions of the class such that each function works on average O(1) time complexity.

Note: The test cases are generated such that getRandom will only be called if there is at least one item in the RandomizedCollection .

Examples

Example 1
Input:
Output:

Constraints

-2 ^31 <= val <= 2 ^31 - 1
At most 2 * 10 ^5 calls in total will be made to insert , remove , and getRandom .
There will be at least one element in the data structure when getRandom is called.
😤
Hard
Difficulty
Topic Info
ModuleDSA
CategoryArray
Sub-topicHash Table
Tags
arrayhash tablemathdesignrandomized
Navigation
Insert Delete GetRandom O(1) - Duplicates allowed [Hard] | Meta Dsa | TomoLink