2021 Byte Beat three-sided sharing;

one side

  1. Let me introduce myself first. Since I am familiar with GC on my resume, the interviewer came up and asked me to talk about GC first.
    When I was asked this for the first time, I didn’t know how to start. After hesitating for tens of seconds, I explained the main content that I remembered from the beginning to the end, and then said, "I only know about this"... the interviewer got it. After I said, let me go, sweating~
  2. Learned the operating system, talked about the semaphore, how to access the semaphore (I always thought that I didn’t understand what he meant at the time, I thought I had to ask about the hardware mutual exclusion mechanism of the operating system, and then I understood that I would ask about PV operation), and how to operate the PV.
  3. What are the persistence mechanisms of Redis? How does Redis perform snapshots? When the snapshot is about to end, a write operation occurs. Will the data of the write operation be saved to the snapshot? (I answer no, the data of the snapshot is all the data at the moment when the snapshot is started)
  4. The time complexity of the B+ tree, why is it log(N) (I didn’t know how to answer at the time, I just said it nonsense), the process of querying data on the B+ tree

Algorithm question :

  1. Rotate and print M*N two-dimensional array (fast pass)

Two sides

  1. I didn’t let me introduce myself, so I asked the project directly, what I learned in the project, and then I babababa...
  2. Talk about the working process of RPC
  3. 5 kinds of load balancing algorithms of nginx (I forgot at the time, I just said the load balancing algorithm implemented in my project)
  4. What are the process communication methods? Which one is the fastest?
  5. The difference between get and post requests (I haven't asked this question for a long time, only the difference between the functions and parameters of the two methods)

Algorithm question :

  1. Poisonous mushrooms (two questions, one is greedy, the other is dynamic programming)
    was a bit dumb at the time. The interviewer asked me to talk about my ideas. I thought about it for a long time and didn't have a clue. I changed a question at the interviewer's reminder and thought about it after the interview. For that question, I think it’s not difficult to come up with the first question, but after thinking about it for a long time, I’m not sure if it’s right
  2. Realizing the double sqrt() function
    I was a little flustered, my mind was out of state, and I wrote the second question for a long time, but fortunately, I adjusted it at the end.

At that time, I thought it might be gone, but HR informed me next Monday, I was thankful

Three sides

It should be the leader. He speaks very mildly. When I don't understand the problem, I will patiently try to change the way to guide me. He is one of the nicest interviewers I have ever met.

  1. Let me introduce myself first, and then let me talk about how to learn a new technology. I talked a lot, and then he helped me to summarize it into a few sentences, which made me feel that I should learn how to be concise and concise in the future ==
  2. Talk about the different points of several serialization methods in the project
  3. Why is serialization required? (Because the bottom layer of the network transmits bit streams)
  4. Talk about why sticky bags happen?
  5. Why does packet loss occur in the network? (The received packet is checked incorrectly, the packet exceeds the maximum survival time in the network, and the router will discard the excess packets after the number of packets received by the router reaches the upper limit)
  6. Why does the network freeze phenomenon occur? (Network congestion) Why is TCP reliable?

Algorithm question :

  1. Find the number of the largest and smallest pairs of the array

Interview summary:

1. Multi-brushing

Summarizing the successful experience of others, there is a great chance that you will encounter the same interview questions!

2. Algorithms are the top priority. Now small and medium factories are beginning to take a fancy to algorithms, not to mention big heads like Toutiao. I recommend that friends learn Zuo Chengyun's algorithm, which is easy to understand. Very nice, share the PDF of Mr. Zuo Chengyun, they are all frequently interviewed questions, and it saves everyone from suffering from the algorithm.

 

 

And interview information:

1000 Java Engineer Interview Questions + Answer PDF with a total of 485 pages, covering almost all the test sites for Java interviews, it is not too fragrant!

 

 

If you need the complete PDF version of the book, you can add the assistant vx: bjmsb10 to get

Guess you like

Origin blog.csdn.net/javachengzi/article/details/112723923