Preface
Why did you fail repeatedly in interviews with big companies? In fact, it's all "algorithms" playing tricks, but it's a pity that you have been stupid not knowing! So, this time I will share enough at one time. Binary trees, linked lists, strings, stacks, queues and other high-frequency interview knowledge points are all summarized for you! Let you eat enough!
20 high-frequency binary tree interviews
- 0. Several concepts
- 1. Find the number of nodes in the binary tree
- 2. Find the maximum number of layers (maximum depth) of the binary tree
- 3. Preorder traversal/preorder traversal
- 4. Mid-order traversal
- 5. Post-order traversal
- 6. Hierarchical traversal
- 7. Find the number of nodes in the Kth level of the binary tree
- 8. Find the number of leaf nodes in the Kth level of the binary tree
- 9. Determine whether two binary trees have the same structure
- 10. Determine whether the binary tree is a balanced binary tree
- 11. Find the mirror image of the binary tree
- 12. Find the lowest common ancestor node of two nodes in the binary tree
- 13. Find the diameter of the binary tree
- 14. Reconstruct binary tree from pre-order traversal sequence and middle-order traversal sequence
- 15. Determine whether the binary tree is a complete binary tree
- 16. Tree substructure
- 17. A path whose sum is a certain value in a binary tree
- 18. The next node of the binary tree
- 19. Serialized Binary Tree
- 20. The kth node of the binary search tree
21 Binary Tree
Algorithm Brush Question LeetCode Chinese Version: Binary Tree
Algorithm Brush Question LeetCode Chinese Version: Binary Tree
17 chain surface test high frequency
- 1. Delete the linked list node at O(1) time
- 2. Flip the singly linked list
- 3. Flip part of the singly linked list
- 4. Rotating singly linked list
- 5. Delete the nth node from the bottom of the singly linked list
- 6. Find the middle node of the singly linked list
- 7. Linked list division
- 8. Summation of linked lists
- 9. Sorting singly linked lists
- 10. Merge two sorted linked lists
- 11. Copy of complex linked list
- 12. Delete duplicate nodes in the linked list
- 13. Determine whether there is a ring in a singly linked list
- 14. Does the singly linked list have ring expansion: find the entry point of the ring
- 15. Determine whether two acyclic singly linked lists intersect
- 16. The extension of the intersection of two linked lists: find the first intersection point of two acyclic singly linked lists
- 17. Two linked lists intersect extension: determine whether two singly linked lists with loops intersect
17 linked list
Algorithm Brush Questions LeetCode Chinese Version: Linked List
Algorithm Brush Questions LeetCode Chinese Version: Linked List
7 stack and queue interviews
- 1. Basic concepts
- 2. Java implementation of the stack
- 3. Java implementation of queue
- 4. Implement the queue with two stacks
- 5. Implement stack with queue
- 6. Stack containing min function
- 7. Stack push and pop sequence
7 stacks and queues
Algorithm Brush Question LeetCode Chinese Version: Stack and Queue
Algorithm Brush Question LeetCode Chinese Version: Stack and Queue
13 string interviews
- 1. KMP algorithm
- 2. Replace spaces
- 3. Longest common prefix
- 4. The longest palindrome
- 5. String arrangement
- 6. Print the full array of strings
- 7. The first character that appears only once
- 8. Flip the word order column
- 9. Rotate string
- 10. Convert string to integer
- 11. Regular expression matching
- 12. A string representing a numeric value
- 13. The first non-repeated character in the character stream
13 string interview high-frequency answer analysis
13 strings
Algorithm Brush Question LeetCode Chinese Version: String
Algorithm Brush Question LeetCode Chinese Version: String
Final summary
Get the algorithm, don’t be afraid of the interview bytes. If you need to share these binary trees, linked lists, strings, stacks and queues in the article, you can share the high-frequency knowledge points and analysis of the major interviews , as well as the Chinese version of LeetCode. You can get it for free by "Add My Vx Assistant" after one-click three consecutive times!
Finally, I will share a spree of the ultimate shredded architecture (study notes): distributed + microservices + open source framework + performance optimization
Distributed + microservices + open source framework + performance optimization