面试高频题(转)

http://www.mitbbs.com/article_t/JobHunting/32058385.html

coding:
– JOIN: nested join, hash join, sort-merge join
– Number: Fibonacci, prime,随机取文件某一行
– String: strstr, wordcount
– Tree: height, lca, balance tree
– Heap: 查找最大的k个数
– DP: 最大连续子串和
– array: find a key in rotated array, 去除重复字符
– linkedlist: 是否有环,插入结点,删除重复结点 
– 递归回溯:变化很多,这方面需要大量练习

知识性:
多线程,mutex/semaphore
java GC
C++ virtual, smart pointer
regex使用
数据库:知道btree, 索引
search engine: 倒排表,拉链,稀疏索引,空间向量模型,tf*idf, 
large scale data: hash, consistent hash, bloom filter, bitmap, 外排序,
partition
分布式:CAP理论,gossip,Paxos, GFS设计思想
network: socket, tcp3次握手, asyschnoized io, epoll, select, 惊群

设计型:
queue/stack实现
LRU
trie tree
设计游戏
四则运算求值

我感觉把我上面说的练熟,还是很大可能性遇到的,虽然不是很全面,但我觉得不应该
把太多时间花在难题上,充实知识体系,符合职位要求更重要。

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s