one side
1. Introduce yourself, why choose to come out and see the opportunity
2. Talk about items, how to do alarms, and how to do unified access to monitoring items
3. Chat project, configuration center project, ask how to do real-time configuration push
4. Discuss why all the component dependencies are selected to be controlled in the configuration center
5. I want to do a current limiting function, how to do it?
6. How to make this current limit distributed?
7. How to grab the lock? How to release the lock?
8. After the timeout is added, is it possible for someone to steal the lock without releasing it? How to deal with it?
9. How can this problem be solved without the heartbeat of zk?
10. If you want to make the current limit configurable, you need a background management system to configure the global traffic for a certain api at will, how to do it?
11. A globally unique incremental ID needs to be generated in a certain business, and the amount of concurrency is very large. What should I do?
12. Algorithmic problem, find the specified number for a matrix that M*N increases horizontally and vertically
13. What do you want to ask me?
Two sides
1. What is the tool chain and technology stack you usually use?
2. Has golang ever stepped on the pit?
3. Are there any bugs in this golang code?
4. How to solve the storage, conflict, expansion, and concurrent access of HashMap in Java?
5. In the zipper method, what are the advantages and disadvantages of the red-black tree when the linked list is too long?
6. Where is the concurrency insecurity of HashMap?
7. When HashMap expands, what special treatment does it have to read and write operations?
8. How does ConcurrentHashMap achieve concurrency safety?
9. What lock mechanisms does Java have, and what are their characteristics?
10. Do you know CAS? How is CAS implemented in Java?
11. What is the storage engine of MySQL? Why InnoDB?
12. What is the difference between MySQL clustered index and non-clustered index?
13. What are the differences and advantages and disadvantages of B+ tree and binary tree?
14. Design an index for a scenario, examining the knowledge of joint index and column selectivity
15. There is a new query scenario, how to solve it?
16. If you want to check A in () AND B in (), how to build an index?
17. When checking A in () AND B in (), how does MySQL use the index?
18. If you query A in (), does MySQL check the index for N values separately, or is there a better operation?
19. Which data structures of Redis have you used? How is ZSET implemented?
20. zrange start, stop, the total length is n, what is the complexity?
21. How do Kafka consumers do message deduplication?
22. Introduce Kafka's ConsumerGroup
23. How are Kubernetes and Docker used?
24. What is the storage structure of a time series database?
25. Do you understand the LSM tree? What kind of storage structure is it?
26. Have you used Cassandra and RocksDB in production? How much?
27. What is Cassandra's tombstone mechanism?
28. Algorithmic question: The original question on Niuke's questionba, you can go and see: NC76 uses two stacks to implement queues
Three sides
1. Talk about projects and work experience
2. What pits have you stepped on in the process of using Kubernetes?
3. Consider a business scenario: the number of comments on headlines is very large, for example, a popular article has millions of comments, design a back-end service to realize the timing display and paging of comments
4. If you use id to turn pages, how to design the database table? How to design the index?
5. If the volume is large, do you think it is necessary to divide the database and the table? How to divide it?
6. How to query paging after sub-database and table?
7. How to ensure that the primary key is still incremented after sub-database sub-table?
8. Now it is necessary to support deep paging, page number jump directly, how to achieve it?
9. If the amount of instantaneous write is large, the storage may be suspended, how to protect it?
10. How to realize the internal circuit breaker?
11. The circuit breaker will cause write failure, what if we do not allow write failure?
12. Algorithm problem: N concerts, given in the form of [{startTime, endTime}…], calculate the maximum number of concerts you can listen to. Implement this algorithm in the language you are most familiar with
13. You used the greed method, what might be the problem with greed?
Interview question answer, how to get
If you need to get it, it’s troublesome to get it with one-click triple connection + comment, then add VX (tkzl6666) to get it for free
