2023/04/02 1:34

- Talk about HashMap, ConcurrentHashMap data structure, the difference between 1.7 and 1.8?
- Hashmap What will happen if only one writes the other full reads
- Which Map classes have been used, what are the differences, is HashMap thread-safe, what are the maps used concurrently, and what are their internal principles, such as storage methods, hashcode, expansion, default capacity, etc.
- The underlying data structure of ArrayList, the underlying data structure of HashMap, and how the HashMap insertion process is implemented
- Are there sequential Map implementation classes, and if so, how are they ordered.
- Why HashMap gets and sets are so fast, and why concurrentHashMap improves concurrency
- Talk about your understanding of HashMap, the basic implementation of the underlying principle, and how does HashMap solve the collision problem? The underlying structure of the map, the storage structure
- Solve the concurrency problem of MAP (3 types)
- Three ways to traverse the hashmap
- How ConcurrentHashMap is used
- How is ConcurrentHashmap’s lock added? Isn’t it better to have more segments
- ConcurrentHashmap Find size How to lock it, and what to do if it changes after just after finding a paragraph
- Why did JAVA8’s ConcurrentHashMap abandon segmentation locks, what’s the problem, and if you design it, how do you design it.
- Talk about data structures such as TreeMap, binary tree, red and black tree.
- B-tree、B+tree？ B-tree B+ tree
- What is the difference between left-handed and right-handed red-black trees? Red and black tree deletion algorithm
- What is a balanced binary tree?
- What is the time complexity of the bubbling sort algorithm?
- Quick ranking algorithm implementation
- Quick sort performance considerations
- Comparison of several sorting and query algorithms
- Binary tree traversal
- The implementation process of binary trees, and the advantages and disadvantages of binary trees
- Time complexity of binary lookup, binary search algorithm
- Binary search tree
- Description of array and linked list data structures, respective time complexity.