#744Medium#6 in Cisco's list· asked at 20 companies
Insert Delete GetRandom O(1)
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: ["RandomizedSet","insert","remove","insert","getRandom","remove","insert","getRandom"] [[],[1],[2],[2],[],[1],[2],[]] Output: [null,true,false,true,2,true,false,2]
Constraints
- •
-2^31 <= val <= 2^31 - 1 - •
At most
2 * 10^5calls will be made. - •
There will be at least one element when
getRandomis called.