Available question text
Design a data structure to store log entries by id with timestamps and support put(id, timestamp) and retrieve(start, end, granularity) returning all ids whose timestamps fall within the inclusive range when compared at the given granularity (Year/Month/Day/Hour/Minute/Second). The challenge is to parse/truncate timestamps according to granularity and perform efficient range queries over stored entries.
Related questions
Continue with questions that share topics or the same question type.
- Build a Progressive Cloud Storage System
Coding · File & Media Storage · Low-Level Design (OOP)
- Crawler Log Folder
Coding
- Delivering Boxes from Storage to Ports
Coding
- Design a Graph Storage and Cloning System
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
CrowdStrike
Leetcode 635. Design Log Storage System
Reported May 8, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourcePinterest
Leetcode 635. Design Log Storage System
Reported Mar 5, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source