Saturday, June 13, 2015

To do


  1. topological ordering: BFS
  2. trie
  3. compiler stuff, context-free grammar, string parsing, state-machine
  4. web crawler
  5. KMP
  6. Rolling Hash
  7. 树,打印所有距离leef node为k的节点,或者打印所有距离为某一个节点为k的所有节点
  8. combination, complexity
  9. find peak elem II, http://courses.csail.mit.edu/6.006/spring11/lectures/lec02.pdfhttp://courses.csail.mit.edu/6.006/spring11/rec/rec02.pdf
  10. 约瑟夫环
  11. game theory
  12. 可改变下思路, 有时候pass by reference + void 可变为直接返回一个有效值(如 int)
  13. Binomial theorem
  14. bloom filter简单解释:http://billmill.org/bloomfilter-tutorial/
  15. 平面上最远的2个点, http://noalgo.info/799.html
  16. Best Time to Buy and Sell Stock IV
  17. 在stream里面,找top k个最常出现的词  http://stackoverflow.com/questions/3260653/algorithm-to-find-top-10-search-terms?newreg=e0d277c9365f499fbf54de491a7b1d1f

No comments:

Post a Comment