Find Global and Rolling Top-K URLs Under a Memory Limit
Company: Oracle
Role: Software Engineer
Category: System Design
Difficulty: medium
Interview Round: Onsite
Overview: Design memory-bounded global and trailing-24-hour top-K URL analytics over a massive access stream. The solution compares exact disk-backed counts with sketches, uses partitioned time buckets and deterministic merges, and addresses late data, replay, hot keys, checkpoints, and result freshness.
Read the full Oracle Software Engineer interview experience this question came from