摘要：
pa 2018-1-14 谷歌家面的是product analyst，一开始说是general hire，但好像面的时候直接见到了hardware team的一个年轻hiring manager，所以应该就是直接面那个组了。一开始一轮电面，是个youtube的老印面的，主要是问简历，让挑一个觉得最满 阅读全文
posted @ 2018-11-20 07:37
ffeng0312
阅读(1339)
评论(0)
推荐(0)
摘要：
2016-10-181. Coding: very simple, like tree pre-order traversal 2. search a number in ordered array without knowing the array length 3. leetcode 53 4. 阅读全文
posted @ 2018-11-10 05:25
ffeng0312
阅读(257)
评论(0)
推荐(0)
摘要：
2015-3-11 phone under hr,coding is not required 1. Describe a project that you are post proud of.2. Which statistical method do you think is most over 阅读全文
posted @ 2018-11-10 05:23
ffeng0312
阅读(2036)
评论(0)
推荐(0)
摘要：
onsite5轮+Discussion with HR 由于很人很多，我已经忘记了每个interview的国籍啥的，全是男的，一个印度人，一个亲切的中国人，三个白人。大部分都是behavior question 和project experience， 我没有被直接问到任何tech问题但是在proj 阅读全文
posted @ 2018-11-10 05:21
ffeng0312
阅读(2044)
评论(0)
推荐(0)
摘要：
https://www.researchgate.net/post/How_can_I_study_the_past_spending_behaviour_of_a_customer_in_a_banking_perspective_and_predict_the_next_purchase_cat 阅读全文
posted @ 2018-11-10 05:12
ffeng0312
阅读(843)
评论(0)
推荐(0)
摘要：
select d.name Department, e.name Employee, e.salary Salary from Employee einner join Department d on e.DepartmentId = d.idwhere (e.DepartmentId,e.sala 阅读全文
posted @ 2018-10-28 10:13
ffeng0312
阅读(168)
评论(0)
推荐(0)
摘要：
select s1.score Score, count(*) Rank from Scores s1,(select distinct score from scores) s2where s1.score <= s2.scoregroup by id,s1.scoreorder by count 阅读全文
posted @ 2018-10-24 20:19
ffeng0312
阅读(141)
评论(0)
推荐(0)
摘要：
CREATE FUNCTION getNthHighestSalary(N INT) RETURNS INTBEGINdeclare M int;set M = N-1;RETURN ( # Write your MySQL query statement below. select distinc 阅读全文
posted @ 2018-10-24 20:02
ffeng0312
阅读(161)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/second-highest-salary/solution/two row has the same salary, should return null, so we use distinct salarySELECT IFNULL( 阅读全文
posted @ 2018-10-23 20:11
ffeng0312
阅读(95)
评论(0)
推荐(0)
摘要：
https://leetcode.com/articles/biggest-single-number/ select max(num) from (SELECT num FROM numbergroup by numhaving count(*)=1) n 阅读全文
posted @ 2018-10-23 19:58
ffeng0312
阅读(153)
评论(0)
推荐(0)
浙公网安备 33010602011771号