91麻豆国产精品91久久久,热久久这里只有精品,久久久婷婷五月亚洲97号色

火�R�q�煤问题(�?

Mon, 11 Apr 2011 11:36:00 GMT

你是��p��的一个煤老板�Q�你在矿区开采了�?000吨煤需要运送到市场上去卖，从你的矿区到市场�?000公里�Q�你手里有一列烧煤的火�R�Q�这个火车最多只能装1000吨煤�Q�且其能耗比较大——每一公里需要耗一吨煤。请问，作�ؓ(f��)一个懂�~�程的煤老板的你�Q�你�?x��)怎么�q�送才能运最多的煤到集市�Q?/span>

火�R�q�行�Ӟ��最好让他满载，起始点记为A
�W�一步，分三�ơ把煤运送到中间点B
�W�二步，分两�ơ把煤运送到中间点C
�W�三步，把煤�q�送到目的地D
�W�一步：(x��)5*(AB) = 1000�Q�解得AB=200
�W�二步：(x��)3*BC = 1000�Q�解得BC=333.
�W�三步：(x��)AB+BC+CD=1000�Q�解得CD=467
因此�Q�做多运�?33吨煤到目的地

假定从A到B需�?m+1�ơ，距离为x�Q�那么运�q�去消�?2m+1)x的煤。一开始的时候必��?m+1)>=3才可以把煤运完，而且�I��是没有哦效率的，所�?m+1)<4.
所以m=2�Q�而m=1是，所剩煤�?000�Q�m=0�Ӟ��所剩煤�?000.由m值可以得到距��x�Q�和9��g��栗��?br>同时�Q�在m不变的情况下�Q�可以�Q意分�D�，比如m=2是，可以把煤�q�到50处，然后在运�?00处，然后再运�?00处，�׃��m都是�{�于2�Q�所以到200�Ӟ��M��(x��)剩下2000煤�?br>所以实际上解有无群多，只要让煤�?00�Q?33的地斚w��新聚集就行了�?br>
首先�Q�要获得最大��|��必须在最�q�的中间”补给�?#8221;放下�{�同其�\�E�的煤作��l�。所以接下来要做的就是，如何�?000吨煤攑ֈ�最�q�的地方�Q�同时留�?#8220;补给�?#8221;。因为条仉��Ӟ��所以只能分两次达成上面的目标，�W�一个补�l�点�Q�他要消耗的是他路程�?倍的煤，因�ؓ(f��)他自己消耗两�ơ，�W�二�ơ送煤的消耗两�ơ，最后一�ơ直辄��点的要消耗一�ơ。所以他要在1/5的地�Ҏ(gu��)��下，�W�一个点已经提供补给�Q�所以第二点要补�l?�ơ，他自�׃��ơ，最后直辄��一�ơ。所以是�?00+333的地�Ҏ(gu��)��?33.所以最后到辄��Q�应该是200+333 = 533. ��L��是其他��g��可以推导出来�?br>�~�程的例子就是：(x��)

int sum = 3000;
int load_num = 1000;

int result = 0;
int time = sum / load_num – 1;
for (int i = time; i > 0 ; –i) {
result += load_num / ((i*2) + 1);
}

漫步者�?…�?�K?/a> 2011-04-11 19:36 发表评论

Google�W�试�?

Mon, 13 Dec 2010 14:16:00 GMT

140个Google的面试题

2010�q?2�?�?/span> 陈皓发表评论阅读评论 4,360 �ơ点�?

来源�Q?a onclick="pageTracker._trackPageview('/outgoing/blog.seattleinterviewcoach.com/2009/02/140-google-interview-questions.html?referer=');" target=_blank>http://blog.seattleinterviewcoach.com/2009/02/140-google-interview-questions.html�Q�墙�Q?br>

某猎头收集了140多个Google的面试题�Q�都张到他的Blog中了�Q�主要是下面�q�些职位的，因�ؓ(f��)被墙�Q�且无�Q何敏感信息，所以，我原文搬�q�来了�?/div>

Product Marketing Manager
Product Manager
Software Engineer
Software Engineer in Test
Quantitative Compensation Analyst
Engineering Manager
AdWords Associate

�q�篇Blog例�D了Google用来面试下面�q�几个职位的面试题。很多不是很�Ҏ(gu��)��回答�Q�不�q�都比较�l�典与变态，是Google�Q�Microsoft�Q�Amazon之类的公司的风格。对于本文，我没有翻译，因�ؓ(f��)我相信，英文问题是最好的。不�q�对于有些问题，我做了一些注释，不一定对�Q�但希望对你有帮助启发。对于一些问题，如果你百思不得其解，可以Google一下，StackOverflow或是Wikipedia上可能会(x��)�l�你非常全面的答案�?/p>

Product Marketing Manager

Why do you want to join Google?
What do you know about Google’s product and technology?
If you are Product Manager for Google’s Adwords, how do you plan to market this?
What would you say during an AdWords or AdSense product seminar?
Who are Google’s competitors, and how does Google compete with them?
Have you ever used Google’s products? Gmail?
What’s a creative way of marketing Google’s brand name and product?
If you are the product marketing manager for Google’s Gmail product, how do you plan to market it so as to achieve 100 million customers in 6 months?
How much money you think Google makes daily from Gmail ads?
Name a piece of technology you’ve read about recently. Now tell me your own creative execution for an ad for that product.
Say an advertiser makes $0.10 every time someone clicks on their ad. Only 20% of people who visit the site click on their ad. How many people need to visit the site for the advertiser to make $20?
Estimate the number of students who are college seniors, attend four-year schools, and graduate with a job in the United States every year.

Product Manager

How would you boost the GMail subscription base?
What is the most efficient way to sort a million integers? �Q�陈皓：(x��)merge sort�Q?
How would you re-position Google’s offerings to counteract competitive threats from Microsoft?
How many golf balls can fit in a school bus? �Q�陈皓：(x��)�q�种题一般来说是考你的解题思�\的，注意�Q�你不能单纯地把高尔夫球当成一个小立方体，其是一个圆球，堆�v来的时候应该是错开的——也��是三个盔R��的球的圆心是个等边三角�Ş�Q?
You are shrunk to the height of a nickel and your mass is proportionally reduced so as to maintain your original density. You are then thrown into an empty glass blender. The blades will start moving in 60 seconds. What do you do?
How much should you charge to wash all the windows in Seattle?
How would you find out if a machine’s stack grows up or down in memory?
Explain a database in three sentences to your eight-year-old nephew. �Q�陈皓：(x��)用三句话�?岁的侄子解释什么是数据库，考你的表达能力了�Q?
How many times a day does a clock’s hands overlap?�Q�陈皓：(x��)�l�典的时钟问题）
You have to get from point A to point B. You don’t know if you can get there. What would you do?
Imagine you have a closet full of shirts. It’s very hard to find a shirt. So what can you do to organize your shirts for easy retrieval? �Q�陈皓：(x��)很不错的一道题�Q�不要以为分�c�L��询很�Ҏ(gu��)��Q�想惛_��书馆图书的分�c�L��询问题吧。另外，你处��x��如何在你在你的衣柜里实现一个相当于Hash表或是一个Tree之类的数据结构）
Every man in a village of 100 married couples has cheated on his wife. Every wife in the village instantly knows when a man other than her husband has cheated, but does not know when her own husband has. The village has a law that does not allow for adultery. Any wife who can prove that her husband is unfaithful must kill him that very day. The women of the village would never disobey this law. One day, the queen of the village visits and announces that at least one husband has been unfaithful. What happens? �Q�陈皓：(x��)�q�个问题很有限制�U�，哈哈�Q�非常搞的一个问题，注意wife们的递归�Q�这�cȝ��问题是经典的分布式通讯问题�Q�上�|�搜一搜吧。）
In a country in which people only want boys, every family continues to have children until they have a boy. If they have a girl, they have another child. If they have a boy, they stop. What is the proportion of boys to girls in the country?�Q�陈皓：(x��)�W�一反应是——这个国家是中国。一个概率问题，其实�Q�无��Z��怎么生，50%的概率是永远不变的。）
If the probability of observing a car in 30 minutes on a highway is 0.95, what is the probability of observing a car in 10 minutes (assuming constant default probability)?
If you look at a clock and the time is 3:15, what is the angle between the hour and the minute hands? (The answer to this is not zero!)
Four people need to cross a rickety rope bridge to get back to their camp at night. Unfortunately, they only have one flashlight and it only has enough light left for seventeen minutes. The bridge is too dangerous to cross without a flashlight, and it’s only strong enough to support two people at any given time. Each of the campers walks at a different speed. One can cross the bridge in 1 minute, another in 2 minutes, the third in 5 minutes, and the slow poke takes 10 minutes to cross. How do the campers make it across in 17 minutes?�Q�陈皓：(x��)�l�典的过桥问题）
You are at a party with a friend and 10 people are present including you and the friend. your friend makes you a wager that for every person you find that has the same birthday as you, you get $1; for every person he finds that does not have the same birthday as you, he gets $2. would you accept the wager?
How many piano tuners are there in the entire world?
You have eight balls all of the same size. 7 of them weigh the same, and one of them weighs slightly more. How can you find the ball that is heavier by using a balance and only two weighings?�Q�陈皓：(x��)�l�典的称重问题。这��L(f��ng)��问题花样很多�Q�不�q�都不难回答�Q?
You have five pirates, ranked from 5 to 1 in descending order. The top pirate has the right to propose how 100 gold coins should be divided among them. But the others get to vote on his plan, and if fewer than half agree with him, he gets killed. How should he allocate the gold in order to maximize his share but live to enjoy it? (Hint: One pirate ends up with 98 percent of the gold.)
You are given 2 eggs. You have access to a 100-story building. Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100th floor. Both eggs are identical. You need to figure out the highest floor of a 100-story building an egg can be dropped without breaking. The question is how many drops you need to make. You are allowed to break 2 eggs in the process. �Q�陈皓：(x��)�?的倍数的楼层开始扔�Q�比�?�Q?�Q?�Q?2…..�Q�如果鸡蛋在3n层碎了，那到�?n-1层扔�W�二个鸡蛋，如果没碎�Q�则最高不��楼层�ؓ(f��)3n-1�Q�否则�ؓ(f��)3n-2�Q?
Describe a technical problem you had and how you solved it.
How would you design a simple search engine?
Design an evacuation plan for San Francisco.
There’s a latency problem in South Africa. Diagnose it. �Q�陈皓：(x��)�q�个问题完全是在考你的解决问题的能力。没有明��的�{�案。不�q�，解决性能问题的第一步通常是找出瓶颈，扄��颈有很多�U�方法，工具�Q�二分查�Q�时间记录等�{�。）
What are three long term challenges facing Google?
Name three non-Google websites that you visit often and like. What do you like about the user interface and design? Choose one of the three sites and comment on what new feature or project you would work on. How would you design it?
If there is only one elevator in the building, how would you change the design? How about if there are only two elevators in the building? �Q�陈皓：(x��)�l�典的电(sh��)梯设计问题，�q�种问题千变万化�Q�主要是考你的设计能力和需求变化的适变能力�Q�与此相似的是酒店订房系�l�。）
How many vacuum’s are made per year in USA?

Software Engineer

Why are manhole covers round? �Q�陈皓：(x��)��Z��么下水井盖是圆的�Q�这是有N�U�答案的�Q�上Wiki看看吧）
What is the difference between a mutex and a semaphore? Which one would you use to protect access to an increment operation?
A man pushed his car to a hotel and lost his fortune. What happened? �Q�陈皓：(x��)脑筋急�{弯？他在玩大富翁游戏�Q�！�Q�）
Explain the significance of “dead beef”.�Q�陈皓：(x��)要是你看到的�?6�q�制 DEAD BEEF�Q�你�?x��)觉得这是什么？IPv6的地址�Q�）
Write a C program which measures the the speed of a context switch on a UNIX/Linux system.
Given a function which produces a random integer in the range 1 to 5, write a function which produces a random integer in the range 1 to 7.�Q�陈皓：(x��)上StackOverflow看看吧，�l�典的问题）
Describe the algorithm for a depth-first graph traversal.
Design a class library for writing card games. �Q�陈皓：(x��)用一�p�d��的类来设计一个扑克游戏，设计题）
You need to check that your friend, Bob, has your correct phone number, but you cannot ask him directly. You must write a the question on a card which and give it to Eve who will take the card to Bob and return the answer to you. What must you write on the card, besides the question, to ensure Bob can encode the message so that Eve cannot read your phone number?�Q�陈皓：(x��)协议+数字加密�Q�我试想了一个，�U�条上可以这样写�Q?#8220;Bob�Q�请把我的手机号以MD5��法加密后的字符�Ԍ��比对下面的字�W�串——XXXXXX�Q�它们是一��L(f��ng)��吗？”�Q?
How are cookies passed in the HTTP protocol?
Design the SQL database tables for a car rental database.
Write a regular expression which matches a email address. �Q�陈皓：(x��)上StackOverflow查相当的问题吧。）
Write a function f(a, b) which takes two character string arguments and returns a string containing only the characters found in both strings in the order of a. Write a version which is order N-squared and one which is order N.�Q�陈皓：(x��)��法题，不难�Q�不说了。一个O(n^2)和一个O(n)的算法复杂度�Q?
You are given a the source to a application which is crashing when run. After running it 10 times in a debugger, you find it never crashes in the same place. The application is single threaded, and uses only the C standard library. What programming errors could be causing this crash? How would you test each one? �Q�陈皓：(x��)和随机数有关�p�？或是旉��Q�）
Explain how congestion control works in the TCP protocol.
In Java, what is the difference between final, finally, and finalize?
What is multithreaded programming? What is a deadlock?
Write a function (with helper functions if needed) called to Excel that takes an excel column value (A,B,C,D…AA,AB,AC,… AAA..) and returns a corresponding integer value (A=1,B=2,… AA=26..).
You have a stream of infinite queries (ie: real time Google search queries that people are entering). Describe how you would go about finding a good estimate of 1000 samples from this never ending set of data and then write code for it.
Tree search algorithms. Write BFS and DFS code, explain run time and space requirements. Modify the code to handle trees with weighted edges and loops with BFS and DFS, make the code print out path to goal state.
You are given a list of numbers. When you reach the end of the list you will come back to the beginning of the list (a circular list). Write the most efficient algorithm to find the minimum # in this list. Find any given # in the list. The numbers in the list are always increasing but you don’t know where the circular list begins, ie: 38, 40, 55, 89, 6, 13, 20, 23, 36. �Q�陈皓：(x��)循环排序数组的二分查��N��题）
Describe the data structure that is used to manage memory. (stack)
What’s the difference between local and global variables?
If you have 1 million integers, how would you sort them efficiently? (modify a specific sorting algorithm to solve this)
In Java, what is the difference between static, final, and const. (if you don’t know Java they will ask something similar for C or C++).
Talk about your class projects or work projects (pick something easy)… then describe how you could make them more efficient (in terms of algorithms).
Suppose you have an NxN matrix of positive and negative integers. Write some code that finds the sub-matrix with the maximum sum of its elements.�Q�陈皓：(x��)以前见过一�l�数�l�的�q�个问题�Q�现在是二维的。感觉应该是把二�l�的�W�一行的最大和的区间算出来�Q�然后再在这个基��之上�q�行二维的分析。思�\应该是这个，不过具体的算法还需要想一惻I��
Write some code to reverse a string.
Implement division (without using the divide operator, obviously).�Q�陈皓：(x��)想一��x��除法的�q�程。）
Write some code to find all permutations of the letters in a particular string.
What method would you use to look up a word in a dictionary? �Q�陈皓：(x��)使用排序�Q�哈希，�?w��i)等��法和数据结构�?
Imagine you have a closet full of shirts. It’s very hard to find a shirt. So what can you do to organize your shirts for easy retrieval?
You have eight balls all of the same size. 7 of them weigh the same, and one of them weighs slightly more. How can you fine the ball that is heavier by using a balance and only two weighings?
What is the C-language command for opening a connection with a foreign host over the internet?
Design and describe a system/application that will most efficiently produce a report of the top 1 million Google search requests. These are the particulars: 1) You are given 12 servers to work with. They are all dual-processor machines with 4Gb of RAM, 4x400GB hard drives and networked together.(Basically, nothing more than high-end PC’s) 2) The log data has already been cleaned for you. It consists of 100 Billion log lines, broken down into 12 320 GB files of 40-byte search terms per line. 3) You can use only custom written applications or available free open-source software.
There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1]. Solve it without division operator and in O(n).�Q�陈皓：(x��)注意其不能��用除法。算法思�\是这��L(f��ng)��Q�把output[i]=a[i]左边的乘�U?x a[i]双��的乘�U�，所以，我们可以分两个��@环，�W�一�ơ先把A[i]左边的乘�U�放在Output[i]中，�W�二�ơ把A[i]双��的乘�U�算出来。我们先看第一�ơ的循环�Q��用�P代篏�U�的方式�Q�代码如下：(x��)for(r=1; i=0; iThere is a linked list of numbers of length N. N is very large and you don’t know N. You have to write a function that will return k random numbers from the list. Numbers should be completely random. Hint: 1. Use random function rand() (returns a number between 0 and 1) and irand() (return either 0 or 1) 2. It should be done in O(n).�Q�陈皓：(x��)本题其实不难。在遍历链表的同时一边生成随机数�Q�一边记录最大的K个随机数和其链接地址。）
Find or determine non existence of a number in a sorted list of N numbers where the numbers range over M, M>> N and N large enough to span multiple disks. Algorithm to beat O(log n) bonus points for constant time algorithm.�Q�陈皓：(x��)使用bitmap�Q�如果一个长整�Ş�?4位，那么我们可以使用M/64个bitmap�Q?
You are given a game of Tic Tac Toe. You have to write a function in which you pass the whole game and name of a player. The function will return whether the player has won the game or not. First you to decide which data structure you will use for the game. You need to tell the algorithm first and then need to write the code. Note: Some position may be blank in the game�?So your data structure should consider this condition also.
You are given an array [a1 To an] and we have to construct another array [b1 To bn] where bi = a1*a2*…*an/ai. you are allowed to use only constant space and the time complexity is O(n). No divisions are allowed.�Q�陈皓：(x��)前面说过了）
How do you put a Binary Search Tree in an array in a efficient manner. Hint :: If the node is stored at the ith position and its children are at 2i and 2i+1(I mean level order wise)Its not the most efficient way.�Q�陈皓：(x��)按顺序遍历树(w��i)�Q?
How do you find out the fifth maximum element in an Binary Search Tree in efficient manner. Note: You should not use use any extra space. i.e sorting Binary Search Tree and storing the results in an array and listing out the fifth element.
Given a Data Structure having first n integers and next n chars. A = i1 i2 i3 … iN c1 c2 c3 … cN.Write an in-place algorithm to rearrange the elements of the array ass A = i1 c1 i2 c2 … in cn�Q�陈皓：(x��)�q�个��法其实��是从中间开始交换元素，代码�Q�for(i=n-1; i>1; i++) { for(j=i; j<2*n-i; j+=2) { swap(a[j], a[j+1]); } }�Q�不好意思写在同一行上了。）
Given two sequences of items, find the items whose absolute number increases or decreases the most when comparing one sequence with the other by reading the sequence only once.
Given That One of the strings is very very long , and the other one could be of various sizes. Windowing will result in O(N+M) solution but could it be better? May be NlogM or even better?
How many lines can be drawn in a 2D plane such that they are equidistant from 3 non-collinear points?
Let’s say you have to construct Google maps from scratch and guide a person standing on Gateway of India (Mumbai) to India Gate(Delhi). How do you do the same?
Given that you have one string of length N and M small strings of length L. How do you efficiently find the occurrence of each small string in the larger one?
Given a binary tree, programmatically you need to prove it is a binary search tree.
You are given a small sorted list of numbers, and a very very long sorted list of numbers – so long that it had to be put on a disk in different blocks. How would you find those short list numbers in the bigger one?
Suppose you have given N companies, and we want to eventually merge them into one big company. How many ways are theres to merge?
Given a file of 4 billion 32-bit integers, how to find one that appears at least twice? �Q�陈皓：(x��)我能惛_��的是拆分成若�q�个��数�l�，排序�Q�然后一点点归�ƈ��h��Q?
Write a program for displaying the ten most frequent words in a file such that your program should be efficient in all complexity measures.�Q�陈皓：(x��)你可能需要看看这��文�?a onclick="pageTracker._trackPageview('/outgoing/www.cs.rutgers.edu/_farach/pubs/FrequentStream.pdf?referer=');" target=_blank>Finding Frequent Items in Data Streams�Q?
Design a stack. We want to push, pop, and also, retrieve the minimum element in constant time.
Given a set of coin denominators, find the minimum number of coins to give a certain amount of change.�Q�陈皓：(x��)你应该查看一下这��文章：(x��)Coin Change Problem�Q?
Given an array, i) find the longest continuous increasing subsequence. ii) find the longest increasing subsequence.�Q�陈皓：(x��)�q�个题不难，O(n)��法是边遍历边记录当前最大的�q�箋的长度。）
Suppose we have N companies, and we want to eventually merge them into one big company. How many ways are there to merge?
Write a function to find the middle node of a single link list. �Q�陈皓：(x��)我能惛_��的算法是——设�|�两个指针p1和p2�Q�每一�ơ，p1��C��步，p2��C��步，�q�样�Q�当p1走到最后时�Q�p2��在中间�Q?
Given two binary trees, write a compare function to check if they are equal or not. Being equal means that they have the same value and same structure.�Q�陈皓：(x��)�q�个很简单，使用递归��法。）
Implement put/get methods of a fixed size cache with LRU replacement algorithm.
You are given with three sorted arrays ( in ascending order), you are required to find a triplet ( one element from each array) such that distance is minimum. Distance is defined like this : If a[i], b[j] and c[k] are three elements then distance=max(abs(a[i]-b[j]),abs(a[i]-c[k]),abs(b[j]-c[k]))” Please give a solution in O(n) time complexity�Q�陈皓：(x��)三个指针�Q�a, b, c分别指向三个数组��_(d��)��假设�Q�a[0]b[0]�Q�计��?abs(a[i-1] – c[0])�Q�把�l�果保存在min中。现在情况变成找 a[i], b[0],c[0]�Q�重复上�q�过�E�，如果有一个新的值比min要小�Q�那��取代现有的min。）
How does C++ deal with constructors and deconstructors of a class and its child class?
Write a function that flips the bits inside a byte (either in C++ or Java). Write an algorithm that take a list of n words, and an integer m, and retrieves the mth most frequent word in that list.
What’s 2 to the power of 64?
Given that you have one string of length N and M small strings of length L. How do you efficiently find the occurrence of each small string in the larger one? �Q�陈皓：(x��)我能惛_��的是——把那M个小字串排个序，然后遍历大字�Ԍ��q�在那M个字串中以二分取中的方式查找。）
How do you find out the fifth maximum element in an Binary Search Tree in efficient manner.
Suppose we have N companies, and we want to eventually merge them into one big company. How many ways are there to merge?
There is linked list of millions of node and you do not know the length of it. Write a function which will return a random number from the list.
You need to check that your friend, Bob, has your correct phone number, but you cannot ask him directly. You must write a the question on a card which and give it to Eve who will take the card to Bob and return the answer to you. What must you write on the card, besides the question, to ensure Bob can encode the message so that Eve cannot read your phone number?
How long it would take to sort 1 trillion numbers? Come up with a good estimate.
Order the functions in order of their asymptotic performance: 1) 2^n 2) n^100 3) n! 4) n^n
There are some data represented by(x,y,z). Now we want to find the Kth least data. We say (x1, y1, z1) > (x2, y2, z2) when value(x1, y1, z1) > value(x2, y2, z2) where value(x,y,z) = (2^x)*(3^y)*(5^z). Now we can not get it by calculating value(x,y,z) or through other indirect calculations as lg(value(x,y,z)). How to solve it?
How many degrees are there in the angle between the hour and minute hands of a clock when the time is a quarter past three?
Given an array whose elements are sorted, return the index of a the first occurrence of a specific integer. Do this in sub-linear time. I.e. do not just go through each element searching for that element.
Given two linked lists, return the intersection of the two lists: i.e. return a list containing only the elements that occur in both of the input lists. �Q�陈皓：(x��)把第一个链表存入hash表，然后遍历�W�二个链表。不知道�q�没有更好的�Ҏ(gu��)��。）
What’s the difference between a hashtable and a hashmap?
If a person dials a sequence of numbers on the telephone, what possible words/strings can be formed from the letters associated with those numbers?�Q�陈皓：(x��)�q�个问题和美国的�?sh��)话有关�p�，大家可以试着想一下我们发短信的手机，按数字键出字母，一个组合的数学问题。）
How would you reverse the image on an n by n matrix where each pixel is represented by a bit?
Create a fast cached storage mechanism that, given a limitation on the amount of cache memory, will ensure that only the least recently used items are discarded when the cache memory is reached when inserting a new item. It supports 2 functions: String get(T t) and void put(String k, T t).
Create a cost model that allows Google to make purchasing decisions on to compare the cost of purchasing more RAM memory for their servers vs. buying more disk space.
Design an algorithm to play a game of Frogger and then code the solution. The object of the game is to direct a frog to avoid cars while crossing a busy road. You may represent a road lane via an array. Generalize the solution for an N-lane road.
What sort would you use if you had a large data set on disk and a small amount of ram to work with?
What sort would you use if you required tight max time bounds and wanted highly regular performance.
How would you store 1 million phone numbers?�Q�陈皓：(x��)试想�?sh��)话是有区段的，可以把区�D늻�一保存�Q�Flyweight设计模式�Q?
Design a 2D dungeon crawling game. It must allow for various items in the maze – walls, objects, and computer-controlled characters. (The focus was on the class structures, and how to optimize the experience for the user as s/he travels through the dungeon.)
What is the size of the C structure below on a 32-bit system? On a 64-bit? �Q�陈皓：(x��)注意�~�译器的寚w��Q?

