推荐:数据科学课程和书籍清单以及培训讲座


一亩三分地论坛

 找回密码
 获取更多干活,快来注册

一亩三分地官方iOS手机应用下载
查看: 4866|回复: 0
收起左侧

[找工就业] 这算是被黑了吗?

[复制链接] |试试Instant~ |关注本帖
MTC 发表于 2014-12-3 13:46:16 | 显示全部楼层 |阅读模式

2011(1-3月)-[12]CS本科+fresh grad 无实习/全职 - 内推| 码农类其他@Google

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看,没有帐号?获取更多干活,快来注册

x
http://www.mitbbs.com/article_t/JobHunting/32840521.html

帮朋友转一下面经:

不是牛人,也没有遇到牛人那么难的面试。
4个多月前面的,整理过几个国人论坛半年内的G面经,周围也有不少人面,感觉还是比. visit 1point3acres.com for more.
百分之七八十的面经难,擦。
之前准备了一些最近常考的G家独有题,结果一个都没碰到。。。也没碰到过leetcode. 1point 3acres 璁哄潧
cc150原题。之前也看了不少杂书和advanced topic, 花了不少功夫准备,不过因为
其他事情中断了复习,最后突击了一下,这点还是希望大家引以为戒。
. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷
也许是大家都刷题bar高了,基本上全是算法而且要求写code且量不小,所有题都要推
optimal解法, 至少有三个面试官没有循循善诱,而是赤裸裸的不到最优解不让写
code外加鄙视。后来自己从最优解回头看所有题目,各种呵呵。

面经只包括主要的题目,面试前后扯淡神聊的都没记录在内。我的表现也自然有好有坏
, 面试官看上去都很nice,可惜题目摆在那里,我水平不够,想放水都难。我简历是越
来越挫,G家还这样招待我教我做人,水平确实有限就不高攀了,自己回去闭关反省了
,希望能帮到大家。.1point3acres缃
.鏈枃鍘熷垱鑷1point3acres璁哄潧
电面1:
expr ::= int | ‘(‘ op expr… ‘)’;
op ::= ‘+’ | ‘*’;

“( * 1 ( + 1 2 3 ) )” => 6
“( * ( + 1 1 ) 17 )” => 34
“7” => 7. 鍥磋鎴戜滑@1point 3 acres
( * ( + 1 1 ) 17 )
( * 17 ( + 1 1 ) ) 鏉ユ簮涓浜.涓夊垎鍦拌鍧.
operator: *+
oprands: (1 (1 2 3)

这题特别要求一个运算符可以对应任意个数。. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴

电面2:
Q1: Hash VS BST

Q2:
Suppose we are planning a company party.  The company organizational
structure is so that there is a single Owner who runs the place.
Everyone has one direct manager, but a manager may have any number of direct
reports.  Everyone must report to the owner, possibly indirectly.
Each employee has associated with him a non-negative “fun” value.  What we
want to do is invite the set of employees to make the party as fun as
possible.

Here is the only constraint:  If you invite an employee, you cannot invite
that employee’s direct manager.
   A
B     C
I J     D  E
   F G H

If we include A:  total fun value should Fun(A)=sum_{i=I,J,D,E}(Fun(i))
no A:      Fun(A)={Fun(B)+Fun(C)}
It’s legal to invite B and C
Or it’s legal to invite D, E, A, but you cannot invite D and C, or B and A.

后来复习时才注意到这是party at Hali-Bula,经典树形dp。面试时现推的树形dp,才 鏉ユ簮涓浜.涓夊垎鍦拌鍧.
拿到positive feedback。
. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
Q3:.鐣欏璁哄潧-涓浜-涓夊垎鍦
machine learning 101 若干题

Onsite:
1
a) counting sort 变种.1point3acres缃
b) 有若干个盒子,每个盒子有length和width,不考虑高度。只要尺寸fit,大盒子就
可以放小盒子,但是一层只能套一个,即便还有空余;但可以多层嵌套。.鏈枃鍘熷垱鑷1point3acres璁哄潧
求最小的面积放所有的盒子
比如 7*7  5*5, 4*6, 3*3
. From 1point 3acres bbs
答案是7*7+4*6

2什么时候 java memory leak:   吓唬了我很久,给了一个得是多年互联网架构从业经
验的答案。
Given a single list
A->B->C->E….->Z   A is Node type, B is Node Type
Node[] result = compute()….

Node {
  T value;
  Node next;
}.1point3acres缃

Find how many clusters in the array “result”   Node’s value could be
anything, not directly comparable, the LinkedList is the order.


the cluster means all the Node in the cluster is consecutive in the list.

for instance,
result:   D E F J G H C
cluster 1 c d e fg h
cluster 2 j


3
n x n parcels in city; matrix M contains the cost of each parcel; budget B
largest rectangular area in the city you can afford. 鏉ユ簮涓浜.涓夊垎鍦拌鍧.


4. 1point3acres.com/bbs
在social network中,如何推荐陌生人中和自己共同好友最多的人。不用想歪了,直接. more info on 1point3acres.com
要求用mapreduce解,完全是考这个经典算法的trick。

.鐣欏璁哄潧-涓浜-涓夊垎鍦
5  
a) you have a Queue array, Queue<Integer>[] queues,get the shortest length
queue,返回的是queue的index。pop is expensive.这个queue是动态更新的,肯定不能
直接size();  

b) find the queue with min sum queue, all with non-negative numbers.
. Waral 鍗氬鏈夋洿澶氭枃绔,
剰20分钟不到时,狗血follow-up:   implement a heap from scratch, all member
functions
写出来后,面试官居然不知道先fill了然后建heap是O(n),给他解释了半天。
让我瞬间想起了ak47关于代码量训练的经典文章。

. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴
**表示一道都不会。。。。FLG真是一个难度的吗?感觉G好难啊

本版积分规则

关闭

一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明

custom counter

GMT+8, 2017-7-26 18:44

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表