Xiaomi written interview 2015

Let's start with the writing test, I don't know the specific question.

1. Hash table

2, and search set

3, priority queue-based breadth-first search

Compare biased algorithms with data structures

Side:

1. A map contains data similar to the following:

Key value

"A" "AFASFWAEQWFWA (b) Eqwgewgrqgq"

"B" "Frgwegqgg (c) FQF (d) DQF"

"C" "FQFGRFWGRW"

"D" "GWRGWERGQWG"

Now write a function that replaces "(c)" and "(d)" in value "B" with the value "C" and "D" respectively, and then replaces "(b)" In Value of "a" with value of "B". Note: The above map is just one example, and the actual situation may be more complex.

Two sides

1. Give 2 unordered array a B

For any one b[i] find the nearest value in a

Use two or three or two points to judge a variety of situations

2. Give a binary tree containing data find the k element in the order of the sequence traversal

Solution: (1) Direct identification of the sequence traversal (recursive non-recursive) can be optimized

(2) numbering using the order of two-fork sort tree node traversal

(3) The interviewer reminds you that you can do it through the data field of the node (LOGN)

3, discussed the knowledge of C + +

Prohibit a class from being inherited using virtual inheritance with friends can be done

Using C to achieve polymorphism

Three sides

1, the chain list of a variety of classic problem judgment ring intersection node, etc.

2. Various usages of const

3, an irregular polygon to determine whether a point is within the polygon or outside

4. Operating system thread state diagram thread process differences virtual memory CPU scheduling cache replacement algorithm, etc.

5, the computer network OSI TCP/IP three handshake four times handshake asked very fine four times why is four times not three times three times why not two times

Too many things to ask ... Can only remember these .... The interviewer has a question bank--

Xiaomi written test interview