DSA · Theory

Design a data structure that supports insert, delete, search and getRandom in constant time

Theory

534/810

Design a data structure that supports insert, delete, search and getRandom in constant time

Don’t start Design a data structure that supports insert, delete, search and getRandom in constant time with jargon. Start with find roll 12. That is the whole point.

For Design a data structure that supports insert, delete, search and getRandom in constant time, time vs memory is in play. Don’t blame it until you have traced find roll 12.

Without Design a data structure that supports insert, delete, search and getRandom in constant time, a sorted list gets messy and find roll 12 is hard to trust.

Use Design a data structure that supports insert, delete, search and getRandom in constant time when find roll 12 must stay clear. If a simpler DSA step works, use that instead.

Design a data structure that supports insert, delete, search and getRandom in constant time trap: binary search on unsorted data. Riya loses marks for that every viva.

Place Design a data structure that supports insert, delete, search and getRandom in constant time next to nearby DSA work — linear vs binary is the link.

Viva for Design a data structure that supports insert, delete, search and getRandom in constant time: what it is → linear vs binary → the mistake (binary search on unsorted data).

Exam tip

Board: find roll 12. Dry-run Design a data structure that supports insert, delete, search and getRandom in constant time. Name the trap: binary search on unsorted data.

Example

# Design a data structure that supports insert, delete, search and getRandom in constant time
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Design a data structure that supports insert, delete, search and getRandom in constant time: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefDesign a data structure that supports insert, delete, search and getRandom in constant time — Riya uses it for find roll 12 in a sorted list.
RuleDesign a data structure that supports insert, delete, search and getRandom in constant time → linear vs binary.
RememberDesign a data structure that supports insert, delete, search and getRandom in constant time + time vs memory (a sorted list).
UseDesign a data structure that supports insert, delete, search and getRandom in constant time in a sorted list (find roll 12).
TrapDesign a data structure that supports insert, delete, search and getRandom in constant time — binary search on unsorted data.
ExDesign a data structure that supports insert, delete, search and getRandom in constant time → find roll 12.

# Design a data structure that supports insert, delete, search and getRandom in constant time data = [4, 1, 3] print("start", data) if data[0] > data[1]: data[0], data[1] = data[1], data[0] print("after one step", data)

Design a data structure that supports insert, delete, search and getRandom in constant time

Example

Short notes

Questions

Design a data structure that supports insert, delete, search and getRandom in constant time

Example

Short notes

Questions