Record my Baidu faces

Baidu's work is really efficient. It's just the first day of the day and it's about to call tomorrow afternoon. In the evening, I had a good night's sleep. I slept well and got up late. I came to the lab and thought about what to prepare. I summed up the above experience and checked the Linux Command grep, find, and later proved that these are really not important. I read multiple threads again. It turns out that this is wise. Next I will look at the string matchingAlgorithmLiu Jing's book is really bad,CodeIt's all wrong. I can't understand it at all. Maybe I'm not calm enough. Let's take a rough look at the general idea of the KMP, BM, and rk algorithms. When the time comes, let's make full use of it. It's a bit dizzy, so I went back to bed.

Sleep until, get up and brush the teeth, then go into battle. 10 minutes earlier, I thought about taking a break. I didn't expect a GG to come up and ask what it is, and then I started.

First, I would like to introduce myself and give a few simple comments. The following is a project. From the beginning to the end, it was a spam thing. GG had a very good brain and asked a lot about it. In the analysis of spam features, he asked how to implement it without a step, I asked about the algorithms and data structures used in programming. Oh, that's all about the time. I can only think about it on the site. Then he asked about efficiency and how to improve it. I guess he didn't understand the process I was talking about, but I always optimized it on a small algorithm, the most depressing thing is finding the largest 10 algorithms in a chain table, which makes it useless for me to optimize the chain table sorting first, so I thought about re-allocating a pointer to each node in an array storage linked list and using heap sorting to generate a maximum value of 10. I didn't expect him to say that he had done so much, isn't it better to look for the biggest one from the linked list for 10 times and vomit blood? I 'd better say that I can only use Hash, but I finally transferred the topic, hash also asked some conflicting solutions and wrote a section.

He finally pulled the Chord protocol to explain the release of the email digest. It's strange to me that the details of some protocols are hard to remember. He seems not familiar with this and does not know whether it is installed or not.

Later, I asked me about my programming skills. I said it was okay. I asked about socket and multithreading. I said it was okay. So I asked some simple knowledge, including socket functions, select, fork, multi-thread, also pulled to the thread pool. For C ++, I asked the role of the private constructor and what the object factory is.

Finally, I got a question, which is depressing.

It is known that a function f can obtain a random number between 1 and 5. To obtain a random number from 1 to 7, the probability of each number must be equal. After thinking for a long time, I failed to think of a probability of equality.

Finally, he said that he could not do it, and it was now.

I feel that this interview is too difficult. Fast from start to end. It makes me have no chance to breathe. There are a lot of errors, and there are tense components in it. This Gg was not smiling. What makes me uncomfortable is that he received text messages several times. Look at your cell phone, AI... Not dedicated.

After returning, Haibo said that this was the last technical interview. Why am I suspended ???

Shit

It's just a trainer. There are still some experiences. I feel that these two interviews are still rewarding. As long as there is no English, I am confident. Especially for algorithms, the first side is quite good, and the second side is completely different from the other side.

Continue to work hard.