The following dry goods, after reading carefully, benefited a lot. PDF version of private message [High Score Collection] Free to receive~
Preface
What kind of opportunity?
In fact, it has been two years since I graduated, and I started to pay attention to the development of Bytedance when I was in college. At the beginning, I majored in electrical automation. After I knew my goal in my sophomore year, I switched to computers. I joined a small Internet company as an internship in my fourth year. I won’t say which one is specific. This internship will also be done for me in the future. It is a good "foreground."
After clearly realizing that my goal is Bytedance, I started to do my homework frantically and understood that Bytedance likes to test algorithms, so I have worked hard in this regard. Later, when I browsed a certain blog, I got a "High Score Book". This "High Score Book" helped me a lot during the interview. Even I won the byte offer, but I was stupefied.
Is ByteDance interview difficult?
I believe many friends are also very concerned about the interview process of Bytedance? How difficult is it? I am a social recruitment, so compared to school recruitment, the difficulty is definitely greater. Therefore, at the beginning I did not have much confidence. It was not until after both sides had passed that the pressure in my heart was reduced a lot. Therefore, in general, it is not difficult to say that it is difficult, and it is not easy to say it is easy.
What kind of high score book is this?
This high score book contains a lot of content, and the points involved are also very complete. The main content is based on algorithms, data structures, networks, and operating systems. MySQL and Java have a lot of content, and even provide some aspects. It is very helpful for me to keep reading through the scriptures and suggestions.
Due to the too much content of the collection and the limited length of the article, only the catalogue is shown below, and you need a direct message to me [High Score Collection] in PDF!
01 Learning algorithm (experience sharing)
- As a novice, how should the algorithm learn?
- What are the algorithms that programmers must master?
- Leetcode brushes 500 questions, is the written test stable?
02 learn recursion
- Why can't you learn recursion? Say goodbye to recursion and talk about some of my experiences
- Recursive training 1: Find the upper median in two sorted arrays of equal length
- Recursive training 2: Find two ordinal numbers: the decimal number of the group
- Recursive training 3: Find the median of two ordered arrays (on the importance of thinking transformation)
03 Learning dynamic programming
- · Is dynamic programming difficult? DP brushed 40 questions in a row, and I summarized these routines!
- · How to optimize dynamic programming?
- · Dynamic planning training 1: Detailed explanation of three one-dimensional dynamic programming algorithm problems
- · Dynamic training 2: Detailed leetcode221 question: the largest square
04 Binary search
- · Binary search are you sure you will? Can it be used to design scams in life?
- · Dichotomous application: two seemingly simple algorithmic questions
- · Dichotomy question type summary
05 Reproduce the school recruitment algorithm interview (personal experience)
- Remember an algorithmic interview question with byte beating: deformed linked list reversal
- Remember a hand algorithm interview: the interviewer of Byte Beat beat me four times
- Remember a written test question from Ali: How do I solve the Joseph ring problem with one line of code
- Remember an Alibaba interview: the interview was hung on the design of the LRU cache algorithm
- [Breaked up] Remember an interview question for shopee algorithm: the optimal solution of the smallest stack
- The application of the prefix sum, starting from a NetEase written test
- [Interview abused] Talk about how the sensitive word filtering in the game is achieved?
- Use only 2GB of memory to find the most frequent number from 2 billion, 4 billion, and 8 billion integers
06 Learn string matching algorithm
- Graphical string matching KMP algorithm
- Graphic string matching Boyer-Moore algorithm: How is the search function in the text editor implemented?
07 Get the binary tree
- Pre-order traversal of binary tree (non-recursive version)
- In-order traversal of binary tree (non-recursive version)
- Post-order traversal of binary tree (non-recursive version)
- Print binary tree from top to bottom
- Construction of Binary Tree
- Mirror of Binary Tree
- Substructure of Binary Tree
- Post-order traversal sequence of binary search tree
- Rebuild the binary tree
08 Get the linked list
- Training 1: Convert the search binary tree into a doubly linked list
- Training 2: Delete the Kth node of the singly linked list
- Training 3: Delete the intermediate node of the singly linked list
- Training 4: How to elegantly reverse a singly linked list
- Training 5: Joseph problem of circular singly linked list
- Training 6: Three methods to take you to judge the palindrome list gracefully
- Training 7: Divide the singly linked list according to a certain value into the form of small left side, equal middle, large right side
- Training 8: Copy the linked list with random pointer nodes
- Training 9: Reverse the order between every K nodes of the singly linked list
09 must learn sorting algorithm
- [Comic] Interviewer, please stop asking me for quick sort
- [Comic] Why is it said that 0 (n) complexity radix sort is not as fast as quick sort?
- [Comic] External sorting: How to sort 2 billion integers with 2GB of memory? (In fact, this is also a common interview question)
- Top ten rankings, just read this one
- Top ten sorting explanation order
10 must algorithmic thinking/skills
- [Pursue the ultimate] How do I make easy-level algorithmic questions into har-level
- Shuidi summarized this high-frequency algorithmic problem-solving technique for you to help you solve problems faster!
- Share an ingenious algorithmic problem
- Factorial is simple? To be honest, you may not understand these few factorial-related interview questions!
- Interviewer, please don’t ask me such a simple but difficult algorithm question
- Awesome! One line of code can actually solve so many legal problems that have troubled me for a long time
- What are the tricks and tricks in the algorithm data structure?
- Bit operation equipment..b guide
- Find missing integers
11 learning data structure
- What the hell is the binary heap?
- What the hell is heap sort?
- What is an AVL tree?
- High-frequency interview: What is a B-tree? Why use B-tree for file index instead of binary search tree?
- Tencent interview question: With binary search tree, balance tree, why do you need a red-black tree?
12 Computer Network
- Must read! A text to understand how a computer sends data to another computer?
- [Random Talk] How did two completely unfamiliar hosts achieve "correct delivery of data"?
- What is congestion control?
- What is TCP flow control?
- What is the broadcast routing algorithm? How to solve the broadcast storm?
- Random talk: What is https?
- What is a digital signature?
- How did the computer's ip come from?
- What is the difference between packet and circuit switching?
- What does the interviewer want to test us about three handshake and four wave hands?
13 Summary of experience written to school students
- [Core finishing] Those basic computer knowledge that made you take off: what to learn and how to learn?
- This is a learning route suitable for the general public
- I have studied programming for four years. These high-quality learning tools/websites/materials are recommended to you
- Spring recruits two interviews with Tencent, and I share my failure + stupid interview experience
- Two months of Autumn Recruitment: Over, let’s talk about some important knowledge points in the Spring and Autumn Recruitment
- It is necessary to talk about the upcoming spring recruits (experience + importance + how to prepare)
- Talk about the projects done during the spring and autumn recruitment and a few recommended projects + interview video
14 Learning MySQL
- Tencent Interview: What are the reasons for the slow execution of a SQL statement?
- Let me go, these two tips: Not only do I hide my SQL statement, but also improve it 1000 times
- Interview tips: MySQL index related
15 Git
- Learn Git from 0, summarize this Git command collection
16 Java
- In one sentence, finish all kinds of locks such as heavy inner locks, spin locks, light child locks, bias locks, pessimistic locks, and optimistic locks.
- Thread safety (on)-thoroughly understand the volatile keyword
- Thread safety (below)-thoroughly understand synchronized (from biased locks to heavy-duty locks)
- Do you dare to learn the most important synchronization classes in the Java concurrent package?
- Please standardize your code style
17 Operating System
- Remember N interviews: What are the communication methods between processes? How to communicate?
18 personal experiences and thoughts
- Ordinary, my three-year university
- 15 months of writing the official account, learning and gains along the way
- For more than a year since I wrote an article on the official account, I have experienced being sprayed, blocked and praised. I feel sour.
- My 2019
- How do I make myself better
- Talk about my recent daily|learning|thinking
19 Recommended Books
- Computer basics must see
- I grew up, some high-quality books I have read in the university
My ByteDance interview experience
Byte beating side:
- Why does the operating system have physical addresses and logical addresses, and why paging manages memory?
- The difference between process and thread, the way of communication between processes
- Talk about the four-layer structure of TCP/IP, which protocols they contain and which layer the browser is on, QUIC will talk about
- What is the difference between HTTP1.0 / 1.1 / 2.0?
- Java class loading mechanism, is it possible that the parent delegation model is broken?
- The role of the volatile keyword
- Talk about the realization of database read-write separation
- SQL statement, how to find unique fields, distinct, is there any other method, group by.
- Talk about the data structure of Redis, what is the underlying data structure of ZSet?
- Talk about distributed transactions, talk about distributed locks
- Talk about the starter of Spring Boot
- Give you a cluster how you will be distributed, what factors to consider, disaster tolerance, load balancing
- Let you design salted fish, how would you design? Model design
- Algorithmic question: the best time to buy and sell stocks (only one buy and sell, and at most two buys and sells)
Two sides of byte beating:
- Java multithreading, the selection of thread pool, why choose this, the underlying implementation principle
- What is the size of a non-leaf node of the database B+ tree (this question will not be so remembered)
- Write a sql code: give a student table with student id, course id, and grades in three columns, find out at least 3 students whose grades are greater than 80 points
- Algorithm question (leetcode original question): Give an array, such as [1,2,3,4,5], a[i] represents the distance that can be walked forward at that position, and judge whether it can reach the last element of the array
Three sides of byte beating:
- Writing to the programming question: a two-dimensional array is incremented for each row and each column is incremented, query whether a value is in the array, say the idea and write it down
- Write another: How many ways are there for 1*2 bricks to pave 2xn bricks?
- 10 billion positive integer data, find the smallest small top heap of 100 numbers, and read them into memory one by one. What is the complexity? Is there any method that is less complex than the small top heap? Use an array with a length of 4.2 billion, the subscript is the value, store the number of occurrences of the element corresponding to the subscript position, and then find the first 100
- Operating system: what is the page fault interrupt?
- In the operating system: What resources are shared by threads in the same process?
- Talk about process switching and thread switching? (User mode -> Kernel mode blah)
- Talk about HTTPS
- How is HTTPS encrypted? Asymmetric encryption is already very safe, why use hybrid encryption (hybrid encryption must be read, understand, I didn’t understand it, so it’s not good)
- Why does MySQL use a B+ tree (the point: for example, set the node size to one page, so that each disk I/O can read a node; there are also leaf nodes connected by pointers, and after the balanced tree finds a node, you need to follow In order to find the next node)
- Is Redis usually used?
- CAS talk about how CAS is implemented, why does he use it if he has ABA problems? (CAS is implemented through the Unsafe class), what about the bottom layer?
Byte beating HR surface:
- Asked the entry time
- Why switch to major? Why develop?
- How do you solve problems when you encounter difficulties?
- Will you ask for help?
- I talked about the salary, and then said that the offer will be sent in these two days
Byte Beat Interview Question Answer + Analysis:
Write at the end
The above is all the content to be shared in this article. The last thing I want to remind is: learning is your own business after all. If you are like me, you have a life goal for yourself and want to work in a big factory. If you get a satisfactory salary, you must not stop your steps.
In addition, the high score collections I mentioned above, as well as personal interview question banks, e-books, learning videos and other materials can be packaged and shared with you. If necessary, you can privately message me [learning] to package and download!
Thank you for your support, you may wish to forward + comment + follow one-click triple-link!