A certain older programmer was angry at the byte interviewer, and he was confused after he learned the truth

 

This is from my friends at the end of the interview with BYTE, I picked out a particularly typical poor boy who had twice interviewed by BYTE; based on his experience, I wrote this article for your reference!

The algorithm still needs to be practiced. Crawl directly without writing the byte test

one side

Duration (1h07m)

1. The difference between Integer and int, when to use Integer and when to use int in normal programming?
2. new Integer(1); Will it be fetched from the cache?
3. Why can only use Integer but not int in List?
4. int i = 1; Such basic types may exist in which areas of the jvm?
5. How does jvm determine that an object can be recycled?
6. How does the jvm judge that the object is dead, what is the judgment process of the two methods, and which is more efficient?
7. What are the objects of GCRoots? Why can objects in the local method stack be used as GCRoots and how can they be connected to Java objects?
8. What is the difference between mysql's primary key index and non-primary key index?
9. If a SQL statement is executed very slowly, how to optimize it?
10. Why use b+ tree?
11. Write a question. Given an array [1,2,3] and a value x, the numbers can be selected repeatedly, and all the results whose sum is equal to x are output.
12. Introduce the spike system, what is stored in mysql? What is stored in redis? Why does rocketmq use it?
13. Does it place an order with one request?
14. If two users log in on two different machines for a spike, can the user place an order for the same product twice at the same time?
15. Rhetorical question

Two sides (cool)

Duration (1h05m)

1. Asked about the project, talk about the rpc architecture
2. What if the service provider has a node down?
3. How does the service caller know that the service is unavailable?
4. How to achieve similar local call?
5. Can your rpc support multiple languages?
6. Introduce NIO
7. The role of Channel in NIO
8. Explained by cap, what is p?
9. zk's distributed algorithm zab
10. What if the zxid is the same during the election?
11. Why doesn't mysql use hash index?
12. Why not use binary trees and binary balanced trees?
13. Do you know the matching principle of the index?
14. Does Eulerto know? do not know
15. Algorithm problem: the length of the longest ascending subsequence.

 

Fish

One side (cool)

The interviewer is a young lady, and the interview experience is pretty good. I mainly asked about the project, but the question was not written. . .

1. Under the introduction of knowledge navigation platform.
2. What is the attention mechanism?
3. What issues need to be considered for the spike system?
4. How is the spike gate realized?
5. Why can Redis guarantee thread safety?
6. What if there are multiple clusters?
7. How to solve if multiple threads read your inventory data at the same time?
8. Why use locks instead of CAS when there are many threads?
9. How does Netty's zero copy work?
10. Writing title: Given the first-order traversal sequence of a binary tree, output its middle-order traversal sequence. For example, first order; ABC##D#E###, output middle order CBDEA. # Indicates an empty node, no # is required for mid-order output.

(Not written out...)

 

Share with my friends some of the interview questions, interview experience, and study notes I summarized this year;

Friends in need can add my Vx assistant to get it 100% for free after "one-click three-link support editor"!

 

 

 

In addition, I recommend a series of advanced Java books to share for free for a limited time

This is this Java Master's Manual, a total of five books, full of dry goods~ It is recommended to max out~

 

 

 

 

 

method of obtaining: