Quick Overview

This question evaluates a candidate's ability to design and implement an efficient data structure supporting average O(1) add, remove, and uniform random selection, testing concepts such as hashing, random sampling, and space–time trade-offs within the Coding & Algorithms domain.

Implement a Constant-Time Random Pool

Company: Uber

Role: Frontend Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Quick Answer: This question evaluates a candidate's ability to design and implement an efficient data structure supporting average O(1) add, remove, and uniform random selection, testing concepts such as hashing, random sampling, and space–time trade-offs within the Coding & Algorithms domain.

Loading…