struct foo {

char a;

char* b;

};

Software Engineer in Test

Efficiently implement 3 stacks in a single array.
Given an array of integers which is circularly sorted, how do you find a given integer.
Write a program to find depth of binary search tree without using recursion.
Find the maximum rectangle (in terms of area) under a histogram in linear time.
Most phones now have full keyboards. Before there there three letters mapped to a number button. Describe how you would go about implementing spelling and word suggestions as people type.
Describe recursive mergesort and its runtime. Write an iterative version in C++/Java/Python.
How would you determine if someone has won a game of tic-tac-toe on a board of any size?
Given an array of numbers, replace each number with the product of all the numbers in the array except the number itself *without* using division.
Create a cache with fast look up that only stores the N most recently accessed items.
How to design a search engine? If each document contains a set of keywords, and is associated with a numeric attribute, how to build indices?
Given two files that has list of words (one per line), write a program to show the intersection.
What kind of data structure would you use to index annagrams of words? e.g. if there exists the word “top” in the database, the query for “pot” should list that.

Quantitative Compensation Analyst

What is the yearly standard deviation of a stock given the monthly standard deviation?
How many resumes does Google receive each year for software engineering?
Anywhere in the world, where would you open up a new Google office and how would you figure out compensation for all the employees at this new office?
What is the probability of breaking a stick into 3 pieces and forming a triangle?

