AND, OR, XOR bit count('1') bit shift signed integer : positive >> n = 0 , negative >> n = -1 swap xor
a = a ^ b
b = a ^ b
a = a ^ b
- B = Bottleneck
- U = Unnecessary work
- D = duplicated work
- BFS breadth-first search, push to queue and operate when dequeu
- DFS Depth-first search, push to stack and operate when pop
- Greedy
- backtracking
- sorting ,
- Crypto
- Dynamic Programming Kadane's Algorithm
- Backtracking
- Combine elements , bf , recur , goroutine of recursive
- Is valid parenthese
- parenthese combine
data structure
- Linklist , single , double , circle ,
- [Tree]
- btree
- multiple tree
- red-black tree
- full binary tree
- complete binary tree
- [Stack]
- [Queue]
- double-ended queue
- priority queue
- [heap]
- [map]
- [set]
- [hash]
skills:
- resource management
- operation function
- A* search
- short url
- right-sided view b-tree
- Iru algo
- promise
- parser
- diff , lonest common pattern
- http://www.csie.ntnu.edu.tw/~u91029/index.html
- LZ77 and LZ78
- DEFLATE
- OS scheduling algo.
- Scheduling algorithms , include disk , network , and processor
- Scheduling disciplines
- Huffman Code
- base64
- 八皇后問題
- 貪婪算法
- 啟發式算法
- 动态编程
- 原地算法』(in-place algorithm)
- 『外部排序』(external sorting)。
- 最近邻居算法』
- 数据库中还使用了其它启发式算法,像『模拟退火算法(Simulated Annealing)』、『交互式改良算法(Iterative Improvement)』、『双阶段优化算法(Two-Phase Optimization)』
- join algo
- hash join
- merge join
- buffer algo
- 2Q(类LRU-K算法)
- CLOCK(类LRU-K算法)
- MRU(最新使用的算法,用LRU同样的逻辑但不同的规则)
- LRFU(Least Recently and Frequently Used,最近最少使用最近最不常用)
- LRU代表最近最少使用(Least Recently Used) 一個buffer , 類似推文至底
- LRU-K
- 推测预读法(比如:如果查询执行器想要数据1、3、5,它不久后很可能会要 7、9、11),或者顺序预读法(这时候缓存管理器只是读取一批数据后简单地从磁盘加载下一批连续数据)。
- 缓冲/缓存命中率
- encoding algo.
- char range
- could encode and decode?
- security
- sha1
- base64
- md5