拉高出货?# Stock
c*n
1 楼
本来已经接了Amazon的offer,但是还是想来FB看看。觉得campus 好大。
面的很一般,System Design 很差,一个Ninja也很一般。希望渺茫,求大家bless.
1, Jedi, behavioral + projects + one coding (phone number permutation)
2, Ninja, a) k closest points to a given point(quick select).
b) dot product of sparse matrices.
3, pirate, Design Messager. 必挂无疑了。
4, Ninja, a) longest increasing contiguous sequence in an array (
leetcode)
b)longest increasing sequence in an array(sequence does
not need to be contiguous). For instance, 1,2,4,3,2,7,8,9 .. return 1,2,3,7,
8,9. Use DP, 但是让我cut leaves 的时候我一直不得要点,耽误了10分钟。
至此,我所有的面筋都发给版上了。这轮找工作也到一段落了,不管最后去哪,我都不
会后悔。感谢版上的同学发的面筋,希望我可以把火种传递下去。
这次希望渺茫,但求Bless.
面的很一般,System Design 很差,一个Ninja也很一般。希望渺茫,求大家bless.
1, Jedi, behavioral + projects + one coding (phone number permutation)
2, Ninja, a) k closest points to a given point(quick select).
b) dot product of sparse matrices.
3, pirate, Design Messager. 必挂无疑了。
4, Ninja, a) longest increasing contiguous sequence in an array (
leetcode)
b)longest increasing sequence in an array(sequence does
not need to be contiguous). For instance, 1,2,4,3,2,7,8,9 .. return 1,2,3,7,
8,9. Use DP, 但是让我cut leaves 的时候我一直不得要点,耽误了10分钟。
至此,我所有的面筋都发给版上了。这轮找工作也到一段落了,不管最后去哪,我都不
会后悔。感谢版上的同学发的面筋,希望我可以把火种传递下去。
这次希望渺茫,但求Bless.