经典面经

捐过leetcode, 找好房子，上一亩三分地贡献下自己找工作的一些经验。我的CS背景较弱，走的是刷题流。
背景: USC EE转CS, GPA 3.5+，两个startup实习，主要投的android和front-end职位
时间表：今年寒假开始刷题，到5月底最后拿到Facebook offer。前后面了10家左右的公司（略去小公司），顺序是Oracle(Offer), Amazon(Rej), Twitter(Rej), Google(Rej), Facebook(Offer), Yahoo(Offer)。每次面试前会把各公司glassdoor及Careercup刷一下，平时则是刷Leetcode和CTCI打基础。到5月底的时候Leetcode总共刷了3遍，CTCI也刷了3遍。面试来源：Oracle是学校的career fair, Amazon,Yahoo和Google是网投，Twitter,Facebook是网上找的内推。在此再度感谢"面试做题-美国CS交流群(167615205)"，提供了新鲜的面经和给力的内推。.

签了NDA, 就不分开说了, 把见过的一些题目罗列如下
Binary Tree Level Order Traversal
Reverse Words In String
Generate Random N using Random 1: Given a random generator of 0/1, generate random number in range 0-N
Get a random node in a tree, O(lgn)
Common Ancestor in a BT/BST.
Insert a node into an ordered circular list
SortColors
WordSearch
2Sum/3Sum
Generate valid words given character set
Triangle
Sort numbers with the requirements: a1>a2<a3>a4...
BestTimeToBuyAndSellStocks.
Anagram
Find Equilibrium Index of a matrix
Prefix/Infix notation evaluation
Longest Increasing Subarray/ Subsequence
Reverse a stack using recursion
Find min and max in array with least number of comparisons
Implement readline() using read4k()
Regular Expression Matching
(Weighted) Interval Scheduling
Find inorder predecessor of a given node in BST
Find median of streaming data
K largest
Quick Select/ Sort
Generate Fibonacci series
Edit distance
Graph clone
Battleship oo design
TicTacTeo oo degisn
Parking lot oo design
Saolei oo design
FizzBuzz
Combination/Permutation
Find shortest path between two nodes on graph
ValidBST
RangeMinimumQuery (Deque, segment tree)
面试是力气活，也是运气活，感谢一起刷题的小伙伴们。
祝大家早日拿到心仪的offer。


楼主给的介绍很详细！请问一下面试的时候除了会问数据结构算法，还一般会问些什么方面的问题？该怎么准备？


每个公司套路不一样，所以还是建议每个公司都要刷glassdoor和面经分别准备。



---------------------------------------------
Bloomberg L.P. Software Engineer Interview Question

"using a log generated by a multiprocessor machine, which contains start and end time of each process, find the longest slot of time in which the machine wasn't idle. the log is sorted by the process's start time."