Engineering Manager

You’re the captain of a pirate ship, and your crew gets to vote on how the gold is divided up. If fewer than half of the pirates agree with you, you die. How do you recommend apportioning the gold in such a way that you get a good share of the booty, but still survive?

AdWords Associate

How would you work with an advertiser who was not seeing the benefits of the AdWords relationship due to poor conversions?
How would you deal with an angry or frustrated advertisers on the phone?

Sources

http://news.ycombinator.com/item?id=266663

http://tihomir.org/crazy-questions-at-google-job-interview/

http://www.drizzle.com/~jpaint/google.html

http://www.gamedev.net/community/forums/topic.asp?topic_id=299692

http://careers.cse.sc.edu/googleinterview

http://job-interview.blogspot.com/2005/02/google-interview-product-marketing.html

http://www.theregister.co.uk/2007/01/05/google_interview_tales/

http://money.cnn.com/2007/08/29/technology/brain_teasers.biz2/index.htm

http://blogs.lessthandot.com/index.php/ITProfessionals/EthicsIT/google-interview-questions

http://placementsindia.blogspot.com/2007/09/google-top-interview-puzzles.html

http://linkmingle.com/user/interview_questions/google_interview_questions

http://discuss.joelonsoftware.com/default.asp?interview.11.626758.33

http://mindcipher.com/puzzle/78-clock-works

http://www.glassdoor.com

http://bluepixel.ca/blog/?p=69

http://www.businessinsider.com/my-nightmare-interviews-with-google-2009-11

�Q�全文完�Q?/p>

漫步者�?…�?�K?/a> 2010-12-13 22:16 发表评论

Mon, 13 Dec 2010 14:01:00 GMT

google�W�试题收�?/font>

1. 异或
1^1=0
0^0=0
1^0=1
0^1=1

2. 斐�L那契数列(Fibonacci)

3.存储�I�间上不��h��优势

4. �?#8220;��d��?#8221;
T(n)=25T(n/5) + n²

a=25 b=5 f(n)=n²
log_ba=2

��n^log_ba与f(n)比较�Q?相等
则时间复杂度为O(n²logn)

1.

2.

3

#include <iostream>
#include <limits>
using namespace std;

int foo(int arr[], int n)
{
    int max = numeric_limits<int>::min();
    //cout << max << "\n";
    for(int i = 0; i < n; i++)
    {
        int product = 1;
        for(int j =0; j < n; j++)
        {
            if(j != i )
                product *= arr[j];
        }
        max = product > max ? product : max;
    }

    return max;
}

int main()
{
    int arr[4] = { -1, -5, 2, 3};
    cout << foo(arr, 4) << "\n";

    return 0;
}

旉��复杂度分�?
��d��的操作步�?n*{[n+(n-1)]+1}=2n²
旉��复杂度�ؓ(f��)O(n2)

�I�间复杂度�ؓ(f��)O(1) 4*sizeof(int)

改进��法�Q?br>
Google�W�试集锦
Google�W�试集锦

选择�?三道��法�?br>选择题没什么难�?nbsp; 最后一道考的数据库��用什么存储结构不�?x��)做。�?br>��法�?br>�W�一题没什么好�?br>�W�二题可�?br>

Google�W�试集锦
Google�W�试集锦

