一亩三分地论坛

 找回密码
 获取更多干货,去instant注册!

扫码关注一亩三分地公众号
查看: 574|回复: 0
收起左侧

[找工就业] Google Intern 面经

[复制链接] |试试Instant~ |关注本帖
invinsibility 发表于 2016-2-20 04:17:23 | 显示全部楼层 |阅读模式

2016(1-3月)-[]EE博士+<3个月短暂实习/全职 - 内推| 码农类实习@Googlefresh grad应届毕业生

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

您需要 登录 才可以下载或查看,没有帐号?获取更多干货,去instant注册!

x
一面:
(1) [size=14.6667px]In an array of integers, given a window size k, print out the maximum integer value in each window inside that array, starting at the front of the array.
[size=14.6667px]我用maxheap 做的, time complexity O(nlog(k)). n is the length of the array.
[size=14.6667px]

[size=14.6667px](2) Give a directed acyclic graph (DAG) of size n, and we convert it to a tree (do not have to be a binary tree). What is the maximum number of nodes for this tree?
[size=14.6667px]没有coding, 只要求推公式。 答案是
[size=14.6667px]n = 1, max = 1
[size=14.6667px]n = 2, max = 2
[size=14.6667px]n = 3, max = 4
[size=14.6667px]n = 4, max = 8
[size=14.6667px]n, max = 2 ^ (n - 1)
[size=14.6667px]

[size=14.6667px]二面:
[size=14.6667px](1) Given an array of coins A = [1 2 5 10], and a target num N. Find out the minimum number of coins that add up to N
[size=14.6667px]

[size=14.6667px](2) [size=14.6667px]Sorted array A of size N, with duplicates allowed, [size=14.6667px]Find one of the most popular elements, where popular is element which occurs > N/4 times
[size=14.6667px]

[size=14.6667px]发面经,攒人品,求过,求过,求过!


补充内容 (2016-2-20 04:18):.1point3acres缃
[size=14.6667px]是乱码

本版积分规则

请点这里访问我们的新网站:一亩三分地Instant.

Instant搜索更强大,不扣积分,内容组织的更好更整洁!目前仍在beta版本,努力完善中!反馈请点这里

关闭

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

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

custom counter

GMT+8, 2016-12-8 01:51

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

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