截止至今LeetCode题目总量已经有
1582题
,估计将来每年平均增长
300题
左右,大部分人肯定是
刷不完的
,所以得有选择地刷LeetCode。
一种公认的刷题策略是
按类别刷题
,可是每个类别也有许多题,在有限的时间里
到底该刷哪些题呢
?个人根据
LeetCode官方
给出的每个题目的
出现频率
,整理并收录了每个类别里
高频出现
的题目,对于官方统计频率太低的题目,不予收录,最终得到了这个高频题目表格。
例如,对于下图中题号
#275
与
#270
的题目将被收录,并且
#275
出现频率大于
#270
;而对于题号
#1011
与
#1182
的题目,因为出现频率太低,将不被收录:
撸起键盘加油干!祝大家成功上岸!整理不易,点个赞吧!
二叉搜索树篇-48题(Binary Search Tree, 48 problems)
数据日期: 2020/03/26 (此时LeetCode题目数量:1582)
数据来源: LeetCode官方,将不同类别的题目按照官方给的出现频率(Frequency)降序排列,取有频率统计的题。
排序 | 题号 | 题目 | 通过率 | 难度 |
---|---|---|---|---|
1 | #4 | Median of Two Sorted Arrays | 0.372 | 困难 |
2 | #349 | Intersection of Two Arrays | 0.685 | 简单 |
3 | #167 | Two Sum II – Input array is sorted | 0.531 | 简单 |
4 | #287 | Find the Duplicate Number | 0.635 | 中等 |
5 | #300 | Longest Increasing Subsequence | 0.44 | 中等 |
6 | #718 | Maximum Length of Repeated Subarray | 0.492 | 中等 |
7 | #33 | Search in Rotated Sorted Array | 0.365 | 中等 |
8 | #410 | Split Array Largest Sum | 0.414 | 困难 |
9 | #363 | Max Sum of Rectangle No Larger Than K | 0.348 | 困难 |
10 | #315 | Count of Smaller Numbers After Self | 0.372 | 困难 |
11 | #327 | Count of Range Sum | 0.329 | 困难 |
12 | #29 | Divide Two Integers | 0.194 | 中等 |
13 | #50 | Pow(x, n) | 0.342 | 中等 |
14 | #69 | Sqrt(x) | 0.376 | 简单 |
15 | #174 | Dungeon Game | 0.404 | 困难 |
16 | #475 | Heaters | 0.296 | 简单 |
17 | #35 | Search Insert Position | 0.453 | 简单 |
18 | #378 | Kth Smallest Element in a Sorted Matrix | 0.587 | 中等 |
19 | #222 | Count Complete Tree Nodes | 0.678 | 中等 |
20 | #209 | Minimum Size Subarray Sum | 0.418 | 中等 |
21 | #352 | Data Stream as Disjoint Intervals | 0.526 | 困难 |
22 | #668 | Kth Smallest Number in Multiplication Table | 0.462 | 困难 |
23 | #374 | Guess Number Higher or Lower | 0.433 | 简单 |
24 | #454 | 4Sum II | 0.543 | 中等 |
25 | #34 | Find First and Last Position of Element in Sorted Array | 0.392 | 中等 |
26 | #354 | Russian Doll Envelopes | 0.346 | 困难 |
27 | #153 | Find Minimum in Rotated Sorted Array | 0.502 | 中等 |
28 | #493 | Reverse Pairs | 0.235 | 困难 |
29 | #392 | Is Subsequence | 0.486 | 简单 |
30 | #436 | Find Right Interval | 0.446 | 中等 |
31 | #350 | Intersection of Two Arrays II | 0.474 | 简单 |
32 | #81 | Search in Rotated Sorted Array II | 0.352 | 中等 |
33 | #162 | Find Peak Element | 0.453 | 中等 |
34 | #230 | Kth Smallest Element in a BST | 0.694 | 中等 |
35 | #483 | Smallest Good Base | 0.37 | 困难 |
36 | #367 | Valid Perfect Square | 0.433 | 简单 |
37 | #441 | Arranging Coins | 0.404 | 简单 |
38 | #240 | Search a 2D Matrix II | 0.396 | 中等 |
39 | #719 | Find K-th Smallest Pair Distance | 0.316 | 困难 |
40 | #74 | Search a 2D Matrix | 0.376 | 中等 |
41 | #278 | First Bad Version | 0.376 | 简单 |
42 | #154 | Find Minimum in Rotated Sorted Array II | 0.478 | 困难 |
43 | #644 | Maximum Average Subarray II | 0.336 | 困难 |
44 | #658 | Find K Closest Elements | 0.431 | 中等 |
45 | #275 | H-Index II | 0.404 | 中等 |
46 | #270 | Closest Binary Search Tree Value | 0.506 | 简单 |
47 | #302 | Smallest Rectangle Enclosing Black Pixels | 0.694 | 困难 |
48 | #786 | K-th Smallest Prime Fraction | 0.372 | 困难 |
相关/参考链接
leetcode-cn
leetcode