选择�?三道��法�?br>选择题没什么难�?nbsp; 最后一道考的数据库��用什么存储结构不�?x��)做。�?br>��法�?br>�W�一题没什么好�?br>�W�二题可破坏一个数�l�A[0..N-1]的条件下使用最��的内存判断是否存在相同的元�?br> 我的做法是堆排序旉��O(NlogN) �I�间O(1) 复杂度上来看应该最优了
�W�三题已知每个点的父节点�Q�求�q�棵�?w��i)的最大独立集
用递归求解 �c�M��动态规�?nbsp; 但是不存在重叠子状�?nbsp; �l�典��法问题�?br> 预处理每个节点的子节点存在一张表�?br> 旉��O(N�Q�空间O(N�Q?br>大家做的�l�果是这样吗�Q?br>发信�? 饮水思源 (2006�q?0�?1�?3:06:04 星期�?, 站内信�g
开章明义，我是个废人，上来�U�攒rp了�?br>在宣讲会(x��)的时候，听旁边的师姐说上��只招两个职位每个职位只招一个�h�?br>现在后�?zh��n)�只选了北京和上��L(f��ng)��SWE了�?br>不过反正……也不指望了。。�?/p>

�W�试题目�Q?道单�?3道问�{?br>旉��Q?00分钟
我做的是B南��?br>单选题�Q?br>1�Q�求两个二进制数的异或��|��基本上学�q�一点计��机的东西的人都能对的题目。�?br>2�Q�不记得了。。也是不需要思考的题目。�?br>3�Q�大概是如下的函敎ͼ�(x��)
int someFunc(int x){
    if (x == 0)
        return 0;
    else
        return x + someFunc(x - 1);
}
问这个计��的是什么。。�?br>4�Q�不记得了。。不需要思考吧。�?br>5�Q�不记得了。。不需要思考吧。�?br>6�Q�参�?�Q?�Q?。�?br>7�Q�似乎需要思考一下。�?br>8�Q�问链表�l�构和数�l�相比的优势不包括哪��，
包括�Q?br>插入的时�?br>删除的时�?br>存储�I�间
剩下两个不记得了。�?br>9�Q�如下函敎ͼ�(x��)
T(x) = 1 (x <= 1)
T(n) = 25 T(n/5) + n^2
问T(n)随n的增�ѝ�?br>选项大概是这��L(f��ng)��Q?br>O(n^2)�Q�O(n^2logn)�{�等的。�?br>问答�Q?br>1�Q�写两个N*N的矩�늚�乘法�Q�给��Z��C的格式，你可以选择你喜�Ƣ的语言��d��。�?br>int* multi(int* a1, int* a2, int N){
}
2�Q�寻找一个单向链表的中项�Q�如果存在两个则�q�回前一个。给��Z��C的格式，同样你可
以选择。。。�?br>struct {
    Node* next;
    int value;
} Node;
Node* someFunc(Node* head){
}
3�Q�给一个长度�ؓ(f��)n的整数数�l�，只允许用乘法不允许用除法�Q�计��Q�?n-1)个数的组�?br>乘积中最大的一�l�。。。写出算法的时空复杂度�?br>ps�Q�怀疑这道题目出错啦。。虽然我也做错了。。。。。�?br>一些补充：(x��)
1�Q�问�{�的�W�一题是google上学�?intern的大题原题；
2�Q�google很喜�Ƣ考链表，无论intern的面试以�?qi��ng)两�ơ的�W�试都有�q�样的题目；
3�Q�google一般大题第三道都是写算法的时空复杂度；
4�Q�选择题基本上偏简单，但是要做得准��率高似乎�ƈ不那么容易；
5�Q�根据传�a��Q�小道消息，��Z��亦云以及(qi��ng)以讹传讹�Q�google的高速审��h��{�来源于审卷�?br>以选择题�ؓ(f��)主，如果你全对啦�Q�那么恭喜你pass啦；如果你错了好几道�Q�那么下�ơ努�?br>吧，如果�q�有下次。。。大题基本是做参考的。。�?br>6�Q�选择题很多记不清了，因�ؓ(f��)一遍做下来的，回去随便扫了两眼。。。加上过了这几个
��时�Q�记不得了。希望大家补充修正以�?qi��ng)修攏V��。�?br>7�Q�google�?x��)�?1号开�?天内发面试通知�Q�据��道消息�{�等�Q�有四轮面试。bless大家~~

输入a_1,   a_2,   ...,   a_n,   b_1,   b_2,   ...,   b_n�Q�如何在O(n)的时��_(d��)��用O(1)的空��_(d��)��
��这个序列顺序改为a_1,   b_1,   ...,   a_n,   b_n�?br>�q�个问题在瀚�v星云上跟��Z��好几十的跟帖�Q�看看大家有没有什么好的解法！�Q�！

晚上是google的校园宣讲会(x��)
先前�q�没有投��历，但是�q�是奔了�?br>google的hrjj看�v来仿�?j��ng)没有ibm的那么动人，但却很亲�?br>五点半左叛_��始，开始前那个hrjj放了些google员工自己拍的mv�Q?br>比较有意�?br>之后是一个做技术的��L(f��ng)��如数家珍的介�l�google做的东西
之所以称�?#8220;��L(f��ng)��”主要感觉他很学生气。。。讲话�ƈ没有那些很商业的调度气氛的东�?br>很理想主义，呵呵�Q�虽然听的很多�h打瞌�?br>他��L��说google是个很理想主义的公司�Q�虽然�ؓ(f��)了生存不得不做一些商业化的事情，但是�Q�google做很多事情都是因��得有做的价值�ƈ且要做好�Q�所以有了googleprint,googleearth,�{�等
不过�Q�google仿佛(j��ng)是一个需要聪明�h的公司，接下来的�W�试应证了这一�?br>内容很少�Q�甚至简单，选择题可能是送分的，大概10来道�Q��ƈ不难�Q�算些东西，�q�有一点点�E�序斚w��的基��概念�Q�后面是三个��法设计题�?br>�W�一个，深拷贝一个二叉树(w��i)。我不明白这道题的动机是什么，我最后很搓得用了递归�Q�虽然明知道�q�样很耗，可是实在想不��h��非递归��法怎么个写法了�?br>�W�二个，把输入数�l�随机分配到一个新的数�l�上�Q�每个数都完全对应一个随机的位置�Q�当�Ӟ��随即产生函数是提供了的。这个题我想了很久，冲突的时候怎么办？散列�Q�但是那栯��是随机的吗？
�W�三个，很ft。居然是C语言的一个作业题。N个�h排成圈，从第一个�h开始，��L��Q�隔一个�h�Q�去掉下一个，以此�c�L��Q�要求出最后出局的那个�h的位�|�。�ƈ且，要求分析��法的时间、空间复杂度。我感觉�q�个题表面简单，实际对算法的优化要求很高。一个是�I�间复杂度，一个是旉��复杂度，只是不知道做��C��么程度算是极好�?br>仿佛(j��ng)�q�种�c�d��的考试�Q�大家差不多都能�{�完�Q�只是如何才能与众不同却让�h伤脑�{?br>回来后对google的印象变得很好，臛_��感觉他们真的是需要�h�Q�而不是一个螺丝钉。。�?

昨天�Q�参加了Google春季实习(f��n)工程师的招聘�W�试。这是进入大学以来参加的�W�一�ơ笔试�?br>可以��_(d��)��q�次�W�试也让我更明确了我的学�?f��n)方向。学�?f��n)什么技能不重要�Q�重要的是要有扎实基��Q�数据结构，c++语言�{�，都要扎实的掌握，不可有丝毫的马虎。于是，渐渐开始后�(zh��n)�了�Q�后�(zh��n)�自己对基础知识没有学好�Q�却又一天到晚想着要学什么什么东西，�q�真是丢了西瓜捡了芝麻，一点便宜都没有占到啊�?br>�q�记得昨天的�W�试�Q�第一题是有关位操作的�Q�很��单。接下来两题是讲const指针的，�q�便是我的一个薄��q��Q�以前一直都没有学好。首先，constchar*p="abcde"�Q�那么，p指向的内�Ҏ(gu��)��不可变得�Q�即不能改变*p的��|��但是�Q�p却是可变的，卛_��以这么操作：(x��)p=“12345”�Q�或者p=newchar[10]�Q�等�{�；另外�Q�char*constp="abcde"�Q�则表示�q�是一个指针常量，即p不能指向另外的地址�Q�但是，p指向的内�Ҏ(gu��)��可以改变的；�q�有一个就是常量指针常量，constchar*constp�Q�它是指向常量的帔R��指针�Q�若初始化的时候，p指向的是一个变量，那么�Q�不能用指针操作来改变变量的��|��例如�Q�inta=0;constint*constp=&a;*p=1;//�q�句或是错误的，但是�Q�可以直接给变量赋��|��即a=1�Q�是可以的�?br>接下来几题涉�?qi��ng)了��法分析的一些东西，然后是涉�?qi��ng)语法分析的正则表达式什么的�Q�这个因为没学过�~�译�Q�也��׃��太懂了。接下来是考了抖动。什么是抖动�Q�所谓抖动，主要是由于页面交换过于频�J�，而导致时间浪费太多的现象。特别的�Q�在虚拟内存技术下�Q�若工作集大��选的不合适的话，��׃��(x��)有频�J�的换入换出�Q�而我们知道，��盘的读写是需要花费大量时间的�Q�这��P��导致了某进�E�等待的旉��比实际运行的旉��多的多�?br>接下来的大题是编�E�题和算法题�Q�前两题都挺��单的�Q�第一题要求完成双向链表的��d��l�点�Q�第二题要求比较两字�W�串的字�W�出现频率；�W�三题是个算法题�Q�基本意思很��单，但是�Q�要扑ֈ�一个好的算法却需要一定的思考能力，具体题目已经��C��太清了�?br>��M��Q�这�ơ笔试，虽然说从一开始所��q��心态就是见识见识，没有奢求什么，只是惌��个温暖的象牙塔，走到外面�q�个��p��世界来看看情形。一切都需攑ּ�。走了一遭才发现�Q�不要��d��高处看，基础扎实了，才能造�v巴比伦塔�?br>

1.写程序判断是否字�W�串A里每个字�W�在A中出现的�ơ数都大于在字符串B中出现的�ơ数�?br>注：(x��)此题我是�Ҏ(gu��)��个字�W�出现的�ơ数分别�l�计�Q�然后比较。重复的字符重复�l�计比较�Q�所以效率很低。不知有什么好的改�q�方法？
2.对一个数�l�S�Q�求其中满��要求的最大元素C。要求C满��{�式C=A*B�Q�其中A、B也是数组S中的元素。请用能惛_��的最优算法，分析旉��和空间复杂度。（用语�a�描述��法�Q�不用写�E�序�Q?br>注：(x��)�q�个题我当时做的�Ҏ(gu��)��在时间上要用o(n^3)�Q�事后想��Z��个o(n^2logn)的方法。不知有没有更好的方法�?br>

传说中有��Q�google�W�试很变态，题目希奇古怪；google题目比较基础��单�?br>�l�于得于一见�?br>晚上�q�完�z�L��去，到的时候已�l?点左叟뀂在二教已经没有�I�Z��座位�Q�无赖多�{�了20多分钟才安排了一个新的教室�?br>发题�Q�答南��?br>整体感觉��是比较基础�Q�没有什么很隄��题目�Q�除最后一题目以外�?br>选择题目9个，比较基础�?br>�W�一题，相对比较��单，递归
�W�二题，基本是看是否对函数效率是否有概念。似乎也跟动态规划的记录法有点相��g��处�?br>最后一题目回想��h��实在惭愧�Q�其实还是题目没有怎么��L��。嗨�Q?br>以下是科苑上�Q�看到的解法。惭愧惭�?br>�W�一和第二应该是不错的选择�Q?br>特别是第二种�Ҏ(gu��)��Q?/p>

发信�?oasis(�l�洲),信区:SISE2004702
标题:�W�试最后一题想到的几种解法
发信�?BBS�U�苑星空�?WedOct1803:24:342006),站内
反正也晚了，�q�脆再折腾一�?x��)儿�?br>题目�Q�n个点�l�成的无向图�Q�对于�Q意给出的两点�Q�判断其是否有长度�ؓ(f��)K的通�\�?br>分析�Q�无向图是允许有环存在的�Q�也允许两点间有多条边，长度为K是指从一个点
�U�d��到相�?c��)��q�样�q�程的次数。比如AB两点盔R��Q�那么A-B-A-B��是长度�?的通�\�?br>解法一�Q�直接利用图��Z��的一个定理，��L��矩阵U的K�ơ方后所得矩�늚�(i,j)元素
即�ؓ(f��)原无向图中i,j两点之间长度为K的通�\数量。因此复杂度只需要对U^K分析�?br>�׃��U^2的时间复杂度为O(n^3)�Q�（�q�里使用了传�l�矩阵乘法，不过即��用strassan
�Ҏ(gu��)��也依然是O(n^(2+e))�Q�其�?��技巧，不需要去依次的乘�Q�否则的话需要K-1�ơ矩阵乘法，可以从U^2�Q�算出U^4�Q?br>依此�c�L��Q�因此�ȝ��旉��复杂度�ؓ(f��)O(n^3*lgK)。空间复杂度不细�q�O(n^2)�?br>评论一�Q�细心的��Z��(x��)注意到这��L(f��ng)��解法其实比题目的要求要强�Q�因为题目中只是�?br>求出��L��l�定的两炚w��K通�\数目�Q�而上�q�做法，则是把所有的两点�l�合都求出来
了。因此还应该存在着改进的算法在O(n^2)�q�个旉��复杂度��别�?br>解法二：(x��)�q�是看水木上一个网友的解法�Q�我重写成下面这��P��(x��)设所�l�的两点为A、B�?br>那么首先把A的所有相�?c��)��全部攑օ�U集合中，接着对之前放入U中的点i分别求出其相
�?c��)��Q��ƈ��它们放入U中（而原先的点i本��n则从集合中事先去除）。这样做�q�K�ơ后�Q?br>看队列中是否有B炏V��若有则表明存在着长度为K的通�\。由于每�ơ寻��N��接点的次�?br>不超�q�n^2�Q�而要�q�行K�ơ，因此旉��复杂度�ؓ(f��)O(n^2*K)�Q�空间复杂度为O(n)�?br>评论二：(x��)和解法一相比�Q�从n^3*lgK变�ؓ(f��)了n^2*K�Q�也��是n*lgK与K之间的差别，若n=k
的话�Q�也��p��明后者比前者快了lgK倍�?br>解法三：(x��)从A到B利用深度优先遍历�Q�找出每一条AB间的路径�Q�其中没有点重复�l�过�?br>�Ҏ(gu��)��一条这��L(f��ng)��路径�q�行分析�Q?br>若长�?gt;K�Q�该路径不可能满��I��
若长�?K�Q�则已满��I��
若长度一�ơ加一�Q�。若无环�Q�则看K-当前路径长度�Q�若该��gؓ(f��)偶数�Q�则可以在该路径上的某两
个邻接点上来回的重复��C��而满��求（每来回走一�ơ加二）。其他情况，无法满��?br>�׃��得到��法的时间和�I�间复杂度均为O(n^2)�Q?br>评论三：(x��)旉��复杂度很可能不是O(n^2)�Q�因��Z��A到B上找出每一条AB间的��单�\径，�?br>于存在着重复边和环的情况�Q�多半就不是��单的深度遍历的O(n^2)了，具体是多��我�?br>说不清。笔试里我用的这个方法，现在感觉挺玄。。�?

�?006-10-17�?br>      今晚Google�W�试�Q�也是本人的“处女�W?#8221;�Q��h�׃�h��啊�Q�开始Google技术�ȝ��宣讲�Ӟ��有位义愤填膺的老兄�Q�抓住提问时��_(d��)��强烈指责Google搜烦不了“南京大屠杀”�{?#8220;不公�?#8221;现象。唉�Q�勇气和爱国��M��情感可嘉啊，只可惜�ؓ(f��)什么不弄清情况��p��来�ؕ说话呢？
      �W�试的�h数比Google预想的多�?-3倍，题目不是很难�Q�似乎都是计��机专业的基��课。不�q�可惜，我不是计��机专业的，很多题目只是凭自��q��E�经验写的，估计希望不会(x��)太大。但是心情还不错�Q�因为本来就没有抱太大希望，而且Google�W�试��且不是很难�Q�就不必对其他公司笔试有太大心里压力了�?br>      有几道题目给出来�Q�喜�ƢC的来看看�Q?br>      int main()
      {const char* p = "12345";
       const char **q = &p;
       *q = "abcde";
      const char *s = ++p;
      p = "XYZWVU";
      printf("%c\n", *++s);
     }
   求输出结果�?br>---------------------------------------------
   最后一道题�Q?br>   n个节点的无向图，判断��L��两点之间是否有长度�ؓ(f��)K的通�\。写出算法思�\�Q��ƈ�l�出你的��法的时间和�I�间复杂度�?br>--------------------------------------------
   上面一题答�?#8220;c”�Q�因为p是指向常量的指针�Q�但P本��n可以变化�Q�下面一题据说是��L��数学教程中的�l�典题型�Q�我没有上过�Q�只惛_��深度遍历的方法�?br>
google的魅力就不用词语形容�?从晚上的人气��可见一�?准点赶到教七,却发现门口已�l�被人群�l�赌�?google的工作�h员一个劲地劝大家别进��M��,理由�?��Z��安全":).也好,不用听开复同学的唠叨.回教三的路上,一打打的�h�q�面而来,熟�?zh��n)��?陌生�?本校�?外校�?我彷�?j��ng)到了麦�?�I�梭在朝圣的人流�? 但是念佛(j��ng)的�h�?成佛(j��ng)的却是寥�?晚上肯定有四位数的申误��?不过能有多少人登上幸�q�的快�R�?能突破个位数�?所谓千军万马过独木�?扑ַ��?挺残�?
　　于我,��d��加笔�?更多是一�U�体�?选择google,权当是我对这家伟大的公司的一�Ҏ(gu��)��意吧!
　　在��Y件上,我这��L(f��ng)��水��^,恐怕连菜鸟也谈不上.那么��g�?光学�?我的竞争力在哪里?不能不说,对于扑ַ��?我是有所恐惧�?现在的选择,也许不过是种逃避.
　　昨天,zhengzheng说他改变��L��,准备工作�?一赯��的兄�?又少了一�?今天,simon说在犹��U是否调整甌��的方�?因�ؓ(f��)他想以后�q�是�q�公司的.说�v,5�q�的努力是否值得?未来也许只有上帝知道�?
　　乘着脑子�q�清�?先把�W�试题记�?
　　9个选择�?2个编�E?1个算�?选择�?感觉比较基础,不知里面有没有设地雷?反正没啥印象�?
　　�~�程1,打印二叉�?实现语言不限,先后也不�?
　　�~�程2,�l�定一个字�W�串数组,从中扑և��W�一个只出现一�ơ的字母.
　　��法�?�l�定一个整数数�l?从中切出一个连�l�片�D?保证其元素和最�?求最优算�?分析旉��和空间复杂度.

�?nbsp; �? Google�W�经
发信�? 饮水思源 (2006�q?0�?1�?3:06:04 星期�?, 站内信�g
开章明义，我是个废人，上来�U�攒rp了�?br>在宣讲会(x��)的时候，听旁边的师姐说上��只招两个职位每个职位只招一个�h�?br>现在后�?zh��n)�只选了北京和上��L(f��ng)��SWE了�?br>不过反正……也不指望了。。�?/p>

�W�试题目�Q?道单�?3道问�{?br>旉��Q?00分钟
我做的是B南��?br>单选题�Q?br>1�Q�求两个二进制数的异或��|��基本上学�q�一点计��机的东西的人都能对的题目。�?br>2�Q�不记得了。。也是不需要思考的题目。�?br>3�Q�大概是如下的函敎ͼ�(x��)
int someFunc(int x){
    if (x == 0)
        return 0;
    else
        return x + someFunc(x - 1);
}
问这个计��的是什么。。�?br>4�Q�不记得了。。不需要思考吧。�?br>5�Q�不记得了。。不需要思考吧。�?br>6�Q�参�?�Q?�Q?。�?br>7�Q�似乎需要思考一下。�?br>8�Q�问链表�l�构和数�l�相比的优势不包括哪��，
包括�Q?br>插入的时�?br>删除的时�?br>存储�I�间
剩下两个不记得了。�?br>9�Q�如下函敎ͼ�(x��)
T(x) = 1 (x <= 1)
T(n) = 25 T(n/5) + n^2
问T(n)随n的增�ѝ�?br>选项大概是这��L(f��ng)��Q?br>O(n^2)�Q�O(n^2logn)�{�等的。�?br>
问答�Q?br>1�Q�写两个N*N的矩�늚�乘法�Q�给��Z��C的格式，你可以选择你喜�Ƣ的语言��d��。�?br>int* multi(int* a1, int* a2, int N){
}
2�Q�寻找一个单向链表的中项�Q�如果存在两个则�q�回前一个。给��Z��C的格式，同样你可
以选择。。。�?br>struct {
    Node* next;
    int value;
} Node;
Node* someFunc(Node* head){
}
3�Q�给一个长度�ؓ(f��)n的整数数�l�，只允许用乘法不允许用除法�Q�计��Q�?n-1)个数的组�?br>乘积中最大的一�l�。。。写出算法的时空复杂度�?br>ps�Q�怀疑这道题目出错啦。。虽然我也做错了。。。。。�?br>

一些补充：(x��)
1�Q�问�{�的�W�一题是google上学�?intern的大题原题；
2�Q�google很喜�Ƣ考链表，无论intern的面试以�?qi��ng)两�ơ的�W�试都有�q�样的题目；
3�Q�google一般大题第三道都是写算法的时空复杂度；
4�Q�选择题基本上偏简单，但是要做得准��率高似乎�ƈ不那么容易；
5�Q�根据传�a��Q�小道消息，��Z��亦云以及(qi��ng)以讹传讹�Q�google的高速审��h��{�来源于审卷�?br>以选择题�ؓ(f��)主，如果你全对啦�Q�那么恭喜你pass啦；如果你错了好几道�Q�那么下�ơ努�?br>吧，如果�q�有下次。。。大题基本是做参考的。。�?br>6�Q�选择题很多记不清了，因�ؓ(f��)一遍做下来的，回去随便扫了两眼。。。加上过了这几个
��时�Q�记不得了。希望大家补充修正以�?qi��ng)修攏V��。�?br>7�Q�google�?x��)�?1号开�?天内发面试通知�Q�据��道消息�{�等�Q�有四轮面试。bless大家~~

google brainy test/exam ��是��传甚广的传说中的google �?1�?GLAT 考试了�?br>　　10月底�Q�Google在美国《麻省技术评论》、《LinuxJournal》、《Mensa》、《今日物理》等几本专业杂志上，刊登了一�?Google实验室能力們֐��试"�?br>　　试卷开��_(d��)��蛊惑地写着"试试看！把答案寄回Google�Q�你有希望去Google总部参观�Q��ƈ成�ؓ(f��)我们其中一�?�?br>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�?br>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 ABC, how would you use only
a compass and straight edge to find a point P
such that s 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 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.

Google惯用“整蛊�?#8221;
　　Google上一轮招聘，今年夏天刚结束�?
　　用的也是一�?#8220;�U�学�ȝ��”看不懂的“整蛊�?#8221;�Q�而且�Q�堂而皇之挂在硅谷各大地铁站上�?月底�Q?�?5�c�长的米色广告牌上，��单单��L(f��ng)��“�Q�在‘e’的数列中所能找到的�W�一个十位数质数�Q?com”�Q�没有公司名也没有�Q何广告词�?
　　�׃��几秒钟，路�h才明白，�q�是一道数学题。自然常数e�Q?.718281828……�Q�的�W�一个十位数质数�Q�是目标�|�站的名字�?
　　好奇分子忍不住用Google搜烦��L(f��ng)��案来�Q�压根儿不晓得这��是Google出的“��骨�?#8221;考题�?
　　不少人后来在规定旉��内，��d��上了www.7427466391.com。然而，那不是梦寐以求的�l�点站，Google恶作剧似的，�?#8220;高手”们在半山腰设了个休息的小凉亭�?
　　www.7427466391.com里，贴出一条更令�h头疼的数学问题，�{�出�q�个问题�Q�能得到�q�入下一个网��늚�密码�?
　　跑完数学“马拉�?#8221;�Q?500�?#8220;�q�存�?#8221;走入Google实验室网��，成功投出��历。最后，Google只要�?0个�h�?#8220;光以�q�告而论�Q�Google也算得上高段�Q?#8221;
　　波士��一家广告公司的高��副总裁弗里�?#183;库恩分析�Q?#8220;目标人群看到�q�告后会(x��)惻I��‘�q�是我的语言�Q�那是冲着我来�?#8217;�Q�对其他��言�Q�广告也使Google的�Ş象大大提升。他们可能会(x��)惻I��‘我是得不到这份工作的了。不�q�，在那儿工作的人真聪明’�?#8221;
　　Google��试考的��是脑筋
　　·试着证明WWWDOT-GOOGLE=DOTCOM·用俳句（一�U�日本短诗，每句有一个与季节有关的词�Q�来描述各种模型�Q�借此预测�|�络搜烦��量的季节性变化�?
　　·你落入一个迷宫，回旋不断的走廊。手里有一台堆满灰��的手提�?sh��)脑�Q�可以无�U�上�|�。周��_(d��)��许多无生命的侏儒徘徊走动。这�U�情况下�Q�你�?x��)如何做�Q?
　　A)无目的地徘徊�Q�不停走入死胡同�Q�然后被�q�宫里面的妖怪吃掉�?
　　B)用手提电(sh��)脑当铲子�Q�打�I�地板直接进入游戏下一兟�?
　　C)玩网�l�游戏《魔法奇��c(di��n)��，直到甉|��耗尽�?
　　D)利用计算机，扑ֈ��q�宫的节点，发现准确��\�?
　　E)把你的简历寄�l�Google�Q�告诉迷宫里领头的妖怪，你要退出游戏。然后，发现你回��C��现实世界�?
　　·Unix有什么问题？你会(x��)如何补救它？
　　·你在Google工作的第一天，发现你同寝室的室友，曑ֆ��q�一本书。你研究生一�q��Ӟ��q�本书是你最重要的参考资料。你�?x��)�?x��)A)求他帮你�{�个名。B)不改坐姿�Q�却放轻打字声音�Q�尽量避免媄响他�?
　　C)把你每天吃的麦片和咖啡，留给他吃�?
　　D)引用他那本书中间�Q�你最喜欢的程式，告诉他这则方�E�给了你多少启发�?
　　E)让他看看�Q�你可以用不�?4句语句，完成一个高隑ֺ��E�序�?
　　·以下哪个最好地表达了Google的企业文化？
　　A)“我感觉挺�q�运”
　　B)“别干坏事”
　　C)“哦，我已�l�完成了��d��”
　　D)“你��n�?0�c�以内，必定能找到食�?#8221;
　　E)以上皆是·�?�Ƨ姆的电(sh��)阻，�l�成无限大的放行炚w��Q�问“象棋跳马�?#8221;�Q?#8220;�?#8221;字对角点�Q�两点之间的�?sh��)阻是多��?
　　·下午2点，旧金��p��名的湑֌�。你可以选择去阳光�v岸、国家公园的�U�杉林里徒步旅行�Q�或者参观城�?
里的文化景观。你�?x��)怎么做？
　　·搜烦技术的下一个革命性突破是什么？
　　·一个技术研�I�小�l�的最优化人员�l�合是几个�h�Q�一旦超�q�这个数字，每增加一个研�I�员�Q��^均生产力��׃��(x��)相应下降�Q�A)1B)3C)5D)11E)24·三角形ABC�Q�用圆规和尺�Q�找出点P�Q�保证三角�ŞABP、ACP和BCP周长相等�?
　　·你写�q�最��L(f��ng)��E�序是什么？
　　·扑և�此数列的下一�?10,9,60,90,70,66?A)96B)10�?00�ơ方C)A或者BD)以上皆否·用少�?9个词�Q�描�q�C��能带�l�Google实验室的贡献�?

