Preface
In order to make it easier for students to review the interview, the editor has compiled various interview questions. Each question is selected by the editor and felt that they need to be mastered. This compilation includes Java, operating system, computer network, and database. , algorithm . And I have compiled the answers for everyone! .
Required interview questions (the answer is at the end):
JAVA related
- What is the difference between ArrayList and LinkedList and what scenarios are they suitable for?
- In addition to the chain address method, what other methods do HashMap solve hash conflicts?
- How to safely delete elements in List? Will an error be reported when deleting in a for loop?
- euqals和hashCode
- What is the difference between HashMap and ConcurrentHashMap
- HashMap insert element process
- What is an interface? What are the benefits of using interface
- Does Java have a memory leak
- What is the difference between ArrayList and LinkedList
- What does the volatile keyword do
- The difference between synchronized and reentrantlock
- Have you learned about CAS?
- Multiple threads write to the database at the same time, how to deal with it, if it is distributed multiple threads?
- Several design patterns are used in Spring
- What are the benefits of using the factory model
operating system
- Interprocess communication
- Process and thread difference
- Process scheduling algorithm
- What is a coroutine
- IO multiplexing
- What does an exe file contain
- Virtual Memory
- Zero copy
- The difference between stack and heap
computer network
- Three handshake, four waves
- How does TCP ensure the reliability of communication
- How long to wait for the trigger timeout
- Specifically talk about congestion control
- What is the use of 2MSL of time wait
- What is the problem with too much time wait status
- Have you used Linux? How is the network configured? Talk about DHCP
- What happened after entering the URL
- The difference between HTTP and HTTP
- The difference between Session and Cookie
- The difference between Get and Post
- What protocol is used for ping, specifically ICMP
- The difference between TCP and UDP
- How to solve the sticky package problem
database
- What index used
- Talk about the principle of the leftmost prefix
- The difference between clustered index and non-clustered index
- Data structure used by the index
- The difference between InnoDB and Myisam
- The characteristics of the transaction, what are the isolation levels
algorithm
- Keyword split string
- Top K question
- Determine whether it is a mirrored binary tree
- That the first node chain even bit, odd bit in the node (e.g.,
1 -> 2 -> 3 -> 4 -> 5into2 -> 4 -> 1 -> 3 -> 5) - Step up
- Minimum edit distance
- Judge whether 4 numbers meet 24 points
- An array consisting only of 1, 0, -1, make all 1s at the front of the array, and all -1s at the end of the array (modify on the original array)
- Reverse linked list
- Why is the time complexity of binary search log2nlog_2nlog2n and how to calculate it
- The combined arrays can be combined, such as
[[1, 2], [4, 6], [5, 8]]merged[[1, 2], [4, 8]] - Determine whether the number of int32 is a palindrome (1. Consider negative numbers; 2. Consider overflow issues)
- How many times does k appear in 1～n (n is a positive integer, k is [0, 9]) (two types of questions, such as question type 1:55 in 5 only counts once; question type 2:55 in 5 Appeared 2 times)
to sum up
The editor actually feels that strength and luck are at odds during the interview.
An interview does not mean much, but how much you missed and filled in this interview and how much your psychological quality has improved will affect your next interview. To borrow a sentence from Borges: "Life is miserable, and I set off again with my broken pulp."
The editor also sorted out the interview questions and answers of the big guys: click here to get it for free, the code: CSDN , there are more interview topics and videos from big factories!
It is not easy to write an article. If it is helpful, please pay attention and support the editor. You are also welcome to ask questions, thanks! ! !
