google面试题汇总(多方搜集)

来源:互联网 发布:csol发生网络问题 编辑:程序博客网 时间:2024/05/16 01:45

2005年10月底,Google在美国《麻省技术评论》、《LinuxJournal》、《Mensa》、《今日物理》等几本专业杂志上,刊登了一份“Google实验室能力倾向测试”。试卷开头,蛊惑地写着“试试看!把答案寄回Google,你有希望去Google总部参观,并成为我们其中一员”。

1. Solve this cryptic equation, realizing of course that values for M and E could be interchanged. No leading zeros are allowed.
WWWDOT – GOOGLE = DOTCOM

2. Write a haiku describing possible methods for predicting search traffic seasonality.

3.
1
1 1
2 1
1 2 1 1
1 1 1 2 2 1

What is the next line?

4. You are in a maze of twisty little passages, all alike. There is a dusty laptop here with a weak wireless connection. There are dull, lifeless gnomes strolling about. What dost thou do?
A) Wander aimlessly, bumping into
obstacles until you are eaten by a grue.
B) Use the laptop as a digging device to
tunnel to the next level.
C) Play MPoRPG until the battery dies
along with your hopes.
D) Use the computer to map the nodes
of the maze and discover an exit path.
E) Email your resume to Google, tell the
lead gnome you quit and find yourself
in whole different world.

5. What’s broken with Unix? How would you fix it?

6. On your first day at Google, you discover that your cubicle mate wrote the textbook you used as a primary resource in your first year of graduate school. Do you:
A) Fawn obsequiously and ask if you
can have an autograph.
B) Sit perfectly still and use only soft
keystrokes to avoid disturbing her
concentration.
C) Leave her daily offerings of granola
and English toffee from the food bins.
D) Quote your favorite formula from the
textbook and explain how it’s now
your mantra.
E) Show her how example 17b could
have been solved with 34 fewer lines
of code.

 

7. Which of the following expresses Google□ over-arching philosophy?
A) "I’m feeling lucky"
B) "Don’t be evil"
C) "Oh, I already fixed that"
D) "You should never be more than
50 feet from food"
E) All of the above

8. How many different ways can you color an icosahedron with one of three colors on each face?
What colors would you choose?

9. This space left intentionally blank. Please fill it with something that improves upon emptiness.

10.On an infinite, two-dimensional, rectangular lattice of 1-ohm resistors, what is the resistance between two nodes that are a knight’s move away?

11.It’s 2 PM on a sunny Sunday afternoon in the Bay Area. You’re minutes from the Pacific Ocean, redwood forest hiking trails and world class cultural attractions. What do you do?

12.In your opinion, what is the most beautiful math equation ever derived?

13. Which of the following is NOT an actual interest group formed by Google employees?
A. Women’s basketball
B. Buffy fans
C. Cricketeers
D. Nobel winners
E. Wine club

14.What will be the next great improvement in search technology?

15.What is the optimal size of a project team, above which additional members do not contribute productivity equivalent to the percentage increase in the staff size?
A) 1
B) 3
C) 5
D) 11
E) 24

16.Given a triangle ABC, how would you use only a compass and straight edge to find a point P such that triangles ABP, ACP and BCP have equal perimeters? (Assume that ABC is constructed so that a solution does exist.)

17.Consider a function which, for a given whole number n, returns the number of ones required when writing out all numbers between 0 and n. For example, f(13)=6. Notice that f(1)=1. What is the next largest n such that f(n)=n?

18.What’s the coolest hack you’ve ever written?

19.’Tis known in refined company, that choosing K things out of N can be done in ways as many as choosing N minus K from N: I pick K, you the remaining.

 

Find though a cooler bijection, where you show a knack uncanny, of making your choices contain all K of mine. Oh, for pedantry: let K be no more than half N.

20.What number comes next in the sequence: 10, 9, 60, 90, 70, 66,?
A)96
B) 1000000000000000000000000000000000
0000000000000000000000000000000000
000000000000000000000000000000000
C) Either of the above
D) None of the above

21.In 29 words or fewer, describe what you would strive to accomplish if you worked at Google Labs.

 

来自csdn

 有一幢100层高的大厦,给你两个完全相同的玻璃围棋子。假设从某一层开始,丢下玻璃棋子就会摔碎。那么怎么利用手中的两颗棋子,用一种什么样的最优策略,知道这个临界的层高呢?