今年10月底�Q�Google在美国《麻省技术评论》、《LinuxJournal》、《Mensa
》、《今日物理》等几本专业杂志上刊��M��一�?#8220;Google实验室能力們֐��试”�?br>试卷�Q�开头蛊惑地写着“试试看！把答案寄回Google�Q�你有希望去Google总部参观
�Q��ƈ成�ؓ(f��)我们其中一�?#8221;。有兴趣的�h可以做完了邮寄给Google公司�Q�也�怼�(x��)得到
一个工作机�?x��)呢�?br>　　1、解�{�下面的隐藏�{�式�Q�其中的M和E的值可以互换，但不允许�W�一位是0�Q?br>　　WWWDOT - GOOGLE = DOTCOM
　　2、用一个俳�?一�U�日本短诗，每句有一个与季节有关的词)来徏立模型，�?br>此预��网�l�搜索流量的季节性变化；
　　3�?br>　　1
　　1 1
　　2 1
　　1 2 1 1
　　1 1 1 2 2 1
　　下一行是什么？
　　4、你正处于一个全部由崎岖��\构成的迷宫里�Q�手里有一个满是灰��的�W�记
本，可以无线上网�Q�但是信号很弱。与此同�Ӟ��一些阴��可怕、毫无生气的妖怪在
你��n�Ҏ(gu��)��荡。你�?x��)怎么做呢�Q?br>　　(1)毫无目的的四处游荡，到处��壁�Q�直到被�q�宫里的妖怪吃掉�?br>　　(2)用笔记本作�ؓ(f��)挖掘工具�Q�打�I�地面直接进入下一兟�?br>　　(3)玩网�l�游戏《魔法骑��c(di��n)��，直至甉|��耗尽�Q�你也心灰意冗��?br>　　(4)使用�W�记本画��宫的节点地图�Q�找到出路�?br>　　(5)发送简历给Google�Q�告诉主��妖怪你选择退出，随后你就回到现实世界�?br>　　5、Unix有何�~�陷�Q�你准备如何补救�Q?br>　　6、在Google工作的第一天，你发现��n边的同事竟然是研�I�生一�q��课本的作
者，你会(x��)�Q?br>　　(1)��d��C�好�q�烦取签名�?br>　　(2)不改变坐姿，但放��L��字声韻I��避免影响她的工作和思考�?br>　　(3)把你每天的麦片和咖啡都留�l�她享用�?br>　　(4)在她所写的书中扑ֈ�你最喜欢的内容，�q�告诉她�q�些内容已经成�ؓ(f��)你的�?br>右铭�?br>　　7、下列哪句话最贴切的表达了Google的企业文化？
　　(1)我感到很�q�运�?br>　　(2)不要�q�坏事�?br>　　(3)哦，我已�l�解决了那个问题�?br>　　(4)你��n�?0英寸之内�Q�必定能扑ֈ�食物�?br>　　(5)以上皆是�?br>　　8、用3�U�颜色�ؓ(f��)20面体上色�Q�每个面一�U�颜�Ԍ��有多��种�l�合�Q�你�?x��)选择哪些
颜色�Q?br>　　9、下面是故意留出的空白，请将其填满，使之看�v来不那么�I��?br>　　10、用1�Ƨ姆的电(sh��)�ȝ��成无限大的两�l�矩阵，“象棋跳马�?#8221;(“�?#8221;字对角点
)两点之间的电(sh��)��L��多少�Q?br>　　11、现在是星期日下�?点，你正在旧金山著名的湾区。你可以选择��d��家公
园的�U�杉林里徒步旅行�Q�或者参观城市里的文化景观。你�?x��)怎么做？
　　12、你认�ؓ(f��)最��的数学�{�式是什么？
　　13、下列哪个团体没有在Google员工中�Ş成？
　　(1)奛_��球
　　(2)淡黄色爱好�?br>　　(3)Cricketeers
　　(4)��?d��ng)奖获得�?br>　　(5)葡萄酒俱乐部
　　14、搜索技术的下一个革命性突破是什么？
　　15、一个项目组由多��h构成才能辑ֈ�最优规模？也就是说�Q�一旦超�q�这一�?br>字，每增加一个成员项目组的��^均生产力��׃��(x��)相应下降�?br>　　(1)1�?br>　　(2)3�?br>　　(3)5�?br>　　(4)11�?br>　　(5)24�?br>　　16、给你一个三角�ŞABC�Q�请用圆规和��找出点P�Q�保证三角�ŞABP、ACP和BCP
周长相等�?br>　　17、有�q�样一个函敎ͼ�对于��L��整数n�Q�都能返回写�?到n之间出现“1”的个
数。例如，f�Q?3�Q?6。请注意f�Q?�Q?1�Q�那么下一个能实现f�Q�n�Q?n的最大数�?br>是什么？
　　18、你�~�写的最��L(f��ng)��黑客�E�序是什么？
　　19、在下面的数列中�Q�下一个数字是多少�Q?0, 9, 60, 90, 70, 66,?
　　(1)96
　　(2)10�?00�ơ方
　　(3)以上皆是
　　(4)以上皆不�?br>　　20、用��于29个词�Q�描�q�C��能带�l�Google实验室带来的贡献�?天外)
--
“微��Y是个公��^的公司，�q�里几乎没有�Ҏ(gu��)��。盖茨只是这两年才有了自��q��一个停车位�?br>以前他来晚了没地儿，��得自己到处��L��停�R位�?#8221;
“微��Y非常��员工的动手能力。在做新产品发布�Ӟ��盖茨都能自己动手做演�C�。他�?br>是在和工�E�师作搭档，对自��q��产品很熟�(zh��n)�，�q�样�Q��Q何�h都糊弄不了他�?#8221;

