给出一些基本需要的条件，能节省你和大家的时间。

既然楼主申的都是master的话，想必不会有什么巨大的热情来献身于科研事业什么的，而是想毕业后尽快拿下年薪十万刀+的工作吧？如果是是这样子的话，A会比B好找无数倍。

快到30秒的时候它自己说了cinema? 但是我记得这货没那么好看呀…

啥时候加州来一场？！

如果app行的话，News Digest

YAHOO CONFIDENTIAL & PROPRIETARY - DO NOT FORWARD

I want to let you know that we have decided to close our office in Beijing. This is an extremely difficult decision but one that we made given our need to gain efficiency, focus and to remix our talent. The Beijing center was created six years ago and has served Yahoo extremely well with notable efforts in search, advertising, personalization, mobile engineering and cloud technologies.

If you’ve ever traveled to the center you would have felt the excitement, drive and sense of action among the employees. With this change, we will be moving critical projects back to the U.S. and in many cases reuniting these projects with their related U.S. teams. This will ultimately allow us to operate with greater speed - where engineers working on these efforts can sit side-by-side. We will be making offers to many of the talented engineers working on these projects to come to the U.S. to work on these key efforts.

While I’ve articulated the business needs causing these changes, there is a clear impact on the people at this site. We will handle these changes with compassion and with thanks to all the folks who have been striving to make Yahoo great.

Finally, I want to give a special shout out to Chen Zhang and his leadership team. Chen created the site from scratch and has been its passionate champion and leader. He and his leadership team have done a wonderful job recruiting, retaining and inspiring their staff to build great products and technologies for Yahoo.

I want to thank our team in Beijing for their contributions throughout the years and hope you will all join me in supporting them as we go through this transition.

Pull request被accept以后能加入译者列表么

@yahoo-inc.com 邮箱支持两步验证

用技术追求一些，用golang

@phoeagon 排序就至少O(nlogn)，比这样子慢

@caizixian 利用不同编程语言的hash set类型（不同语言有不同的叫法，C++是#include <unordered_set>，Java和Python的麻烦自己找一下）的look up time是O(1)的特性，跑一次就行了，举个例子吧(2, 7, 11, 15)找22：

定义一个hashset就暂时叫a吧，一开始a是空的；先跑到2，找一下a里面有没有22-2=20（时间O(1)）, 没有，把2存进a；然后7，找一下a里面有没有22-7=15，没有，把7存进去；跑到11，找一下a里面有没有22-11=11，没有把11存进去；跑到15，找一下a里面有没有22-15=7，有，所以两个数字就是7和15

two sum 不是没有用O(n)做出来的面试直接刷掉吗？

$6.99要不要这么贵……还是0.01的

强推D5300

@ivanlw 为什么前面出现那串@Livid

欢迎使用 @yahoo.com 邮箱，至少不接受censorship

楼主台湾人？

难道就没有强迫症来吐槽大小写和空格嘛？