background
I graduated in 19 years, with a dual non-master's degree, majoring in software engineering, and 1 year of work experience (bank peripheral system, old and long, no high concurrency scenarios) Java back-end development, no internship experience, byte headhunting through BOSS.
At first, I said that I was rejected by Feishu, and then I was picked up by education.
Stop talking, just look at the face scripture!
one side
Time: 1 hour on July 24
ps: Very basic knowledge points survey, covering basic theoretical knowledge such as IO and network. Database and multithreading will combine personal language and used software framework to ask questions. On the one hand, it is very basic, and basically answered.
The principle of hashmap, the underlying implementation, the reasons for thread insecurity, how to expand, why the size of the underlying array is 2^n, the process of expanding the deadlock (no), the difference between 1.7 and 1.8, the
principle of concurrenthashmap, structure, why thread safety, points How does segment lock realize the
difference between synchronized and lock, do you understand the principle of volatile, the
underlying implementation principle of Lock, and how does AQS implement it?
Redis data types, deletion strategies, persistence schemes, distributed schemes, principles of redis cluster schemes (don't look at the specific architecture content), do you know distributed consistent hash?
IO model: What are the IO models, the principles of select and epoll, and the shortcomings of select (in Java, if you don’t have experience in high-concurrency scenarios, you don’t know much about IO. Basically, I will review the knowledge of multithreading)
OSI Model (five and seven layers)
Introduce tcp and udp
tcp handshake, wave hand
slow start, fast retransmission, fast recovery
time-wait Introduce the
characteristics of
innodb physical structure of innodb index
primary key, return table, covering index
Comparison with MyISAM
Algorithm: the sum of three numbers, time complexity and space complexity are required. At the beginning of the violent triple loop, optimization was later required
Two sides
Time: 1 hour on July 31
ps: Combine the project experience to ask questions, the interviewer will appropriately supplement some basic theoretical knowledge and common framework questions based on the resume and one side of the results. I don’t know much about kafka, and the interviewer may not be satisfied.
Project experience: sub-database and sub-table, how to realize it without the help of middleware, has MyCat known (don’t understand), how to choose sub-database and sub-table? Discuss division rules based on project scenarios.
Other project experience, reflection and annotation principles, have you ever used thread pools? What kinds of Java thread pools are there? The construction parameters of the Java thread pool? What is a blocking queue? What blocking queues does Java have?
What is the process of https establishing a connection?
Do you understand man-in-the-middle attacks and cross-domain attacks?
The difference and connection between process and thread
What happened when the process was switched?
Why is the cost of thread switching less than process switching
? Methods and examples of process communication
The background of kafka and the use of
topics and partitions in the project. What does partition
do and
what does Consumer Group do? How to allocate partitions to multiple brokers? How to dynamically adjust the number of partitions and brokers?
When does rebalance happen, and the rebalance process (I don’t know this)
How is the Linux shell used? Have grep, sed, awk been used? (Only grep...)
How to monitor machine performance?
Do you understand the Linux file system? Soft connection and hard connection?
The matrix rotates 90° clockwise and 90° counterclockwise. Stock trading (several variants have not been solved, but the basics should be fine)
Three sides
Time: 1 hour on August 6
ps: Mainly system design, divergent issues. In addition, the interviewer complained about my resume. It is recommended that the resume be honest and set with templates, not to be fancy, and the programmer’s resume should be neat and clear.
How does Kafka achieve high availability (No, the interviewer is not satisfied, because my work experience does not have high concurrency on the Internet, and Kafka does not look very much)
Design hot list, dynamic display top K
N threads print alternately, how to achieve it, write it out, and run it
Design length address translation
All sides
Basic process, ask the reason for leaving, talk about life, etc.
to sum up
The overall feeling of a beating interview. The interviewer is very professional and requires familiarity with the basic knowledge. You must prepare before the interview and then go to the interview. LeetCode topics should also be brushed. There is not much time left for handwriting algorithms, 3-10 minutes. If you have not written in 3 minutes, you will be asked to explain the idea of solving the problem.
Remember to brush up the questions and prepare before the interview. Do not write on the items on the resume that are unfamiliar. Prepare 2-3 technical solutions for the items on the resume.
Share some interview questions and learning documents that must be brushed by bytebeat
Algorithm (Friends who have faced bytes know that the algorithm of bytes is the most asked)
Recommend this "Code Interview Guide for Programmers, Best Solutions for IT Famous Companies Algorithms and Data Structure Problems" written by Zuo Shen
The books involve more than 240 questions about algorithm and data structure programming, and the individual has achieved the best solution. Most of the questions are frequently interviewed.
Directory (the algorithm is divided into four levels: general, school, lieutenant, and scholar to indicate the degree of difficulty)
Chapter 1 Stacks and Queues
Design a stack with getMin function (person ★)
A queue consisting of two stacks (Wei★★)
How to reverse a stack with only recursive functions and stack operations (Wei★★)
Cat and dog queue (person ★)
Use one stack to achieve another stack sorting (士★)
Use the stack to solve the Tower of Hanoi problem (school ★ ★ ★)
Generate an array of window maximum values (Wei★★)
Construct an array of MaxTree (School★★★)
Find the size of the largest sub-matrix (school★★★)
The maximum value minus the minimum value is less than or equal to the number of sub-arrays of num (check ★★★)
At last
For the interview with a big factory, I want to emphasize that the mentality is really important. It is the key to determining your performance in the interview process. If you can’t perform normally, it’s likely that you missed the offer because of a small mistake, so you must pay attention to it. stand up. Another reminder, full review is the key to eliminating your nervous state of mind, but if you review enough, you will naturally have more confidence in the interview process.
All the study materials and interview materials in the above content can be provided free of charge. I hope that everyone will have a smooth interview and win your favorite offer!