Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

LeetCode: Design Log Storage System

Posted on August 5, 2019July 26, 2020 by braindenny

Design Log Storage System



Similar Problems:

  • CheatSheet: Leetcode For Code Interview
  • CheatSheet: Common Code Problems & Follow-ups
  • Tag: #oodesign, #array

You are given several logs that each log contains a unique id and timestamp. Timestamp is a string that has the following format: Year:Month:Day:Hour:Minute:Second, for example, 2017:01:01:23:59:59. All domains are zero-padded decimal numbers.

Design a log storage system to implement the following functions:

  • void Put(int id, string timestamp): Given a log’s unique id and timestamp, store the log in your storage system.
  • int[] Retrieve(String start, String end, String granularity): Return the id of logs whose timestamps are within the range from start to end. Start and end all have the same format as timestamp. However, granularity means the time level for consideration. For example, start = “2017:01:01:23:59:59”, end = “2017:01:02:23:59:59”, granularity = “Day”, it means that we need to find the logs within the range from Jan. 1st 2017 to Jan. 2nd 2017.

Example 1:

put(1, "2017:01:01:23:59:59");
put(2, "2017:01:01:22:59:59");
put(3, "2016:01:01:00:00:00");
retrieve("2016:01:01:01:01:01","2017:01:01:23:00:00","Year"); // return [1,2,3], because you need to return all logs within 2016 and 2017.
retrieve("2016:01:01:01:01:01","2017:01:01:23:00:00","Hour"); // return [1,2], because you need to return all logs start from 2016:01:01:01 to 2017:01:01:23, where log 3 is left outside the range.

Note:

  1. There will be at most 300 operations of Put or Retrieve.
  2. Year ranges from [2000,2017]. Hour ranges from [00,23].
  3. Output for Retrieve has no order required.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


  • Solution:
// https://code.dennyzhang.com/design-log-storage-system
// Basic Ideas:
//
//  Loop, and compare by string
//
// Complexity: Time O(n), Space O(n)
type LogSystem struct {
    ids []int
    timestamps []string
}

func Constructor() LogSystem {
    return LogSystem{ids: []int{}, timestamps: []string{}}
}

func (this *LogSystem) Put(id int, timestamp string)  {
    this.ids = append(this.ids, id)
    this.timestamps = append(this.timestamps, timestamp)
}

func (this *LogSystem) Retrieve(s string, e string, gra string) []int {
    m := map[string]int{"Year":4, "Month":7, 
                          "Day":10, "Hour":13, 
                          "Minute":16, "Second":19}
    pos := m[gra]
    res := []int{}
    for i:=0; i<len(this.ids); i++ {
        timestamp := this.timestamps[i][0:pos]
        if timestamp>=s[0:pos] && timestamp<=e[0:pos] {
            res = append(res, this.ids[i])
        }
    }
    return res
}

/**
 * Your LogSystem object will be instantiated and called as such:
 * obj := Constructor();
 * obj.Put(id,timestamp);
 * param_2 := obj.Retrieve(s,e,gra);
 */
linkedin
github
slack

Post Views: 0
Posted in MediumTagged #array, oodesign

Post navigation

LeetCode: Average Selling Price
LeetCode: Meeting Scheduler

Leave a Reply Cancel reply

Your email address will not be published.

Tags

#array #backtracking #bfs #binarytree #bitmanipulation #blog #classic #codetemplate #combination #dfs #dynamicprogramming #game #graph #greedy #heap #inspiring #interval #linkedlist #manydetails #math #palindrome #recursive #slidingwindow #stack #string #subarray #trie #twopointer #twosum binarysearch editdistance hashmap intervaldp knapsack monotone oodesign presum rectangle redo review rotatelist series sql treetraversal unionfind

Recent Posts

  • a
  • a
  • a
  • a
  • a

Recent Comments

    Archives

    Categories

    • Amusing
    • Basic
    • Easy
    • Hard
    • Life
    • Medium
    • Resource
    • Review
    • Series
    • Uncategorized
    Proudly powered by WordPress | Theme: petals by Aurorum.