Available question text
Maintain dynamic collections to (1) return the cheapest up-to-5 shops that have an unrented copy of a given movie and (2) report the cheapest up-to-5 currently rented movies, while supporting rent/drop operations that move items between those collections. The challenge is to handle frequent updates and top-k queries efficiently using ordered data structures keyed by price and the specified tie-breakers (shop, movie).
Related questions
Continue with questions that share topics or the same question type.
- Most Frequent IDs
Coding · Array · Hash Table · Heap (Priority Queue)
- Avoid Flood in The City
Coding · Array · Binary Search · Greedy
- Design Excel Sum Formula
Coding · Array · Design · Graph Theory
- Design HashMap
Coding · Array · Design · Hash Function
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 · 1 record
Amazon
Leetcode 1912. Design Movie Rental System
Reported Sep 17, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Okta
Design Movie Rental System
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source