Weekly Recap 20181022–28

Data Structure in work: using Trie

It’s been a long time since I explicitly use a more advanced data structure in work. Not being said that it’s not used but actually we don’t use them from scratch. One of the recent task gave me that chance to review my knowledge about tree and its variation.

I started from the two articles below and then implement my own insertion and traversal algorithm for it.

Counting the number of words in a Trie - GeeksforGeeks

Data structures, trees and Ruby.

Reading note on scoring in OKR (Chinese)

為什麼「0.7」就是好？初談OKR的評分方式／Danny Lin

OKR is used recently in our work. I learned that some company use the score 0.7 to be the criteria of acceptance. However, it’s still vague that how this works. According to this post, the score is based on type of task, culture of company and how we define our standard.