Small discussion on algorithm questions in the written test interview

Pascal's father, N. Wirth's grandfather once said:

Taita is tearing up and pulling + brother tired and dead mother = aunt Lulu
Translate: Data Structure + algorithm = Program

The old man is worthy of being the old man. He has always said so well.

First declare

1. I have never worked on ACM/ICPC (I do not know this term to search for it, and I am always very green about it)
Because I was addicted to World of Warcraft at the best time (second, third, and third), and finally I got a ticket for World of Warcraft at the soft court.
I think it is not a good deal to win a championship. So, if you want to avoid playing games, try not to play games.

2. I have never studied algorithms. I will use the master theorem at most to guess the complexity and understand the complexity of some algorithms.
The probability of miscellaneous proves that I do not even understand it even in winter and winter like the NPC or the Turing machine. Therefore, in the traditional
The significance of algorithm learning is just a layman, But nothing. It is enough to be able to mix the written test interview.
Don't learn me.

3. All the algorithm knowledge only comes from Lily algorithm edition, Introduction to algorithms, and other classics.

Therefore, the data structure algorithms I have discussed are all based on what I have come up with in my written test interview and interview.
Experience, I personally think it is more practical.

Let's talk about the features of algorithm questions in IT job hunting:
Unless it is msra, a dedicated research group for ibm crl should recruit specialized talents in the algorithm field,
Generally, your algorithm questions are short and concise, with no strong background or comparison.
It is easy to abstract into a question that is close to the classic question (a bit difficult, right? Read it slowly)

The following is an introduction to algorithms, CLRS, DP for dynamic planning, and Bs for binary search.

Here are some questions I have personally experienced. Let's take a look:

Microstrategy written test: finding the path (classic question, on the book)

2006 Google autumn written examination:
One of the multiple choice questions of feinai.com (which is nice to hear, haha) is very simple.
Calculate the median of two sorted arrays (CLRS exercises 9.3-8 original question, not made)

2007 Google spring test:
A complexity analysis similar to the question of feber, multiple choice questions can also be considered a small problem of DP (PASS)

There is no Algorithm for processing a string, that is, the pass)
A tree-like DP problem (clrs dp is followed by a tree-like DP problem. It will be done after reading it, pass)

I have posted this set of exam questions on the algorithm version. You can search for the questions.

2007 Google spring interview: (despite signing the confidentiality agreement, the questions are too weak)
Polynomial merge (PASS)
Count the five words that appear frequently in an article (test hash and pass)

2007 EMC test:
A trigger probability question (calculate it by yourself, push it, pass)
There is no Algorithm for filling the circle. You just need to consider the boundary (PASS)
The last row writes recursive questions (the school edition has discussed a good question, but I didn't do it)

2007 EMC interview:
Only the pointer pointing to the current node. The node has no link header. Delete this node.
(The solution is a little tricky, that is, to test the content of his next node, delete the next one, pass)
In an English sentence, replace all the words in it (the original questions in the interview book, no questions, pass)

Well, I 've read it all over again. Oh, there's no hard stuff.
So far, I have seen that it is difficult to implement it. It seems that audodesk is one of them, and the linked list is also one of Microsoft's problems.
Classic questions. Google has a question about throwing eggs upstairs.
(See the blog of the adapter ).

The above are some practical experiences, some from textbooks, some from accumulation, and some from flexibility.

Therefore, first familiarize yourself with your data structure book.
Quick Sort, Heap Sort, binary search, hash, aVL., B tree, and so on.
The probability is the highest. If none of these are the same, you cannot guarantee others.

After learning this, let's take a look at the introduction to algorithms (English version) and learn how to express it in English (as I mentioned earlier)
Second, the introduction to algorithms is easy to understand and suitable for all ages. Third, many questions come from them directly.
(Especially Google's question, Googler is really lazy. I have seen no less than 6 questions discussed by others in shuimu.
Since problem, I once put the answer to one of the questions I have read into it, and I have been admired for a long time,
Haha, I smile falsely)

For more information about algorithms, see Chapter 1 ~ 16, 22, 32

Key chapters (the following exercise and problem should be well considered, understood, and digested !!!!)

4. recurrences: N questions have been tested, and I have answered them.
Master theorem, prove that you don't have to look at it, how to use it or look at it more.

5 probabilistic analysis and randomized Algorithms
Considering the probability knowledge of Appendix C, more and more probability questions have been taken over the past few years.

6, 7 heapsort, quick sort, two of the most classic sort algorithm, have been tested countless times

8 sorting in linear time
Counting sort, which is frequently used in sort & search for large-scale data,
If you meet any search department, you must take a look at this.

9 medians and Order Statistics
The most classic linear time for finding the median of an array has been asked countless times
There is a red-blue water bottle matching problem in the exercises below. It is a classic variant and has been tested by Google.

15 Dynamic Programming
The most handsome Algorithm Design Strategy, the classic LCS, was the first time she saw me crying,
As a classic problem in string processing, it has been tested countless times;
The edit distance and beautiful print questions are also very good.
This chapter shows you through, the questions are done through, and you can basically deal with the DP in the written test interview.
Dijiskara is also a classic application of DP in graph algorithms.

16 greedy Algorithms
For more information about the classic backpack, see the 0/1 backpack and non-0/1 backpack.
Let's look at the Kruskal's algorithm of the Minimum Spanning Tree in chapter 23, a typical greedy application.

32 String Match
I haven't looked at it yet, but now, if you want to go to his home
I think we should look at it more.

I have written so much about it. Does MIT press charge me some publicity fees :)

The homepage of Lily algorithm edition has a uctor's mannual, which provides standard answers to many questions.
However, the proof of mathematics or correctness often takes a long time. Out of a utilitarian attitude, we can
Skip the part and do not read it.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

After drinking for three or two hundred years in the evening, I am a little dizzy now.
Now, let's take a look at this.

After writing English and algorithms, I have also completed a great job. Let alone an mile stone.

Let's take a look at it first. If it can help you, I'm so happy.
I'm more happy than being called by 100 beautiful women, haha.

I have no need to ask for it. Let's continue with it based on the changes in the situation.

Wish all you guys do a cool, beautiful, fascinating, incredible, unbelievable,
Brilliant, splendid, terrifle IC, magnificant, fabulous, marvelous
The word is poor. More importantly, I cannot breathe myself.) job in your 2007 job hunting battle.

Apply the following sentence to the Princess of moon:

Warriors of Se, assemble!