ByteDance back-end internship interview experience
Since I participated in the byte camp during the summer vacation, the interview started from two sides. By the way, the interview at the byte camp can be found on the Internet. (Byte camp experience is very good)
One side (byte camp)
- Self introduction
- The difference between process and thread
- What does the operating system do when a process is created?
- Kernel mode and user mode
- Take QQ as an example, how to design processes and threads
- Ways of process communication
- Which communication method is the fastest? why?
- The difference between new and malloc
- The difference between malloc and realloc
- C++ polymorphism
- Virtual function table
- The realization of C++ lock
- C++ defines an array of function values
- Use a macro to define a maximum value
- Algorithm question 1: There are three color balls of red, yellow and white. It is required to put all the red balls on the left, the yellow ones in the middle, and the white ones at the end.
- Algorithm question 2: Given a set of line segments, find the total length covered by these line segments
Two sides
- Self introduction
- Talk about the project
- Talking about kafka, how do we design topics?
- Why use websocket?
- What did you do after entering the url? What happens if the visit is under a router?
- http status code
- The understanding of tcp/ip, which layer tcp is in, and which layer ip is in
- TCP header information
- The process of three-way handshake, four waves of the wait state of the client
- What are tcp congestion control methods
- Understanding of https
- Understanding of mysql indexes, constricted clustered index and non-clustered index
- Understanding hash, what is the difference between independent chain method and square detection method
- How to delete an element in hash
- Consistent hash
- Talk about those sorts, time complexity, and stability
- Talk about the understanding of docker, the difference between docker and virtual machine?
- What are the commonly used commands under Linux?
- Algorithm question 1: m houses, each house can be painted with n kinds of colors, and the color cannot be the same as that of the adjacent houses. Give each house the cost of painting each color and find the minimum cost
- Algorithm question 2: Each node has its predecessor, find a feasible order for traversing all nodes