Practice Oracle Coding Question | Real Coding Interviews | Hack2hire

Product Pricing Blog Forum

Quick Summary

Track price updates at arbitrary timestamps while supporting efficient queries.
Return the current minimum, maximum, and most recent price after each update.
All operations must complete in O(log N) time or better.

What This Tests

Dynamic min/max tracking in mutable datasets
Hash table usage for O(1) direct access
Ordered data structures for efficient extremum retrieval
Balancing time complexity across multiple operation types

Common Patterns

HashingHeap / Priority Queue

Hint 1

Hint 2

What Interviewers May Ask Next

Report seen similar question in interview

python

Test Cases

Input

Output

Expected