Junior college students, no internship, no project experience, average grades
One side 3.9: 40min
The difference between HashMap and ConcurrentHashMap
vector，list
C++ polymorphism, virtual function mechanism
Process communication
Process thread differences
TCP three-way handshake and four waved details
Algorithm question: the longest unique string (HashTable, O(N))
The interviewer is very nice, and there are some missing knowledge points that will be pointed out and explained to you, and he is very patient.
3.15 on both sides: 1h
Java polymorphism (see the program and say the result is more complicated, and also examined the override and overwrite)
Binary search tree
B tree b+ tree
Red-black tree deletion algorithm
Use mutex locks to achieve read-write locks, writers take priority
Algorithm question: There are 100 squares, each with poisonous mushrooms and stamina mushrooms. Poisonous mushrooms reduce stamina and stamina mushrooms add stamina. The current stamina is the farthest distance that can be jumped. Please ask if you can jump to the farthest square. If you can, Find the maximum remaining stamina falling on the 100th square
The second-sided interviewer is very serious, and the answer to the question will not affirm or deny you. After listening to your answer, you will directly continue to the next knowledge point. The rhythm is very tight. After the interview, I thought it was cold, but after ten minutes, hr called to inform the three sides, and the three interviewers said that the previous two interviewers had high evaluations. So don’t get discouraged when you meet a serious interviewer, just answer with your heart.
Three sides 3.17:1h
Service method call
RPC/Netty
Serialization/deserialization
1 billion to find Top10000, you need to consider fragmentation, if you use the smallest heap, you need to consider efficient merging
To consider waiting time and priority printers, design data structure to make printing tasks efficient
Twenty-four points
At the beginning of the three sides, the interviewer asked about the time of the internship and the location of the internship. It is guessed that the leader may have a direct interview (I happened to go to the city where the interviewer is in the end). The person is very kind, but the problem is not what I prepared. I still feel a little helpless when encountering the basic question types I have passed.
3.27 Received the offer! After waiting for almost two weeks, I finally got the offer from my heart haha!
In fact, to prepare for byte-beating interviews, you still need to focus on preparing the basic parts (data structure, algorithm, operating system, computer network). In addition, it is very demanding to do algorithmic questions. If you can give this question directly when you see the question The best time and space complexity solution, the interviewer will give you a high evaluation.
If the basic knowledge is relatively solid, you can look at the interview experience on the Internet, find the knowledge points that you don’t know, and check the missing ones.
I also wish everyone can get your favorite offer!
Talk
First of all congratulations to the readers, let me go to Ao Bing, I am sure, but I have not prepared many of these. I said that school recruitment is more difficult than social recruitment. I really don’t frame you, so boys, really have to prepare well. .
Let me talk about my recent affairs. I have been busy recently. The output frequency of articles is not as good as before, and I have stayed up late lately and it seems that my hair is less. I still control the things that stay up late.
Finally, post a solicitation of opinions. I don’t know what to write. I’m writing a distributed lock. I’ll post it next week. I don’t know the others. You can leave a message to see what you want to see. wrote.
I will stop recording interview videos at the end of the spring recruitment, or do I want to get some skills or some life?
See what you like to watch.