No matter spring or autumn recruitment, it is inevitable to brush the exam questions. Today, I summarized the process of classifying the leetcode questions and practicing them in the autumn recruitment process. Some basic data structure exercises are recommended in conjunction with this book on hyperbolic data structures to eat. There are some language features, pay attention to summary and analysis, help deepen the understanding of data structure foundation. Summary of basic data structures

  • LeetCode 1. Two Sum
  • LeetCode 187. Repeated DNA Sequences
  • LeetCode 706. Design HashMap
  • LeetCode 652. Find Duplicate Subtrees
  • LeetCode 560. Subarray Sum Equals K
  • LeetCode 547. Friend Circles
  • LeetCode 684. Redundant Connection
  • LeetCode 692. Top K Frequent Words
  • LeetCode 295. Find Median from Data Stream
  • LeetCode 352. Data Stream as Disjoint Intervals

Binary lookups typically operate on monotone ordered arrays, but the actual variations are quite flexible. For example, LC287 is a classic application. Regarding dichotomous content, the following topics are recommended. The key is to buckle the boundary. Binary feature

  • Leetcode 69. sqrt x
  • Leetcode 35. Search insert position
  • LeetCode 34. Find First and Last Position of Element in Sorted Array
  • LeetCode 74. Search a 2D Matrix
  • LeetCode 153. Find Minimum in Rotated Sorted Array
  • LeetCode 33. Search in Rotated Sorted Array
  • LeetCode 278. First Bad Version
  • LeetCode 162. Find Peak Element
  • LeetCode 287. Find the Duplicate Number
  • LeetCode 275. H-Index II

About linked list, mostly in the examination site, but often take an examination of the title of the fixed, school recruiting process, encounter more inverse problems, summarizes several questions here, personal advice will be ordered list this part focus on the review, such as linked lists fast row, strip on the list, the list merge row, all pass, especially the bytes of the interviewer, like test list of topics, this part of the topic, Just button the details. Recommended topics for linked list:

  • LeetCode 19. Remove Nth Node From End of List
  • LeetCode 237. Delete Node in a Linked List
  • LeetCode 83. Remove Duplicates from Sorted List
  • LeetCode 61. Rotate List
  • LeetCode 24. Swap Nodes in Pairs
  • LeetCode 206. Reverse Linked List
  • LeetCode 92. Reverse Linked List II
  • LeetCode 160. Intersection of Two Linked Lists
  • LeetCode 142. Linked List Cycle II
  • LeetCode 148. Sort List

Trees and binary trees are also popular topics for byte interviewers, because this part of the content is a good verification of the understanding and mastery of recursive operations. Content with binary tree, binary tree several traversal methods need to be thoroughly familiar with the heart (non-recursive version) tree topic recommended topic:

  • LeetCode 98. Validate Binary Search Tree
  • LeetCode 101. Symmetric Tree
  • LeetCode 94. Binary Tree Inorder Traversal
  • LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal
  • LeetCode 102. Binary Tree Level Order Traversal
  • LeetCode 236. Lowest Common Ancestor of a Binary Tree
  • LeetCode 297. Serialize and Deserialize Binary Tree
  • LeetCode 543. Diameter of Binary Tree
  • LeetCode 124. Binary Tree Maximum Path Sum
  • LeetCode 173. Binary Search Tree Iterator

This section does not say much about the main blank space and comma, which belong to some general topics.

  • LeetCode 38. Count and Say
  • LeetCode 49. Group Anagrams
  • LeetCode 151. Reverse Words in a String
  • LeetCode 165. Compare Version Numbers
  • LeetCode 929. Unique Email Addresses
  • LeetCode 5. Longest Palindromic Substring
  • LeetCode 6. ZigZag Conversion
  • LeetCode 3. Longest Substring Without Repeating Characters
  • LeetCode 208. Implement Trie (Prefix Tree)
  • LeetCode 273. Integer to English Words

From this start, into the heart mode, this part of the topic I brush a whole two days, brush the refreshing. It is mainly depth-first search and backtracking, which has a large time complexity and is often difficult to find the right idea. Backtracking and Depth-first Search

  • LeetCode 17. Letter Combinations of a Phone Number
  • LeetCode 79. Word Search
  • LeetCode 46. Permutations
  • LeetCode 47. Permutations II
  • LeetCode 78. Subsets
  • LeetCode 90. Subsets II
  • LeetCode 216. Combination Sum III
  • LeetCode 52. N-Queens II
  • LeetCode 37. Sudoku Solver
  • LeetCode 473. Matchsticks to Square

Sliding Windows, double Pointers, and monotonous queues/stacks

  • LeetCode 167. Two Sum II – Input array is sorted
  • LeetCode 88. Merge Sorted Array
  • LeetCode 26. Remove Duplicates from Sorted Array
  • LeetCode 76. Minimum Window Substring
  • LeetCode 32. Longest Valid Parentheses
  • LeetCode 155. Min Stack
  • LeetCode 42. Trapping Rain Water
  • LeetCode 84. Largest Rectangle in Histogram
  • LeetCode 239. Sliding Window Maximum
  • LeetCode 918. Maximum Sum Circular Subarray

For me, the hardest part, but once you learn it, it’s comfortable. DP is increasingly becoming a required test for interviews in major companies. DP can effectively reduce time complexity and repeated calculation. Recommended topics for dynamic programming:

  • LeetCode 53. Maximum Subarray
  • LeetCode 120. Triangle
  • LeetCode 63. Unique Paths II
  • LeetCode 91. Decode Ways
  • LeetCode 198. House Robber 
  • LeetCode 300. Longest Increasing Subsequence
  • LeetCode 72. Edit Distance
  • LeetCode 518. Coin Change 2
  • LeetCode 664. Strange Printer
  • LeetCode 10. Regular Expression Matching

Above, are some of the leetcode topics I brush, and occasionally play weekly games. In addition, the offer is a must. Personally, I would like to recommend the title of offer. Finally, I wish you a smooth interview and a satisfactory offer