380. Insert Delete GetRandom O(1)

Implement the RandomizedSet class:

  • bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise.
  • bool remove(int val) Removes an item val from the set if present. Returns true if the item was present, false otherwise.
  • int getRandom() Returns a random element from the current set of elements (it's guaranteed that at least one element exists when this method is called). Each element must have the same probability of being returned.

Follow up: Could you implement the functions of the class with each function works in average O(1) time?


Example 1:

["RandomizedSet", "insert", "remove", "insert", "getRandom", "remove", "insert", "getRandom"]
[[], [1], [2], [2], [], [1], [2], []]
[null, true, false, true, 2, true, false, 2]

RandomizedSet randomizedSet = new RandomizedSet();
randomizedSet.insert(1); // Inserts 1 to the set. Returns true as 1 was inserted successfully.
randomizedSet.remove(2); // Returns false as 2 does not exist in the set.
randomizedSet.insert(2); // Inserts 2 to the set, returns true. Set now contains [1,2].
randomizedSet.getRandom(); // getRandom() should return either 1 or 2 randomly.
randomizedSet.remove(1); // Removes 1 from the set, returns true. Set now contains [2].
randomizedSet.insert(2); // 2 was already in the set, so return false.
randomizedSet.getRandom(); // Since 2 is the only number in the set, getRandom() will always return 2.



  • -231 <= val <= 231 - 1
  • At most 105 calls will be made to insert, remove, and getRandom.
  • There will be at least one element in the data structure when getRandom is called.

Rust Solution

extern crate rand;
use rand::prelude::*;
use std::collections::HashMap;

struct RandomizedSet {
    rng: ThreadRng,
    indexes: HashMap<i32, usize>,
    values: Vec<i32>,

impl RandomizedSet {
    fn new() -> Self {
        RandomizedSet {
            rng: rand::thread_rng(),
            indexes: HashMap::new(),
            values: vec![],
    fn insert(&mut self, val: i32) -> bool {
        if self.indexes.get(&val).is_some() {
        } else {
            self.indexes.insert(val, self.values.len());
    fn remove(&mut self, val: i32) -> bool {
        if let Some(index) = self.indexes.remove(&val) {
            let last_index = self.values.len() - 1;
            let last_value = self.values[last_index];
            if index != last_index {
                self.values.swap(index, last_index);
                let old_index = self.indexes.get_mut(&last_value).unwrap();
                *old_index = index;
        } else {

    fn get_random(&mut self) -> i32 {
        let index = self.rng.gen_range(0, self.values.len()) as usize;

fn test() {
    let mut obj = RandomizedSet::new();
    assert_eq!(obj.insert(1), true);
    assert_eq!(obj.remove(2), false);
    assert_eq!(obj.insert(2), true);
    assert_eq!(obj.remove(1), true);
    assert_eq!(obj.insert(2), false);

Having problems with this solution? Click here to submit an issue on github.