Search
⌘K

Leetcode 635. Design Log Storage System

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.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.