Insert Delete GetRandom O(1): coding question

Available question text

Design a data structure supporting insert(val), remove(val), and getRandom() — which returns a uniformly random existing element — with each operation in average O(1) time. The key challenge is to combine O(1) existence checks/updates with O(1) random access so every current element has equal selection probability.

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

Insert Delete GetRandom O(1) - Duplicates allowed
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 · 8 records

Amazon
Leetcode 380. Insert Delete GetRandom O(1)
Reported Mar 5, 2025 · 3 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source
Bloomberg
Leetcode 380. Insert Delete GetRandom O(1)
Reported Aug 1, 2026 · 3 source reports
SENIOR
Source snapshot: Nov 12, 2026
View source
Docusign
Leetcode 380. Insert Delete GetRandom O(1)
Reported Apr 16, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source
Google
Leetcode 380. Insert Delete GetRandom O(1)
Reported Aug 18, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026

Available question text

Insert Delete GetRandom O(1)

Available question text

Related questions

Insert Delete GetRandom O(1)

Available question text

Related questions