哪些内容是软件工程师技术面试必须复习的知识？
Linked lists, binary trees, tries, stacks, queues, dynamic arrays, hash tables/maps
Breadth first search, depth first search, binary search, merge sort, quick sort, tree insert/find/etc
Recursion
Big-O time on all of the above
How to identify choices that will result in big performance gains/losses (i.e. don’t worry about minor gains/losses), especially if that choice would mean the difference between a feasible solution and an infeasible solution
OOP design principles 面向对象程序设计原理