有n个人,其中超过半数是好人,剩下的是坏人,好人只说真话,坏人可能说真话也可能说假话,这n个人互相都知道对方是好人还是坏人

 

现在要你从这n个人当中找出一个好人来,只能通过以下方式:
每次挑出两个人,让这两个人互相说出对方的身份,你根具两个人的话进行判断。

问通过何种方法才能最快的找出一个好人来(要考虑最坏的情况) ?

 

T( 0 ) = 1 ; T(1)=1;T(2)=2;T(n)=T(n-1)+T(n-2)+T(n-3);
用最优方式求T(n) ;

 

int T(int n)
{
}

可以用最熟悉的语言写,不考虑溢出情况

 

1.一辆校车可以塞进多少个高尔夫球?

 

2.你被缩小到一个硬币那么大,质量也成比例缩小,密度不变。然后把你放到一个空的玻璃搅拌器中,搅拌器将在60秒内启动。你会做什么?

3.如果让你把西雅图所有的窗户都擦了,你要多少钱?

4.怎么知道一台机器的堆栈在内存中是增加还是减少?

5.用3句话向你的小侄子解释什么是数据库。

6.一个钟表的针(时/分)一天会重叠多少次?

7.你必须从A点到B点去。你不知道你是否能够到达那里。你会做什么?

8.你有一个装满衬衣的壁橱,找到某件衬衣很困难。你会怎样安排这些衬衣以便找起来方便些?

9.一个村子有100对夫妇,每个男的都骗他老婆。当一个男人有不忠行为时,除去他老婆的所有女人都会立即获知这件事,他自己的老婆不知道。这个村子又有个法律不允许通奸,任何一个知道自己男人不忠的女人都必须在当天杀死她的男人。这些女人永远也不会违反这条法律。一天,村子的女王访问该村,并且宣布,至少有一个丈夫不忠。会发生什么事?

10.一个国家人们只想要男孩,每个家庭都会一直要孩子,只到他们得到一个男孩。如果生的是女孩,他们就会再生一个。如果生了男孩,就不再生了。那么,这个国家里男女比例如何?

11.在一条高速公路上,在30分钟内看到一辆汽车的可能性是0.95,那么在10分钟内看到一辆车的概率是多少(假设过车的概率是恒定的)?

12.时钟上时间是3:15,那么时针和分针之间的夹角是多少度?

13.4位露营者要在晚上通过一个索桥,但他们只有一个手电,而手电也只能支持17分钟;这个桥的绳子已经很破,同时只能支持2人通过,而没有手电的话是非常危险的。这4人的过桥速度不同,第一位1分钟,第二位2分钟,第三人要5分钟,最慢的要10分钟。他们怎样才能安全过桥?

14.你和朋友去参加一个晚会,带你和朋友在内,共有10人。你的朋友和你打赌,你找到一位和你同一天生日的,你就得到1美元,他找到的任何一个和你生日不同的人,他得到2美元。你会打这个赌吗?

15.全世界有多少个钢琴调音师?

16.你有8个同样大小的球,其中7个一样重,有一个略重一点。怎样用一架天平只称两次就找出这个重一点的球?

17.有5个海盗,级别是5到1,5最高,1最低。现在有100个金币,级别最高的(5)海盗有权提出怎么来分这些金币。但是,剩下的人可以对他的提议进行投票,如果同意他的人少于1半,他就会被扔到海里去。他怎样才能让自己得到的金币最多?(提示:最后一个海盗得到了98个金币。)

解:

不知道美国校车多大,也不知道高尔夫球多大。据说这类题目看重过程,而不是准确的数字。

趴在底部的空隙中;抱住中间的轴;往上爬;都这样了,随便吧。

就跟校车问题一样,估计吧,但是又不知道当地最低工资,如果要的比最低工资还少,岂不是让Google犯罪吗?还得加上办绿卡的钱。

不懂。

数据库就是。。。

22?

走呗。

按中图法分类。

等到第100天,来个男人大屠杀。这村子真惨。

还是1:1?不采用药物也不杀女婴的话。

(1-x)**3=0.05

7.5。

1和2过,2分钟;1返回,3分钟;5和10过,13分钟;2返回,15分钟,1和2过,17分钟。

当然不打了。

没概念,乱说。

3个一组来称即可。

也是以前看过,否则还想不到。给1号和2号每人一个金币即可。但这依赖于每个人都足够理性,1和2才能明白这是他们最好的结果。

 

原创粉丝点击