高级农民
- 积分
- 1994
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2010-7-28
- 最后登录
- 1970-1-1
|
Onsite面经:
第一轮: First Common Ancestor of two nodes in a graph.
第二轮: Given two strings and a dictionary, only one character can be changed at a time, the changed string must also be found in the dictionary. Write a function to decide if it is possible that the 1st string can be changed to the 2nd string.
第三轮: Two sum, multiple pairs.
第四轮: System design. 跪的妥妥的. 10000 cameras, 100 hours of video each. 30 fps. Police need to input a plate number and find the path of a suspicious vehicle. (Estimate the size of the video, e.g., blueray disc is 2 hours and 20 GB. No need to scan all of the videos. Estimate the time that a vehicle can be seen between 2 traffic cameras, e.g., 0.3 miles and 30 miles per hour, then select 1 out of 100). Web client, load balancer, servers, db.
第五轮: 纯粹Behavior questions,要结合工作中实际的例子说明.
HR说大概一周给结果, 目测要跪.
|
|