[Leetcode] High Frequency Problems, Stack (High Frequency Problems, Stack)

Up to now, the total number of LeetCode questions has been 1582题, and it is estimated that the average annual growth will be 300题around in the future . Most people will definitely be 刷不完的, so you have to selectively brush LeetCode.

A generally accepted strategy for brushing questions is 按类别刷题, but each category also has many questions, in a limited time 到底该刷哪些题呢? Individuals sorted out and included the topics in each category according LeetCode官方to each topic given . For topics whose official statistical frequency was too low, they were not included, and finally got this high-frequency topic table.出现频率高频出现

For example, the title of the title number #275and #270in the following figure will be included, and the #275frequency of occurrence is greater than #270; for the title of the title number #1011and #1182, because the occurrence frequency is too low, it will not be included:Insert picture description here

Pick up the keyboard and work hard! I wish you all a successful landing! It's not easy to organize, please like it!


Stack-33 problems (Stack, 33 problems)

Date of data: 2020/03/26 (LeetCode question number at this time: 1582)
Data source: LeetCode official. Questions of different categories are arranged in descending order according to the official frequency (Frequency), and questions with frequency statistics are selected.

Sort Question number topic Passing rate Difficulty
1 #42 Trapping Rain Water 0.495 difficult
2 #85 Maximal Rectangle 0.449 difficult
3 #94 Binary Tree Inorder Traversal 0.707 medium
4 #20 Valid Parentheses 0.412 simple
5 #225 Implement Stack using Queues 0.643 simple
6 #739 Daily Temperatures 0.595 medium
7 #394 Decode String 0.493 medium
8 #316 Remove Duplicate Letters 0.378 difficult
9 #155 My Stack 0.522 simple
10 #144 Binary Tree Preorder Traversal 0.648 medium
11 #224 Basic Calculator 0.371 difficult
12 #496 Next Greater Element I 0.634 simple
13 #232 Implement Queue using Stacks 0.636 simple
14 #145 Binary Tree Postorder Traversal 0.707 difficult
15 #71 Simplify Path 0.388 medium
16 #385 Mini Parser 0.396 medium
17 #84 Largest Rectangle in Histogram 0.392 difficult
18 #173 Binary Search Tree Iterator 0.718 medium
19 #682 Baseball Game 0.664 simple
20 #503 Next Greater Element II 0.536 medium
21 #726 Number of Atoms 0.437 difficult
22 #103 Binary Tree Zigzag Level Order Traversal 0.54 medium
23 #341 Flatten Nested List Iterator 0.626 medium
24 #456 132 Pattern 0.263 medium
25 #402 Remove K Digits 0.284 medium
26 #636 Exclusive Time of Functions 0.499 medium
27 #331 Verify Preorder Serialization of a Binary Tree 0.44 medium
28 #591 Tag Validator 0.297 difficult
29 #150 Evaluate Reverse Polish Notation 0.495 medium
30 #735 Asteroid Collision 0.378 medium
31 #439 Ternary Expression Parser 0.548 medium
32 #255 Verify Preorder Sequence in Binary Search Tree 0.458 medium
33 #272 Closest Binary Search Tree Value II 0.587 difficult

Related/reference links

leetcode-cn
leetcode

Guess you like

Origin blog.csdn.net/a435262767/article/details/105203763