google面试题.doc

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. Whats 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 its 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) Im feeling lucky B) Dont 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 knights move away? 11.Its 2 PM on a sunny Sunday afternoon in the Bay Area. Youre 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. Womens 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.Whats the coolest hack youve 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,? 部分试题中文翻译: 1试着证明WWWDOT-GOOGLE=DOTCOM 2用俳句（一种日本短诗，每句有一个与季节有关的词）来描述各种模型，借此预测网络搜索流量的季节性变化。 4你落入一个迷宫，回旋不断的走廊。手里有一台堆满灰尘的手提电脑，可以无线上网。周围，许多无生命的侏儒徘徊走动。这种情况下，你会如何做？ A)无目的地徘徊，不停走入死胡同，然后被迷宫里面的妖怪吃掉。 B)用手提电脑当铲子，打穿地板直接进入游戏下一关。 C)玩网络游戏魔法奇兵，直到电池耗尽。 D)利用计算机，找到迷宫的节点，发现准确出路。 E)把你的简历寄给Google，告诉迷宫里领头的妖怪，你要退出游戏。然后，发现你回到了现实世界。 5Unix有什么问题？你会如何补救它？ 6你在Google工作的第一天，发现你同寝室的室友，曾写过一本书。你研究生一年级时，这本书是你最重要的参考资料。你会： A)求他帮你签个名。 B)不改坐姿，却放轻打字声音，尽量避免影响他。 C)把你每天吃的麦片和咖啡，留给他吃。 D)引用他那本书中间，你最喜欢的程式，告诉他这则方程给了你多少启发。 E)让他看看，你可以用不到34句语句，完成一个高难度程序。 7以下哪个最好地表达了Google的企业文化？ A)“我感觉挺幸运” B)“别干坏事” C)“哦，我已经完成了任务” D)“你身边10米以内，必定能找到食物” E)以上皆是 10用1欧姆的电阻，组成无限大的放行点阵，问“象棋跳马步”（“日”字对角点）两点之间的电阻是多少？ 11下午2点，旧金山著名的湾区。你可以选择去阳光海岸、国家公园的红杉林里徒步旅行，或者参观城市 里的文化景观。你会怎么做？ 14搜索技术的下一个革命性突破是什么？ 15一个技术研究小组的最优化人员组合是几个人？一旦超过这个数字，每增加一个研究员，平均生产力就会相应下降： A)1 B)3 C)5 D)11 E)24 16三角形ABC，用圆规和尺，找出点P，保证三角形ABP、ACP和BCP周长相等。 18你写过最酷的程序是什么？ 20找出此数列的下一个:10,9,60,90,70,66? A)96 B)10的100次方 C)A或者B D)以上皆否 用少于29个词，描述你能带给Google实验室的贡献。微软面试题，有答案了，但不知道为什么会是这样!对一批编号为1-100全部开关朝上（开）的灯进行以下操作： 凡是1的倍数反方向拨一次开关；2的倍数反方向又拨一次开关；3的倍数反方向又拨一次开关。 问：最后为关熄状态的灯的编号。 答案： 1，4，9，16，25，36，47，64，81，100关 int count; for (int i = 1; i 101; i+) count = 0; for (int j = 1; j 0) label1.Text = label1.Text + i.ToString() + ; 最后结果是1，4，9，16，25，36，49，64，81，100关为什么是一个数的平方呢 肯定是奇数个数的因子，这是肯定的，但这不应该得出答案的最佳思路 = 不是一个数的平方！ 肯定是因子（包括假因子1和自身）个数为奇数的！ 如果以程序来写的话： BOOL bSwitchOff100; memset(bSwitchOff, 0, 100 * sizeof(BOOL); int j = 0; for(int i = 1; i = 100; +i) for(j = i; j = 100; +j) if( j % i ) continue; bSwitchOffj = TRUE; 最后bSwitchOff 中为TRUE的则为关。我的分析是这样的： 题目主要是得出奇数或者偶数个因子。 现假设c%a=0,c/a=b，那么a就是c的因子， 同样可以得到：c/b=a，c%b=0，因此b也是c的因子 即：c=a*b，这样可以看到c的因子是成对（a，b）出现的。 但这样就能得出c的因子个数就是偶数吗？ 答案显然不是，如果存在a=b，那么c就有奇数个因子。 例如： 100= 1*100 2*50 4*25 5*20 10*10 我们可以看到，最后的10*10，即存在a=b，因此100就有奇数个因子。 再如： 80= 1*80 2*40 4*20 5*16 8*10 我们同样可以看到，不存在a=b，因此80就有偶数个因子。 所以，得出结论：如果存在c=a*a，a、c都为正整数，那么c就有奇数个因子。 题目的结果就明了了，呵呵google的一道JAVA面试题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? 翻译过来大体是这样： 有一个整数n,写一个函数f(n),返回0到n之间出现的1的个数。比如f(13)=6,现在f(1)=1,问下一个最大的f(n)=n的n是什么？答案一：int getCountOfNumber(int number) int count=0; int length=( + number).length(); for(int i=0;i=length;i+) int num=number%10; number=(number-num)/10; if(num*num=1) count+; return count; 计算到：199981 用了203不过只计算到上边的数值就没多大意思，看看这个：这个是4000000000以内的结果！：f(0) = 0 f(1) = 1.f(199981) = 199981.f(199982) = 199982.f(199983) = 199983.f(199984) = 199984.f(199985) = 199985.f(199986) = 199986 f(199987) = 199987 f(199988) = 199988 f(199989) = 199989 f(199990) = 199990 f(200000) = 200000 f(200001) = 200001.f(1599981) = 1599981.f(1599982) = 1599982.f(1599983) = 1599983.f(1599984) = 1599984.f(1599985) = 1599985.f(1599986) = 1599986 f(1599987) = 1599987 f(1599988) = 1599988 f(1599989) = 1599989 f(1599990) = 1599990 f(2600000) = 2600000 f(2600001) = 2600001.f(13199998) = 13199998 f(35000000) = 35000000 f(35000001) = 35000001.f(35199981) = 35199981.f(35199982) = 35199982.f(35199983) = 35199983.f(35199984) = 35199984.f(35199985) = 35199985.f(35199986) = 35199986 f(35199987) = 35199987 f(35199988) = 35199988 f(35199989) = 35199989 f(35199990) = 35199990 f(35200000) = 35200000 f(35200001) = 35200001.f(117463825) = 117463825.f(500000000) = 500000000 f(500000001) = 500000001.f(500199981) = 500199981.f(500199982) = 500199982.f(500199983) = 500199983.f(500199984) = 500199984.f(500199985) = 500199985.f(500199986) = 500199986 f(500199987) = 500199987 f(500199988) = 500199988 f(500199989) = 500199989 f(500199990) = 500199990 f(500200000) = 500200000