Insert Delete GetRandom O(1): which companies ask it and how to practise

Insert Delete GetRandom O(1) is a Medium problem that 37 companies are reported to ask. This page shows who, how often and how recently, what the question tests, and how to practise it out loud with an interviewer who asks follow-ups. We link to the original problem statement instead of copying it.

Which companies ask Insert Delete GetRandom O(1)?

Public company lists attribute Insert Delete GetRandom O(1), a Medium problem, to 37 companies. The most frequent askers are Affirm, Pocket Gems and SoFi. 12 reports are from the last six months. It mainly tests array, hash table and math. Use this as a practice guide, not a promise.

Practise this kind of question aloud

Who asks Insert Delete GetRandom O(1)

37 companies appear in the public lists for this question. By how often each is reported: Affirm (very often), Pocket Gems (very often), SoFi (very often), Axon (very often), Okta (very often), Peloton (very often), Yelp (very often), X (very often), Quora (very often) and Grammarly (very often), and 27 more. 12 of them were reported in the last six months, SoFi, Axon and Okta among them.

These are candidate reports collected in public lists, not statements from the companies. They are a good guide to what to practise and a poor guide to what you will be asked: interviewers change questions, and the same company asks different questions by team and level. Last reviewed 25 October 2026.

What Insert Delete GetRandom O(1) tests

It is rated Medium, which is the level most interviews are built around: expect to talk through two approaches, pick one, code it cleanly, and answer a cross-question on an edge case or a change to the constraints.

Arrays are the default container, so the interviewer is watching how you index, how you avoid a second full pass, and whether you notice when sorting or a hash map would remove a nested loop.

A hash table trades memory for speed: remembering what you have seen turns a repeated search into a lookup. Interviewers want you to say that trade-off and the cost of collisions or a bad key.

Math questions reward finding the formula or the invariant before writing code, and watching for overflow, negatives and zero.

How to practise it

Do not just solve it silently. In a real interview you explain the approach before you code, write while you talk, and defend the solution to follow-ups. Set a timer, say the brute force and its cost first, then improve it, and finish by stating the time and space complexity and two edge cases you tested.

On giveinterview you can take this kind of question as a spoken interview: the AI interviewer opens with the problem, watches you code, asks cross-questions and ends with a scorecard. Your first 3 single-question interviews are free for life, every interview report is free, and a new account also gets 6 welcome credits.

Read the original statement here: https://leetcode.com/problems/insert-delete-getrandom-o1/ (opens the publisher's page). The statement is theirs; we do not reproduce it.

Questions to practise next

If you can solve Insert Delete GetRandom O(1), try these next, chosen because they share its main topic and many of the same companies: Two Sum (Easy), Merge Intervals (Medium), Best Time to Buy and Sell Stock (Easy), Number of Islands (Medium), Group Anagrams (Medium) and Trapping Rain Water (Hard). Each has its own page in the questions list.

Frequently asked questions

Is Insert Delete GetRandom O(1) asked at Amazon?

Amazon appears in the public lists for Insert Delete GetRandom O(1), reported often. Treat that as a reason to practise it, not a promise you will be asked it.

How hard is Insert Delete GetRandom O(1)?

Do I need to memorise the solution?

No. Interviewers listen for how you reason: the approach, the trade-offs, the edge cases and the complexity. Practise explaining it, not reciting it.

Sources and review date

Last reviewed 25 October 2026 Statements about other products come from their own public pages: