People say that there are two kinds of people in this world that are destined to be single, one is too good, the other is too ordinary. I hear it? Then I am not good, so I resolutely broke up with my girlfriend. (I have no girlfriend)
The Internet is here, and companies that are still recruiting people on a large scale at this time must be awesome companies. And those who bravely quit at this time must be awesome people. So I started the social recruitment interview by ByteDance.
For this day, I had a neat haircut and a clean shave from the long line. Putting on the brand new New Balance 999, even the socks are brand new NB, dark green overalls with burgundy sweater, and an exquisite black down waistcoat on the outside, appearing on the headline on time, ready to start the interview.
Bytedance technology side
The interviews are fairly basic, and the answers are fairly smooth
1. Tell me about your internship project
2. Talk about the meaning of thread parameters
3. Innodb index implementation
4. Why is B+ tree?
5. The use of Redis, the realization of distributed locks
6. Operating system virtual memory paging process
7. TCP three-way handshake
8. The role of the volatile keyword
9. Optimistic lock, pessimistic lock
10. Is the HashMap structure thread safe? How does ConcurrentHashMap ensure thread safety?
11. What design patterns have you used before?
12. Algorithm problem: sliding window
Two sides of byte beating technology
I found that the interviewers of Byte are quite young, and their hair is not very bald, haha~
1. Tell me about the difference between B tree and B+ tree
2. Talk about the implementation of HashMap, the expansion mechanism, and how to ensure that it is operational during expansion?
3. Redis expansion mechanism (gradual single-thread expansion)
4. Principles of Spring AOP
5. The principle of Spring IoC, how to realize it, and how to solve the circular dependency?
6. Two threads add 1 to the variable i. What is the result? why? How to deal with it?
7. CAS concept, realization principle of atomic class
8. How to realize Lock at the bottom of synchronize?
9. What are the characteristics of AQS?
10. Handwriting a module code in the project.
11. Introduce various network protocols.
12. Which protocol does DNS use at the network layer and why?
13. Introduce the HTTPS protocol and detail the SSL connection process.
14. Code question: Reverse singly linked list.
15. Code question: copy complex linked list.
16. Code question: array a, first monotonous address and then monotonously decreasing, output the number of different elements in the array.
Requirements: O(1) space complexity, cannot change the original array
Three sides of byte beating technology
There are so many algorithm questions that it’s like an algorithm session, and the universe’s real name is well known.
1. Talk about the Java garbage collection mechanism
2. 64 horses, 8 tracks, find the fastest 4 horses.
3. 64 horses, 8 tracks, find the fastest 8 horses.
4. Given two ascending arrays A, B and length m, n, find the k-th largest
5. Given array A, the length is n, the value of the elements in the array is between [0, n-1], find whether there are duplicate elements
6. Talk about the difference between multithreading and multiprocessing
7. When will garbage collection occur in the JVM? What kind of objects can be recycled?
8. What is the main idea of Spring?
9. What is your future development direction? Are you sure? Planning to keep doing Java? Have you considered transferring?
10. How do you usually learn Java?
11. Share a recent book
Byte Beat Technology All Around
The condition was very good that day, and the interviewer did not ask too many questions
1. Scenario topic: Design a short domain name service: SMS can't store too long a website, and it needs to be a short domain name. How do you design a service that can serve national websites.
2. Why does TCP shake hands four times with three handshake?
3. The isolation level of the database
4. sql question, I wrote a table query plus fuzzy query
5. Algorithm: Mirror Binary Tree...
Byte beating HR surface
I sigh again, the young lady by Bytedance is beautiful and young!
1. Introduction
2. Do you know ByteDance? Tell me about the bytes in your eyes!
3. Which product do you usually use Bytedance more?
4. Why do you want bytes? Is the intended city Beijing?
5. Tell me about your own career plan
6. Expected salary
7. Some other general issues
to sum up
I received the message by email on November 16th, HR added me WeChat, directly gave the letter of intent, checked it and confirmed it, confirmed the entry time, I am very happy. In general, if you have a big company you want to go to, you must improve yourself so that your abilities and qualities can match the company. I have always believed that opportunities are always reserved for those who are prepared.
Due to space issues, the answers to the interview questions are organized in a pdf file. If you need to get it, it is troublesome to get it. One-click triple-comment + comment, and then add VX (tkzl6666) to receive it for free
Improve technology and broaden knowledge
For programmers, if they want to grow into an industry leader, the only way is to continuously improve their skills, broaden their knowledge, and reach a certain height and depth through learning. So how to improve your technology and expand your knowledge reserve?
The following are some of my personal practices, I hope I can provide you with some help:
- 30 days to finish 283 pages of pdf document
Java part: Java basics, collections, concurrency, multithreading, JVM, design patterns
Data structure algorithm: Java algorithm, data structure
Open source framework: Spring, MyBatis, MVC, netty, tomcat
Distributed part: architecture design, Redis cache, Zookeeper, kafka, RabbitMQ, load balancing, etc.
Microservice part: SpringBoot, SpringCloud, Dubbo, Docker
The Spring framework is still the focus! ! !
Spring learning mind map
35 common Spring Boot knowledge points
- My first collection of algorithms-"Algorithm Brush Questions LeetCode Chinese Version"
This book has 262 pages, including programming skills, linear tables, strings, stacks and queues, trees, sorting, search, brute force enumeration, breadth first search, depth first search, divide and conquer, greedy, dynamic programming, graphs , Detailed realization questions and so on 15 chapters.
Database review series:
How to get the article information: if you need to get it, it’s troublesome to get it, one-click triple-link + comment, then add VX (tkzl6666) to get it for free