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用俳句（一種日本短詩(shī)，每句有一個(gè)與季節(jié)有關(guān)的詞）來(lái)描述各種模型，借此預(yù)測(cè)網(wǎng)絡(luò)搜索流量的季節(jié)性變化。 4你落入一個(gè)迷宮，回旋不斷的走廊。手里有一臺(tái)堆滿灰塵的手提電腦，可以無(wú)線上網(wǎng)。周圍，許多無(wú)生命的侏儒徘徊走動(dòng)。這種情況下，你會(huì)如何做？ A)無(wú)目的地徘徊，不停走入死胡同，然后被迷宮里面的妖怪吃掉。 B)用手提電腦當(dāng)鏟子，打穿地板直接進(jìn)入游戲下一關(guān)。 C)玩網(wǎng)絡(luò)游戲魔法奇兵，直到電池耗盡。 D)利用計(jì)算機(jī)，找到迷宮的節(jié)點(diǎn)，發(fā)現(xiàn)準(zhǔn)確出路。 E)把你的簡(jiǎn)歷寄給Google，告訴迷宮里領(lǐng)頭的妖怪，你要退出游戲。然后，發(fā)現(xiàn)你回到了現(xiàn)實(shí)世界。 5Unix有什么問(wèn)題？你會(huì)如何補(bǔ)救它？ 6你在Google工作的第一天，發(fā)現(xiàn)你同寢室的室友，曾寫(xiě)過(guò)一本書(shū)。你研究生一年級(jí)時(shí)，這本書(shū)是你最重要的參考資料。你會(huì)： A)求他幫你簽個(gè)名。 B)不改坐姿，卻放輕打字聲音，盡量避免影響他。 C)把你每天吃的麥片和咖啡，留給他吃。 D)引用他那本書(shū)中間，你最喜歡的程式，告訴他這則方程給了你多少啟發(fā)。 E)讓他看看，你可以用不到34句語(yǔ)句，完成一個(gè)高難度程序。 7以下哪個(gè)最好地表達(dá)了Google的企業(yè)文化？ A)“我感覺(jué)挺幸運(yùn)” B)“別干壞事” C)“哦，我已經(jīng)完成了任務(wù)” D)“你身邊10米以內(nèi)，必定能找到食物” E)以上皆是 10用1歐姆的電阻，組成無(wú)限大的放行點(diǎn)陣，問(wèn)“象棋跳馬步”（“日”字對(duì)角點(diǎn)）兩點(diǎn)之間的電阻是多少？ 11下午2點(diǎn)，舊金山著名的灣區(qū)。你可以選擇去陽(yáng)光海岸、國(guó)家公園的紅杉林里徒步旅行，或者參觀城市 里的文化景觀。你會(huì)怎么做？ 14搜索技術(shù)的下一個(gè)革命性突破是什么？ 15一個(gè)技術(shù)研究小組的最優(yōu)化人員組合是幾個(gè)人？一旦超過(guò)這個(gè)數(shù)字，每增加一個(gè)研究員，平均生產(chǎn)力就會(huì)相應(yīng)下降： A)1 B)3 C)5 D)11 E)24 16三角形ABC，用圓規(guī)和尺，找出點(diǎn)P，保證三角形ABP、ACP和BCP周長(zhǎng)相等。 18你寫(xiě)過(guò)最酷的程序是什么？ 20找出此數(shù)列的下一個(gè):10,9,60,90,70,66? A)96 B)10的100次方 C)A或者B D)以上皆否 用少于29個(gè)詞，描述你能帶給Google實(shí)驗(yàn)室的貢獻(xiàn)。微軟面試題，有答案了，但不知道為什么會(huì)是這樣!對(duì)一批編號(hào)為1-100全部開(kāi)關(guān)朝上（開(kāi)）的燈進(jìn)行以下操作： 凡是1的倍數(shù)反方向撥一次開(kāi)關(guān)；2的倍數(shù)反方向又撥一次開(kāi)關(guān)；3的倍數(shù)反方向又撥一次開(kāi)關(guān)。 問(wèn)：最后為關(guān)熄狀態(tài)的燈的編號(hào)。 答案： 1，4，9，16，25，36，47，64，81，100關(guān) int count; for (int i = 1; i 101; i+) count = 0; for (int j = 1; j 0) label1.Text = label1.Text + i.ToString() + ; 最后結(jié)果是1，4，9，16，25，36，49，64，81，100關(guān)為什么是一個(gè)數(shù)的平方呢 肯定是奇數(shù)個(gè)數(shù)的因子，這是肯定的，但這不應(yīng)該得出答案的最佳思路 = 不是一個(gè)數(shù)的平方！ 肯定是因子（包括假因子1和自身）個(gè)數(shù)為奇數(shù)的！ 如果以程序來(lái)寫(xiě)的話： 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的則為關(guān)。我的分析是這樣的： 題目主要是得出奇數(shù)或者偶數(shù)個(gè)因子。 現(xiàn)假設(shè)c%a=0,c/a=b，那么a就是c的因子， 同樣可以得到：c/b=a，c%b=0，因此b也是c的因子 即：c=a*b，這樣可以看到c的因子是成對(duì)（a，b）出現(xiàn)的。 但這樣就能得出c的因子個(gè)數(shù)就是偶數(shù)嗎？ 答案顯然不是，如果存在a=b，那么c就有奇數(shù)個(gè)因子。 例如： 100= 1*100 2*50 4*25 5*20 10*10 我們可以看到，最后的10*10，即存在a=b，因此100就有奇數(shù)個(gè)因子。 再如： 80= 1*80 2*40 4*20 5*16 8*10 我們同樣可以看到，不存在a=b，因此80就有偶數(shù)個(gè)因子。 所以，得出結(jié)論：如果存在c=a*a，a、c都為正整數(shù)，那么c就有奇數(shù)個(gè)因子。 題目的結(jié)果就明了了，呵呵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? 翻譯過(guò)來(lái)大體是這樣： 有一個(gè)整數(shù)n,寫(xiě)一個(gè)函數(shù)f(n),返回0到n之間出現(xiàn)的1的個(gè)數(shù)。比如f(13)=6,現(xiàn)在f(1)=1,問(wèn)下一個(gè)最大的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; 計(jì)算到：199981 用了203不過(guò)只計(jì)算到上邊的數(shù)值就沒(méi)多大意思，看看這個(gè)：這個(gè)是4000000000以內(nèi)的結(jié)果?。篺(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