1.单项选择�?br>1. 下面一�D�代码的输出是[ ]
void fn( int* b){
    (*b)++;
}
int main(){
    int a=7;
    fn(&a);
cout<return 0;
}
A.0     B.7    C.8    D.undefined
2. 定义int i,j,*p=&i; 那么下面哪条语句可以完成i=j的赋值[ ]
A.i=*p;     B. *p=*&j;    C.i=&j;    D.I=**p;
3. 用二叉搜索树(w��i)和哈希表存储相同的数据集,对于以下何种操作,二叉搜烦�?w��i)比哈希�?/p>

速度更快?[ ]
A.��?nbsp;   B. 插入    C.删除    D.更新    E.排序
4. 包含N个几点和M条边的有向带权图G, 边的权�ؓ(f��)�? 以下操作中不可以在O(N+M)
的时间复杂度内完成的操作�?[ ]
A. 求结点s到结点t之间的最短距��?br>B. 求距��ȝ��点s最�q�的�l�点
C. 已知起始�l�点, 对图G中的�l�点�q�行拓扑排序
D. 求图G的最大强�q�通子�?br>5. 有如下递归函数f(n),其时间复杂度为[ ]
int f(int n){
    if(n==0)
     return 0;
    if(n==1)
     return 1;
    return ( 5*f(n-1) - 6*f(n-2));
}
A.O(n)     B. O(n^2)    C. O(n^3)    D. O(2^n)
6. 下面所�q�步骤中,哪一个不是创建经常所必需有的[ ]
A.��p��度程序�ؓ(f��)�q�程分配CPU       B.建立一个进�E�控制块
C.��E�分配内�?nbsp;                   D.��进�E�控制块铑օ��q�A队列
7. 在多�q�程的系�l�中,��Z��保证公区变量的完整�?各进�E�应互斥�q�入临界区。所谓��(f��)

