注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号
x
听说在地里发面经有奇效,本来想都面完定了offer再发,结果不小心面试都拖到了12月,想想马上圣诞了还不一定能都面完。。果断上来发面经攒人品,求之后的onsite给力。
Epic
------
OA
1,string mangler,toggle vowel
2,number in matrix,bigger than all others in this row,less than other in this column
3,well ordered number
4,colorful number
Phone Interview
Given a string, which contains ASI II code char, there is duplicate, not using external package, return string only have unique char in the same order.
On site:
吃+逛campus+两个面试:
1, project presentation
2, an article have links to different other articles, find shortest path between two articles (shortest path between two graph node) - BFS search, stop when level is too large
两周后给了offer,应该去面试都有offer把。。。
Two Sigma
------
OA两道原题:
Phone Screen - someone from infrastructure team
1, resume
2, Given an application that a class with big data, so creating an instance of this class is slow, how to solve it?
3, Someone implement hash table and it is slow, why?
4, use hash table to store data, but there is much more data than the machine's RAM, how to deal with that?
add one more machine, rehash and reconstruct the hash table
5, A application involves with multiple machines and it is slow, figure out why
can use matrix to measure the latency and throughput of each machine
6, process & thread
7, throughput & latency
On site: (悲剧地没只撑到中午饭 = =)
1, write a function to determine if a given long num is power of 4
Using a random number iterator to crate a iterator that only return multiply of 5
2, given a 2 dimension matrix, set all cubes to 1 or 0 according to the nu we left with only one person.
* Ensure the remained person is celebrity. (Why do we need this step? Maybe no one is celebrity)
FLG电面里面面的最好的一个,战斗民族毛子面试官,但是非常的nice,可惜Linkedin外州一定要2面才能onsite...老实等二面通知...
Facebook
-----------
phone
Resume projects (undergraduate project = =!)
two sum (did before) -> similar to sort color
boolean is_low(int a)
boolean is_med(int a)
boolean is_high(int a)
input: [-9 (low), 10(high), 4 (med), 7(low), 3(high), 50(med)]
output: [-9, 7, 4, 50, 10, 3]
follow up:
int rank(int a) -> 0 to k - 1
k ranks, then how to sort the array
1, TreeMap stores <rank, List<Integer>>
2, No extra space: similar to insertion sort
印度面试官,口音奇重,报collabedit网址至少报了四遍我才输对,每次他的问题我都得要求重复一遍,甚是无奈,但是看来人比较nice,全程并没感觉他不耐烦,而且题目不难所以答得不错,今天通知了onsite,求人品!
Summer在加州实习非常happy,所以基本是奔着找回加州。从9月份开始刷题,想着大boss们都放后面面试,希望之后G和L也能邀请onsite,各位找工的童鞋们加油!
|