Google Intern 面经

一面：
(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

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

r elements, where popular is element which occurs > N/4 times
[size=14.6667px]

[size=14.6667px]发面经，攒人品，求过，求过，求过！


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