界区是[ ]
A.一个缓冲区 B.一个数据区 C.一个同步机�?nbsp; D.一�D늨��?br>8. 能��生满��_��下条件语�a�的正则表辑ּ�是：(x��)1.每一个a后至��紧跟两个c; 2.每一个b

后至��紧跟一个c [ ]
A.(acc|bc|c)* B.(acc|bc)* C.(ac|bc)* D.不是正则语言
9. 以下哪项不是RPC�Q�远�E�过�E�调用）的特点[ ]
A.速度�?nbsp; B.降低�pȝ��耦合�?nbsp; C.可以实现异构�pȝ��间的协作
10. 有三个桶�Q�容量分别是3升，5升，7升，你只能进行下面的操作�Q?br>把一个桶中所有的水倒掉�Q?br>把一个桶A中的水倒入桶B�Q�直到桶A�I�Z��或者桶B满了�Q?br>假设一开始容量�ؓ(f��)3升和5升的桶是满的�Q?升的桶是�I�的�Q�希望通过一�p�d��操作�?个桶

中�Q意一个中正好�?升水�Q�那么至��需要[ ]�ơ操作�?br>A.3 B.5 C.7 D.不可�?br>2. �E�序设计与算�?br>2.1 实现如下�~�码��法�Q�对于重�?-9�ơ数的字�W�，用两个数字表�C�，即NX�Q�其中N为重

复的�ơ数�Q�X为重复的字符�Q�下同）�Q�超�q�九(ji��)个则先输�?X�Q�然后处理剩下的字符。对�?/p>

�q�箋的不重复的字�W�，则两边加1来封字符丌Ӏ�如果被��的字符串其中有数字�?�Q�则�?

来�{义�?nbsp; �C�Z��Q?AAAAAABCCCC -> 6A1B14C, 12344 -> 11123124。。。（下面的框

架是用C++语言写的。你可以用你熟�?zh��n)�的语�a�。）
void encode (const char* text, char* dest)
text 为需要编码的字符�Ԍ��dest表示�~�码输出的目标空��_(d��)��而空间��够大
2.2�l�定一颗有n个结点的二叉�?w��i)。求它的所有结�Ҏ(gu��)��为m的连通子图数目。m<=n分析你的

��法的时间复杂度�Q�解释算法即可，不必写代码�?br>

�?
假设有这样一�U�字�W�串�Q�它们的长度不大�?nbsp; 26   �Q�而且若一个这��L(f��ng)��字符串其长度�?nbsp; m   �Q�则�q�个字符串必定由   a,   b,   c   ...   z   中的�?nbsp; m   个字母构成，同时我们保证每个字母出现且仅出现一�ơ。比方说某个字符串长度�ؓ(f��)   5   �Q�那么它一定是�?nbsp; a,   b,   c,   d,   e   �q?nbsp; 5   个字母构成，不会(x��)多一个也不会(x��)��一个。嗯嗯，�q�样一来，一旦长度确定，�q�个字符串中有哪些字母也��q��定了�Q�唯一的区别就是这些字母的前后��序而已�?nbsp;

现在我们用一个由大写字母   A   �?nbsp; B   构成的序列来描述�q�类字符串里各个字母的前后顺序：(x��)

如果字母   b   在字�?nbsp; a   的后面，那么序列的第一个字母就�?nbsp; A   �Q�After�Q�，否则序列的第一个字母就�?nbsp; B   �Q�Before�Q�；
如果字母   c   在字�?nbsp; b   的后面，那么序列的第二个字母��是   A   �Q�否则就�?nbsp; B�Q?nbsp;
如果字母   d   在字�?nbsp; c   的后面，那么   ……   不用多说了吧�Q�直到这个字�W�串的结束�?nbsp;

�q�规则甚是简单，不过有个问题��是同一�?nbsp; AB   序列�Q�可能有多个字符串都与之相符�Q�比方说序列“ABA”�Q�就�?#8220;acdb”�?#8220;cadb”�{�等好几�U�可能性。说的专业一点，�q�一个序列实际上对应了一个字�W�串集合。那么现在问题来了：(x��)�l�你一个这��L(f��ng)��   AB   序列�Q�问你究竟有多少个不同的字符串能够与之相�W�？或者说�q�个序列对应的字�W�串集合有多大？注意�Q�只要求个数�Q�不要求枚�D所有的字符丌Ӏ?nbsp;


嘿嘿�Q�这��是你要解决的问题了。如果不嫌慢的话大可以穷举，不过�q�种解法拿出来那是显然不好意思和人打招呼的。事实上�Q�如果设   AB   序列的长度�ؓ(f��)   n   �Q�那么这个问题是可以做到   O(n^3)   的�?nbsp;

