刚才找到了 谢谢crownrose, 原帖 http://www.mitbbs.com/article_t/JobHunting/32652879.html
1: single linked list circle detection (命中)
2: sum up array of numbers in window size (命中)
3: matrix path,只能往左或往右,要求使得path上的number的最小值最大
4: linked list的倒数第K个节点
5: Give student result structure:
struct Result{
int studentID;
string data;
int testScore;
}
给一个result的vector,返回一个map (命中)