Preface
ByteDance continues to make efforts in the fields of graphics, video, Q&A, and pictures. The product matrix includes today’s headlines, Douyin short video, watermelon video, understand the car, GoGoKid English, Pippi Shrimp, Faceu, Facial Camera And many other products, as well as new businesses such as AI education products and enterprise SaaS. As of January 2020, the number of daily active users of Douyin has exceeded 400 million, and the total MAU (monthly active users) of Bytedance's products has exceeded 1.5 billion!
The article is a bit long, please read it patiently, it is definitely rewarding! I don’t want to hear my BB go directly to the interview
Byte beating side
1. Introduce yourself, talk about the project, here is quite conventional, start from the project.
2. How much do you feel better than you at the undergraduate level, and what are your progress
3. What is the biggest improvement during graduate school
4. Which direction do you think you are suitable for?
5. Is there any improvement in the algorithm?
6. How to communicate between multiple threads?
7. How is it deployed?
8. Unet structure, why down-sampling and up-sampling?
9. Hand tear code 1) Give a number N, k, one of two operations can be performed in each round
10. Split all numbers into two smaller numbers
11. All the numbers-1 It is known that the split operation can only be performed k times. Ask at least how many times are required to eliminate all the numbers
2) Give a series of numbers, this series of numbers has positive and negative, but the total is 0. Each number xi represents a village, positive means the village wants to sell xi shares of fruit, and negative means want to buy xi shares of fruit. The distance between two neighboring villages is the same, and the freight for a piece of fruit per unit distance is the same, and each piece is k. Ask, what is the minimum delivery fee required to meet the needs and supply of each village?
Byte beating
1. Tell me about the main jvm parameters you know
2. Which parameter in JVM is used to control the thread stack size
3. There are several ways to write multi-threaded programs
4. What is a thread local variable
5. What is false sharing in a multithreaded environment
6. What are the similarities and differences between synchronous and asynchronous, and when should they be used? for example
7. Explain the following terms: reordering, spin lock, biased lock, lightweight lock, reentrant lock, fair lock, unfair lock, optimistic lock, pessimistic lock
8. The difference between TCP and UDP and Java implementation
9. There are three threads T1, T2, T3, how to ensure that they are executed in order? How to ensure that T2 is executed after T1 is executed, and T3 is executed after T2 is executed
10. Can random numbers be used in hashcode()?
11.short s1 = 1; s1 = s1 + 1; what's wrong?
Byte beating on three sides
1. A data is incremented and then decremented to find out the number of unique arrays, such as [1, 3, 9, 1], the result is 3, no extra space can be used, complexity o(n)
2. Find the longest continuously increasing sequence of the array, such as: 4, 200, 3, 1, 100, 2. The result is 1 2 3 4, which means that the order can be disrupted. (Leetcode 128)
3. Do you know the LRU algorithm and how to implement it?
4. Thinking question: 64 horses, 8 tracks, how many times do you need to race the fastest 4 horses?
5. Red-black tree, B+ tree, jump table application scenarios
6. The college entrance examination scores 20 million data, scores 0-750, how to quickly know your ranking, how to know the ranking of any score —> Bucket sort
7. Probability: Two people take turns toss a coin, the first toss to the head wins, and the one who toss first wins
8. There is a recording microphone in a conference room. There are n people rushing to talk. The microphone can only record the person with the loudest voice. Given each person's start speaking time s, ending speaking time t, speaking volume vol, then Find the last recorded sound sequence of this Mai. Data range: n 2e5. s,t,vol 1e9
9. Two linked lists may intersect, find the intersecting nodes and give proof
10. A large file is split into N small files, and each small file is numbered from 0 to N-1, and the corresponding size is denoted as S(i). Given that the disk space is C, try to implement a function to continuously select several files from N files and copy them to the disk, so that the remaining disk space is the smallest.
Byte beating on all sides
1. What new features does Java 9 bring
2. Have you dealt with online issues? How to deal with memory leaks, high CPU utilization, and unresponsive applications
3. Explain what is called AOP (Aspect Oriented Programming)
4. What do you know about Spring Boot?
5. What problems does Spring Cloud solve?
6. What are the advantages and disadvantages of the microservice architecture?
7. Briefly talk about the greedy algorithm?
8. There is a table in the coordinate system, four corner coordinates: (0,0), (0,4), (2,4), (2,0), a ball is at (1,1), may I ask From what angles can it be shot into the hole (infinite collisions)?
9. Tell me about the design patterns you know, talk about the design patterns used in the project, talk about the strategy pattern, design a chess scene and ask how to combine the design patterns, when are the design patterns inherited, and when are they commissioned?
10. Find the number of nodes in a complete binary tree, less than O(n), and analyze the complexity
11. Probability: 54 playing cards are divided into 3 evenly, and the probability that the big and small are in one?
12. An unordered array, find the first missing number from small to large, such as [8 2 4 3 6 9 7 11 12], the first missing is 5
13. B+ tree and red-black tree, red-black tree and general balanced binary tree, the process and efficiency of adding, deleting, modifying and checking, and time complexity
Byte beating five sides
1. Self-introduction, project type.
2. Why choose Bytedance?
3. How to plan your life?
4. Please briefly introduce your own growth process.
5. What is the biggest difficulty encountered? How to overcome?
6. What is the future plan?
Having said so much, I will share with you my Java core interview book and algorithm brushing information. Friends in need can click here to get it for free~
1000 Internet Java Engineer Interview Questions
One is technical dry goods "Java core knowledge points finishing"
Interview Book "Internet Java Engineer Interview Questions"
Forward + follow, reply [666] by private message to get free collection.
"Programmer Code Interview Guide"
The necessary algorithm book for Byte Beat, contains all kinds of first-line Internet companies' algorithm questions, engineers and friends who are interested in this "Programmer Code Interview Guide" please help me, click here to receive this PDF for free