May 2009 - May 2017 论坛八周年-你的足迹,我的骄傲



查看: 2318|回复: 6

Google 11/16 Intern

[复制链接] |试试Instant~ |关注本帖
哭泣的北燕 发表于 2015-11-17 10:45:42 | 显示全部楼层 |阅读模式

2016(7-9月) 码农类 博士 实习@Google - 内推 - 其他 |Other其他


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

I didn't install Chinese on my laptop..  so I just type English.

First of ALL, I want to thank very much for the support from my family, girlfriend, and my boss.
I have just finished it this afternoon, and I think I did bad on it.... sigh...

First Round,  I think the interviewer is ABC, female
1. Inorder traversal of Binary Tree,
Follow-up,  suppose the inorder traversal of two binary trees is equal, does this mean that the two binary trees are same? I said no...
Follow-up,  what is the potential problem of your DFS-version of Inorder traversal?   I said stack overflow...
Follow-up, can you check whether given two binaries have the same inorder traversal?
Uh, I was stuck, then like the iterative Inorder version of a single binary tree, I just used two stacks to store the intermediate nodes, and then check whether two corresponding nodes have the same element.
However, the interviewer thought my solution might be wrong, then she gave me an example to walk through, but she didn't find any incorrectness...  BUT she still thought my solution might not work.... visit for more.
I did so bad at this round, and I just answered the above one question...  sigh...  .1point3acres缃

Second round, I think the interviewer is an American, male, super nice!!
1.  Given a string of words, find the number of misspelled words, suppose you are givien a function to check whether a word is valid or not.
At first, I thought he might want to test me on the Trie implementation... Then he directly told me not to care about this...  delimeter is space(s), no more.. Waral 鍗氬鏈夋洿澶氭枃绔,
so the idea is quite simple, pick each word and then test it using the given function....  However, still not bug-free....  shame on me....1point3acres缃
then I offered several corner cases and he was a little bit satisfied...
2.  Tell me sth about your research.... for the rest 25 mins...
-google 1point3acres
Qiu RP!!!
. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴




sxh53 发表于 2015-11-17 10:57:35 | 显示全部楼层
So is second round solution like this??

for (String s : list) {.鏈枃鍘熷垱鑷1point3acres璁哄潧
   if (check(s)) {
回复 支持 反对

使用道具 举报

 楼主| 哭泣的北燕 发表于 2015-11-17 11:34:43 | 显示全部楼层
sxh53 发表于 2015-11-17 10:57
So is second round solution like this??
. From 1point 3acres bbs
for (String s : list) {
Nope, you are given a string of words like this "string    of   words    ", there might be extra spaces.  so first you need to pick each word from this string, quite similar to reverse words in a string, from leetcode, but its easier than that of leetcode..
回复 支持 反对

使用道具 举报

xiaozhuxiaozhu 发表于 2015-12-11 07:28:53 | 显示全部楼层
lz 人品爆发啊!!!这题都不难。
回复 支持 反对

使用道具 举报

 楼主| 哭泣的北燕 发表于 2015-12-12 00:18:30 | 显示全部楼层
xiaozhuxiaozhu 发表于 2015-12-11 07:28
lz 人品爆发啊!!!这题都不难。

HaHa, thanks!  no pinyin on desktop
回复 支持 反对

使用道具 举报

houqingniao 发表于 2015-12-12 05:18:44 | 显示全部楼层
Great!offer is on the way.
回复 支持 反对

使用道具 举报

download1992 发表于 2016-2-25 20:49:23 | 显示全部楼层
楼主你好 首先祝贺你的intern
看到你拿到了去iub的offer也从了 所以想咨询下 iub的cs phd就业以及intern机会如何呢 感觉iub的地理位置好像比较一般 所以比较担心这一点~
回复 支持 反对

使用道具 举报



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

手机版|小黑屋|一亩三分地论坛声明 ( 沪ICP备11015994号 )

custom counter

GMT+8, 2017-5-28 15:07

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

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