1、有两根不均匀分布的香�Q�香烧完的时间是一个小�Ӟ��你能用什么方法来��定一�D?5分钟的时��_(d��)��
�{�：(x��)2栚w��同时点燃�Q�第一根两头都点燃�Q�第二根只点一��_(d��)�� W�一根点完的时候是半个��时�Q�接着把第二根两头都点燃，�W�二根点完的时候就�?5分钟�?/p>

�Q�、一个经理有三个奛_��Q�三个女儿的�q�龄加�v来等�?3�Q�三个女儿的�q�龄乘�v来等于经理自��q��q�龄�Q�有一个下属已知道�l�理的年龄，但仍不能��定�l�理三个奛_��的年龄，�q�时�l�理说只有一个女儿的头发是黑的，然后�q�个下属��q��道了�l�理三个奛_��的年龄。请问三个女儿的�q�龄分别是多��？��Z��么？

�{�：(x��)2�Q?�Q?�Q?1岁不可能

3、有三个人去住旅馆，住三间房�Q�每一间房$10元，于是他们一�׃��l�老板$30�Q�第二天�Q�老板觉得三间房只需�?25元就够了于是叫小弟退�?5�l�三位客人，谁知��弟贪心,只退回每�?1�Q�自己偷��h��?2�Q�这样一来便�{�于那三位客人每人各�׃��?ji��)元�Q�于是三个�h一��p��?27�Q�再加上��弟独吞了不$2�Q��d��?29。可是当初他们三个�h一�׃��?30那么�q�有$1呢？
�{�：(x��)没错�Q�三个�h付了27块，老板拿了25块，��弟拿了2�?br>�Q�、有两位盲�h�Q�他们都各自��C��两对黑袜和两对白袜，八对袜了的布质、大��完全相同，而每对袜了都有一张商标纸�q�着。两位盲��Z��心?y��u)��八对袜了�؜在一赗��?他们每�h怎样才能取回黑袜和白袜各两对呢？

�{�：(x��)不知道，�q�要仔细��x��
�Q�、有一辆火车以每小�?5公里的速度��d��z�杉矶直奔纽�U�，另一辆火车以每小�?0公里的速度从纽�U�开往�z�杉矶。如果有一只鸟�Q�以30公里每小时的速度和两辆火车同时启动，从洛杉矶出发�Q�碰到另一辆�R后返回，依次在两辆火车来回飞行，直到两辆火�R盔R��Q�请问，�q�只��鸟飞行了多长距��？

�{�：(x��)记好两�R盔R��旉��Q�就是鸟飞行旉��Q�乘以其飞行速度��得到飞行距��R�?/p>

�Q�、你有两个罐子，50个红色弹球，50个蓝色弹球，随机选出一个罐子，随机选取��Z��个弹球放入罐子，怎么�l�红色弹球最大的选中��Z��(x��)�Q�在你的计划中，得到�U�球的准��几率是多少�Q?/p>

�{�：(x��)不知道，�q�要仔细��x��

�Q�、你有四个装药丸的罐子，每个药丸都有一定的重量�Q�被污染的药丸是没被污染的重量＋1.只称量一�ơ，如何判断哪个�|�子的药被污染了�Q?br>�{�：(x��)不知道，�q�要仔细��x��
�Q�、你有一桶果冻，其中有黄�Ԍ��l�色�Q�红色三�U�，闭上眼睛�Q�抓取两个同�U�颜色的果冻。抓取多��个��可以确定你肯定有两个同一颜色的果冻？
�{�：(x��)4

�Q�、对一批编号�ؓ(f��)1�?00�Q�全部开��x��?开)的灯�q�行以下*作：(x��)凡是1的倍数反方向拨一�ơ开养I��2的倍数反方向又拨一�ơ开养I��3的倍数反方向又拨一�ơ开�?#8230;…问：(x��)最后�ؓ(f��)关熄状态的灯的�~�号�?/p>

�{�：(x��)不知道，�q�要仔细��x��

�Q�０、想象你在镜子前�Q�请问，��Z��么镜子中的媄像可以颠倒左叻I��却不能颠倒上下？

�{�：(x��)人的眼睛是左叛_��U�的
�Q�１、一��h开舞会(x��)�Q�每人头上都戴着一��帽子。帽子只有黑白两�U�，黑的臛_��有一��。每个�h都能看到其它人帽子的颜色�Q�却看不到自��q��。主持�h先让大家看看别�h头上戴的是什�q�帽子，然后关灯�Q�如果有��己戴的是黑帽子，��打自己一个耛_��。第一�ơ关灯，没有声音。于是再开灯，大家再看一遍，关灯时仍焉��雀无声。一直到�W�三�ơ关灯，才有劈劈啪啪打耛_��的声韛_��赗��问有多��h戴着黑帽子？
�{�：(x��)3

一、单�?br>1�?0x86中，十进制数-3�?6位二�q�制数表�C�Zؓ(f��)�Q?br>2、假定符�?�?�?分别代表减法、乘法和指数�q�算�Q�且
1)三个�q�算�W�优先��序是：(x��)-最高，*其次�Q?最低；
2)�q�算�W�运��时为左�l�合。请计算3-2*4$1*2$3的��|��(x��)
(A)4096�Q?B)-61�Q?C)64�Q?D)-80�Q?E)512
3、下列伪代码中，参数是引用传递，�l�果是？
calc(double p, double q, double r){q=q-1.0;r=r+p}
main(){
　　double a = 2.5, b = 9.0;
　　calc(b-a, a, a);
　　print(a);
}
(A)1.5 (B)2.5 (C)10.5 (D)8 (E)6.5
4、求输出�l�果�Q?br>int foo(int x, int y){
　　if(x <=0 || y <= 0) return 1;
　　return 3 * foo(x - 1, y / 2);
}
printf("%d\n", foo(3, 5));
(A)81 (B)27 (C)9 (D)3 (E)1
5、下列哪个数据结构在优先队列中被最�q�泛使用�Q?br>(A)�?(B)数组 (C)双向链表 (D)�?(E)向量
6、以下算法描�q�C��一个在n国元素的双向链表中找到第k个元素的�Ҏ(gu��)��Q�k >= 1且k <= n�Q�：(x��)
如果k <= n - k�Q�从链表开始往前进k-1个元素�?br>否则�Q�从�l�点出发�Q�往回走n - k个元素�?br>�q�个��法的时间代��h��Q?br>(A)θ(nlogn) (B)θ(max{k, n - k}) (C)θ(k + (n - k))
(D)θ(max{k, k - n}) (E)θ(min{k, n - k})
7、有一个由10个顶点组成的图，每个��点�?个度�Q�那么这个图有几条边�Q?br>(A)60 (B)30 (C)20 (D)80 (E)90
8、正则表辑ּ�L = x*(x|yx+)。下列哪个字�W�串不符合L
(A)x (B)xyxyx (C)xyx (D)yxx (E)yx
9、�ؓ(f��)��d��一块数据而准备磁盘驱动器的��L��间包�?br>(A)�{�待旉�� (B)寻道旉�� (C)传输旉�� (D)�{�待旉��加寻道时�?br>(E)�{�待旉��加寻道时间加传输旉��
二、算�?br>1、打印出一个二叉树(w��i)的内宏V�?br>2、在一个字�W�串中找到第一个只出现一�ơ的字符。如abaccdeff�Q�输出b�?br>3、给定一个长度�ؓ(f��)N的整数数�l�（元素有正有负�Q�，求所有元素之和，最大的一个子数组。分析算法时�I�复杂度。不必写代码�?/p>

附上动态规划做法的�{�案:
最大子序列
问题�Q?br>�l�定一整数序列A1�Q?A2�Q?.. An �Q�可能有负数�Q�，求A1~An的一个子序列Ai~Aj�Q��得Ai到Aj的和最�?br>例如�Q�整数序�?2, 11, -4, 13, -5, 2, -5, -3, 12, -9的最大子序列的和�?1。对于这个问题，最��单也是最�Ҏ(gu��)��惛_��的那��是�I��D所有子序列的方法。利用三重��@环，依次求出所有子序列的和然后取最大的那个。当然算法复杂度�?x��)达到O (n^3)。显然这�U�方法不是最优的�Q�下面给��Z��个算法复杂度为O(n)的线性算法实玎ͼ��法的来源于Programming Pearls一书。在�l�出�U�性算法之前，先来看一个对�I��D��法�q�行优化的算法，它的��法复杂度�ؓ(f��)O(n^2)。其实这个算法只是对对穷丄��法稍微做了一些修改：(x��)其实子序列的和我们�ƈ不需要每�ơ都重新计算一遍。假设Sum(i, j)是A ... A[j]的和�Q�那么Sum(i, j+1) = Sum(i, j) + A[j+1]。利用这一个递推�Q�我们就可以得到下面�q�个��法�Q?br>int max_sub(int a[],int size)
{
　　int i,j,v,max=a[0];
　　for(i=0;i　　{
　　　　v=0;
　　　　for(j=i;j　　　　{
　　　　　　v=v+a[j];//Sum(i, j+1) = Sum(i, j) + A[j+1]
　　　　　　　　if(v>max)
　　　　　　　　　max=v;
　　　　}
　　}
　　return max;
}
那怎样才能辑ֈ��U�性复杂度呢？�q�里�q�用动态规划的思想。先看一下源代码实现�Q?br>int max_sub2(int a[], int size)
{
　　int i,max=0,temp_sum=0;
　　for(i=0;i　　{
　　　　　　temp_sum+=a;
　　　　　　if(temp_sum>max)
　　　　　　　　max=temp_sum;
　　　　　　else if(temp_sum<0)
　　　　　　　　temp_sum=0;
　　}
　　return max;
}
在这一遍扫描数�l�当中，从左到右记录当前子序列的和temp_sum�Q�若�q�个和不断增加，那么最大子序列的和max也不断增�?不断更新 max)。如果往前扫描中遇到负数�Q�那么当前子序列的和��会(x��)减小。此时temp_sum ��会(x��)��于max�Q�当然max也就不更新。如果temp_sum降到0�Ӟ��说明前面已经扫描的那一�D�就可以抛弃了，�q�时��temp_sum�|��ؓ(f��)0。然后， temp_sum��从后面开始将�q�个子段�q�行分析�Q�若有比当前max大的子段�Q��l�更新max。这样一��扫描结果也��出来了�?nbsp;

Google�W�试是没有门槛的。这栯��是因为Google�Ҏ(gu��)��没有限制�W�试的�h敎ͼ�开了N个教室，让N多�h参加……不过�W�试本��n却有门槛�Q�看了题目就知道�?br>　　本来想上午写写的�Q�但是，嗯，��Z��攒�h品的目的�Q�还是等到现在才写——现在，面试通知已经发过�Q�很昄��我又被无视了……OK�Q�那也不错，我也没怎么准备�q�些东西呢，倒不是说我不重视�Q�而是事情太多……唔，多少��是一�U�经验了�?br>　　回来说说昨天的笔试。题目的量�ƈ不大�Q�除了几个单选题�Q�剩下就是三个编�E�或��法题。单选就不说了，考得比较基础�Q�涉�?qi��ng)C语言常识、数据结构、文法、操作系�l�，主要说说大题�?br>　　大题虽然题型不一�Q�但都有一个重要特点：(x��)考递归。精��点��_(d��)��我每一题都用到了递归�?br>　　�W�一个的题目�Q�嗯�Q�记的不是很完整�Q�：(x��)
在一��（排序�Q�）二叉�?w��i)中搜烦指定��|��数据�l�构定义为（唉唉�Q�数据结构的具体名字都不记得了，my god�Q�：(x��)
struct Node
{
    Node * lnext;
    Node * rnext;
    int value;
};
函数定义为（情况同上�Q�啥都记不清了）�Q?br>Node * search(Node * root, int value)
{
}
实现�q�个search函数�?br>用递归�Q�经典的�?w��i)的遍历�Q�pass先�?br>�W�二个的题目�Q?br>计算Tribonaci队列�Q�嗯�Q�九(ji��)成九(ji��)记错了那个单�?#8230;…�Q�，规则是T(n) = T(n - 1) + T(n - 2) + T(n -3)�Q�其中T(0) = T(1) = 1�Q�T(2) = 2�?br>函数定义�Q?br>int Tribonaci(int n) {
}
备注�Q�不考虑证整数溢出，��可能优化算法�?br>　　�q�一题我一看就知道要考什么，很显然的递归定义�Q�但也是很显然的�Q�这里所谓的优化是指不要重复计算�?br>　　��单的��_(d��)��在计��T(n)的时候要用到T(n - 1)、T(n - 2)和T(n - 3)的结果，在计��T(n - 1)的时候也要用到T(n - 2)和T(n - 3)的结果，所以在各项计算的时候必��L��以前计算的结果记录下来，��L��重复计算。这里用到的一点小技巧就是要新写一个函数用来做�q�种事情�Q�嗯�Q�看看我写的代码吧！
    /**
      Get the value of T(n - 1), and retrieve the result of
      T(n - 2) and T(n - 3).
      @param[in] n The n in T(n).
      @param[out] mid Value of T(n - 2).
      @param[out] right Value of T(n - 3).
      @return Value of T(n - 1).
     */
    int find_trib(int n, int & mid, int & right)
    {
        if (3 == n)
        {
            mid = 1;
            right = 1;
            return 2;
        }
        else
        {
            int temp;
            mid = find_trib(n - 1, right, temp);
            return mid + right + temp;
        }
    }
    /**
      Find value of T(n).
      @param[in] The n in T(n).
      @return Value of T(n).
      @note T(n) = T(n - 1) + T(n - 2) + T(n - 3) (n > 2)
            T(0) = T(1) = 1, T(2) = 2.
     */
    int tribonaci(int n)
    {
        if (n < 0)
        {
            // Undefined feature.
            return 0;
        }
        if (0 == n || 1 == n)
        {
            return 1;
        }
        if (2 == n)
        {
            return 2;
        }
        int mid, right;
        int left = find_trib(n, mid, right);
        return left + mid + right;
    }
　　啊啊�Q�对了，�{�卷的时候我可没心情写注�?#8230;…刚才到VC.Net 2003上测试了一下，貌似没有啥问题。唉�Q�看来我多少�q�是懂一点算法的……
　　�W�三个的题目�Q?br>　　在一个无向图中，��L��是否有一条距��Mؓ(f��)K的�\径，描述��法卛_��Q�不用实玎ͼ�分析��法的时间和�I�间复杂度，��量优化��法�?br>　　OK�Q�这个就是传说中的��Y肋了………………我也��׃��把自��q��{�案写出来了�Q�丢人啊�Q�，虽然后来仔细��x��Q�我那个挫挫的方法也能够�?#8230;…只是效率……
　　That's all.
转蝲��h��明出自应届生求职招聘论坛 http://bbs.yingjiesheng.com/,本脓(chu��ng)地址:http://bbs.yingjiesheng.com/thread-21638-1-1.html

漫步者�?…�?�K?/a> 2010-12-13 22:01 发表评论