|
4 | 4 |
|
5 | 5 | - [使用指南](Intro.md)
|
6 | 6 |
|
7 |
| -## 高频考点题目集合 |
| 7 | +## 高频考题(简单) |
8 | 8 |
|
9 |
| -### 简单合集 |
10 |
| - |
11 |
| -- [面试题 17.12. BiNode](./problems/binode-lcci.md) 🆕 |
| 9 | +- [面试题 17.12. BiNode](./problems/binode-lcci.md) |
12 | 10 | - [0001.two-sum](https://github.com/azl397985856/leetcode/blob/mast./problems/1.two-sum.md)
|
13 | 11 | - [0020.Valid Parentheses](./problems/20.valid-parentheses.md)
|
14 | 12 | - [0021.MergeTwoSortedLists](./problems/21.merge-two-sorted-lists.md)
|
15 | 13 | - [0026.remove-duplicates-from-sorted-array](./problems/26.remove-duplicates-from-sorted-array.md)
|
16 | 14 | - [0053.maximum-sum-subarray](./problems/53.maximum-sum-subarray-cn.md)
|
17 | 15 | - [0088.merge-sorted-array](./problems/88.merge-sorted-array.md)
|
18 |
| -- [0101.symmetric-tree](./problems/101.symmetric-tree.md)🆕 |
| 16 | +- [0101.symmetric-tree](./problems/101.symmetric-tree.md) |
19 | 17 | - [0104.maximum-depth-of-binary-tree](./problems/104.maximum-depth-of-binary-tree.md)
|
20 | 18 | - [0108.convert-sorted-array-to-binary-search-tree](./problems/108.convert-sorted-array-to-binary-search-tree.md)
|
21 | 19 | - [0121.best-time-to-buy-and-sell-stock](./problems/121.best-time-to-buy-and-sell-stock.md)
|
22 | 20 | - [0122.best-time-to-buy-and-sell-stock-ii](./problems/122.best-time-to-buy-and-sell-stock-ii.md)
|
23 | 21 | - [0125.valid-palindrome](./problems/125.valid-palindrome.md)
|
24 | 22 | - [0136.single-number](./problems/136.single-number.md)
|
25 |
| -- [0155.min-stack](./problems/155.min-stack.md) 🆕 |
| 23 | +- [0155.min-stack](./problems/155.min-stack.md) |
26 | 24 | - [0167.two-sum-ii-input-array-is-sorted](./problems/167.two-sum-ii-input-array-is-sorted.md)
|
27 | 25 | - [0169.majority-element](./problems/169.majority-element.md)
|
28 | 26 | - [0172.factorial-trailing-zeroes](./problems/172.factorial-trailing-zeroes.md)
|
|
33 | 31 | - [0206.reverse-linked-list](./problems/206.reverse-linked-list.md)
|
34 | 32 | - [0219.contains-duplicate-ii](./problems/219.contains-duplicate-ii.md)
|
35 | 33 | - [0226.invert-binary-tree](./problems/226.invert-binary-tree.md)
|
36 |
| -- [0232.implement-queue-using-stacks](./problems/232.implement-queue-using-stacks.md) 🆕 |
| 34 | +- [0232.implement-queue-using-stacks](./problems/232.implement-queue-using-stacks.md) |
37 | 35 | - [0263.ugly-number](./problems/263.ugly-number.md)
|
38 | 36 | - [0283.move-zeroes](./problems/283.move-zeroes.md)
|
39 | 37 | - [0342.power-of-four](./problems/342.power-of-four.md)
|
40 | 38 | - [0349.intersection-of-two-arrays](./problems/349.intersection-of-two-arrays.md)
|
41 | 39 | - [0371.sum-of-two-integers](./problems/371.sum-of-two-integers.md)
|
42 |
| -- [0437.path-sum-iii](./problems/437.path-sum-iii.md) 🆕 |
43 |
| -- [0455.AssignCookies](./problems/455.AssignCookies.md) 🆕 |
| 40 | +- [0437.path-sum-iii](./problems/437.path-sum-iii.md) |
| 41 | +- [0455.AssignCookies](./problems/455.AssignCookies.md) |
44 | 42 | - [0575.distribute-candies](./problems/575.distribute-candies.md)
|
45 |
| -- [0874.walking-robot-simulation](./problems/874.walking-robot-simulation.md) 🆕 |
46 |
| -- [1260.shift-2d-grid](./problems/1260.shift-2d-grid.md) 🆕 |
47 |
| -- [1332.remove-palindromic-subsequences](./problems/1332.remove-palindromic-subsequences.md) 🆕 |
| 43 | +- [0874.walking-robot-simulation](./problems/874.walking-robot-simulation.md) |
| 44 | +- [1260.shift-2d-grid](./problems/1260.shift-2d-grid.md) |
| 45 | +- [1332.remove-palindromic-subsequences](./problems/1332.remove-palindromic-subsequences.md) |
| 46 | + |
| 47 | +## 高频考题(中等) |
| 48 | + |
| 49 | +- [面试题 17.09. 第 k 个数](../problems/get-kth-magic-number-lcci.md) |
| 50 | + |
| 51 | +- [0002.add-two-numbers](../problems/2.add-two-numbers.md) |
| 52 | +- [0003.longest-substring-without-repeating-characters](../problems/3.longest-substring-without-repeating-characters.md) |
| 53 | +- [0005.longest-palindromic-substring](../problems/5.longest-palindromic-substring.md) |
| 54 | +- [0011.container-with-most-water](../problems/11.container-with-most-water.md) |
| 55 | +- [0015.3-sum](../problems/15.3sum.md) |
| 56 | +- [0017.Letter-Combinations-of-a-Phone-Number](../problems/17.Letter-Combinations-of-a-Phone-Number.md) |
| 57 | +- [0019. Remove Nth Node From End of List](../problems/19.removeNthNodeFromEndofList.md) |
| 58 | +- [0022.generate-parentheses.md](../problems/22.generate-parentheses.md) |
| 59 | +- [0024. Swap Nodes In Pairs](../problems/24.swapNodesInPairs.md) |
| 60 | +- [0029.divide-two-integers](../problems/29.divide-two-integers.md) |
| 61 | +- [0031.next-permutation](../problems/31.next-permutation.md) |
| 62 | +- [0033.search-in-rotated-sorted-array](../problems/33.search-in-rotated-sorted-array.md) |
| 63 | +- [0039.combination-sum](../problems/39.combination-sum.md) |
| 64 | +- [0040.combination-sum-ii](../problems/40.combination-sum-ii.md) |
| 65 | +- [0046.permutations](../problems/46.permutations.md) |
| 66 | +- [0047.permutations-ii](../problems/47.permutations-ii.md) |
| 67 | +- [0048.rotate-image](../problems/48.rotate-image.md) |
| 68 | +- [0049.group-anagrams](../problems/49.group-anagrams.md) |
| 69 | +- [0050.pow-x-n](../problems/50.pow-x-n.md) |
| 70 | +- [0055.jump-game](../problems/55.jump-game.md) |
| 71 | +- [0056.merge-intervals](../problems/56.merge-intervals.md) |
| 72 | +- [0060.permutation-sequence](../problems/60.permutation-sequence.md) |
| 73 | +- [0062.unique-paths](../problems/62.unique-paths.md) |
| 74 | +- [0073.set-matrix-zeroes](../problems/73.set-matrix-zeroes.md) |
| 75 | +- [0075.sort-colors](../problems/75.sort-colors.md) |
| 76 | +- [0078.subsets](../problems/78.subsets.md) |
| 77 | +- [0079.word-search](../problems/79.word-search-en.md) |
| 78 | +- [0080.remove-duplicates-from-sorted-array-ii](../problems/80.remove-duplicates-from-sorted-array-ii.md) |
| 79 | +- [0086.partition-list](../problems/86.partition-list.md) |
| 80 | +- [0090.subsets-ii](../problems/90.subsets-ii.md) |
| 81 | +- [0091.decode-ways](../problems/91.decode-ways.md) |
| 82 | +- [0092.reverse-linked-list-ii](../problems/92.reverse-linked-list-ii.md) |
| 83 | +- [0094.binary-tree-inorder-traversal](../problems/94.binary-tree-inorder-traversal.md) |
| 84 | +- [0095.unique-binary-search-trees-ii](../problems/95.unique-binary-search-trees-ii.md) |
| 85 | +- [0096.unique-binary-search-trees](../problems/96.unique-binary-search-trees.md) |
| 86 | +- [0098.validate-binary-search-tree](../problems/98.validate-binary-search-tree.md) |
| 87 | +- [0102.binary-tree-level-order-traversal](../problems/102.binary-tree-level-order-traversal.md) |
| 88 | +- [0103.binary-tree-zigzag-level-order-traversal](../problems/103.binary-tree-zigzag-level-order-traversal.md) |
| 89 | +- [105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md](../problems/105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md) |
| 90 | +- [0113.path-sum-ii](../problems/113.path-sum-ii.md) |
| 91 | +- [0129.sum-root-to-leaf-numbers](../problems/129.sum-root-to-leaf-numbers.md) |
| 92 | +- [0130.surrounded-regions](../problems/130.surrounded-regions.md) |
| 93 | +- [0131.palindrome-partitioning](../problems/131.palindrome-partitioning.md) |
| 94 | +- [0139.word-break](../problems/139.word-break.md) |
| 95 | +- [0144.binary-tree-preorder-traversal](../problems/144.binary-tree-preorder-traversal.md) |
| 96 | +- [0150.evaluate-reverse-polish-notation](../problems/150.evaluate-reverse-polish-notation.md) |
| 97 | +- [0152.maximum-product-subarray](../problems/152.maximum-product-subarray.md) |
| 98 | +- [0199.binary-tree-right-side-view](../problems/199.binary-tree-right-side-view.md) |
| 99 | +- [0200.number-of-islands](../problems/200.number-of-islands.md) |
| 100 | +- [0201.bitwise-and-of-numbers-range](../problems/201.bitwise-and-of-numbers-range.md) |
| 101 | +- [0208.implement-trie-prefix-tree](../problems/208.implement-trie-prefix-tree.md) |
| 102 | +- [0209.minimum-size-subarray-sum](../problems/209.minimum-size-subarray-sum.md) |
| 103 | +- [0211.add-and-search-word-data-structure-design](../problems/211.add-and-search-word-data-structure-design.md) |
| 104 | +- [0215.kth-largest-element-in-an-array](../problems/215.kth-largest-element-in-an-array.md) |
| 105 | +- [0221.maximal-square](../problems/221.maximal-square.md) |
| 106 | +- [0229.majority-element-ii](../problems/229.majority-element-ii.md) |
| 107 | +- [0230.kth-smallest-element-in-a-bst](../problems/230.kth-smallest-element-in-a-bst.md) |
| 108 | +- [0236.lowest-common-ancestor-of-a-binary-tree](../problems/236.lowest-common-ancestor-of-a-binary-tree.md) |
| 109 | +- [0238.product-of-array-except-self](../problems/238.product-of-array-except-self.md) |
| 110 | +- [0240.search-a-2-d-matrix-ii](../problems/240.search-a-2-d-matrix-ii.md) |
| 111 | +- [0279.perfect-squares](../problems/279.perfect-squares.md) |
| 112 | +- [0309.best-time-to-buy-and-sell-stock-with-cooldown](../problems/309.best-time-to-buy-and-sell-stock-with-cooldown.md) |
| 113 | +- [0322.coin-change](../problems/322.coin-change.md) |
| 114 | +- [0328.odd-even-linked-list](../problems/328.odd-even-linked-list.md) |
| 115 | +- [0334.increasing-triplet-subsequence](../problems/334.increasing-triplet-subsequence.md) |
| 116 | +- [0337.house-robber-iii.md](../problems/337.house-robber-iii.md) |
| 117 | +- [0343.integer-break](../problems/343.integer-break.md) |
| 118 | +- [0365.water-and-jug-problem](../problems/365.water-and-jug-problem.md) |
| 119 | +- [0378.kth-smallest-element-in-a-sorted-matrix](../problems/378.kth-smallest-element-in-a-sorted-matrix.md) |
| 120 | +- [0380.insert-delete-getrandom-o1](../problems/380.insert-delete-getrandom-o1.md) |
| 121 | +- [0416.partition-equal-subset-sum](../problems/416.partition-equal-subset-sum.md) |
| 122 | +- [0445.add-two-numbers-ii](../problems/445.add-two-numbers-ii.md) |
| 123 | +- [0454.4-sum-ii](../problems/454.4-sum-ii.md) |
| 124 | +- [0474.ones-and-zeros](../problems/474.ones-and-zeros-en.md) |
| 125 | +- [0494.target-sum](../problems/494.target-sum.md) |
| 126 | +- [0516.longest-palindromic-subsequence](../problems/516.longest-palindromic-subsequence.md) |
| 127 | +- [0518.coin-change-2](../problems/518.coin-change-2.md) |
| 128 | +- [0547.friend-circles](../problems/547.friend-circles-en.md) |
| 129 | +- [0560.subarray-sum-equals-k](../problems/560.subarray-sum-equals-k.md) |
| 130 | +- [0609.find-duplicate-file-in-system](../problems/609.find-duplicate-file-in-system.md) |
| 131 | +- [0611.valid-triangle-number](../problems/611.valid-triangle-number.md) |
| 132 | +- [0718.maximum-length-of-repeated-subarray](../problems/718.maximum-length-of-repeated-subarray.md) |
| 133 | +- [0754.reach-a-number.md](../problems/754.reach-a-number.md) |
| 134 | +- [0785.is-graph-bipartite](../problems/785.is-graph-bipartite.md) |
| 135 | +- [0820.short-encoding-of-words](../problems/820.short-encoding-of-words.md) |
| 136 | +- [0875.koko-eating-bananas](../problems/875.koko-eating-bananas.md) |
| 137 | +- [0877.stone-game](../problems/877.stone-game.md) |
| 138 | +- [0886.possible-bipartition](../problems/886.possible-bipartition.md) |
| 139 | +- [0900.rle-iterator](../problems/900.rle-iterator.md) |
| 140 | +- [0912.sort-an-array](../problems/912.sort-an-array.md) |
| 141 | +- [0935.knight-dialer](../problems/935.knight-dialer.md) |
| 142 | +- [1011.capacity-to-ship-packages-within-d-days](../problems/1011.capacity-to-ship-packages-within-d-days.md) |
| 143 | +- [1014.best-sightseeing-pair](../problems/1014.best-sightseeing-pair.md) |
| 144 | +- [1015.smallest-integer-divisible-by-k](../problems/1015.smallest-integer-divisible-by-k.md) |
| 145 | +- [1019.next-greater-node-in-linked-list](../problems/1019.next-greater-node-in-linked-list.md) |
| 146 | +- [1020.number-of-enclaves](../problems/1020.number-of-enclaves.md) |
| 147 | +- [1023.camelcase-matching](../problems/1023.camelcase-matching.md) |
| 148 | +- [1031.maximum-sum-of-two-non-overlapping-subarrays](../problems/1031.maximum-sum-of-two-non-overlapping-subarrays.md) |
| 149 | +- [1104.path-in-zigzag-labelled-binary-tree](../problems/1104.path-in-zigzag-labelled-binary-tree.md) |
| 150 | +- [1131.maximum-of-absolute-value-expression](../problems/1131.maximum-of-absolute-value-expression.md) |
| 151 | +- [1186.maximum-subarray-sum-with-one-deletion](../problems/1186.maximum-subarray-sum-with-one-deletion.md) |
| 152 | +- [1218.longest-arithmetic-subsequence-of-given-difference](../problems/1218.longest-arithmetic-subsequence-of-given-difference.md) |
| 153 | +- [1227.airplane-seat-assignment-probability](../problems/1227.airplane-seat-assignment-probability.md) |
| 154 | +- [1261.find-elements-in-a-contaminated-binary-tree](../problems/1261.find-elements-in-a-contaminated-binary-tree.md) |
| 155 | +- [1262.greatest-sum-divisible-by-three](../problems/1262.greatest-sum-divisible-by-three.md) |
| 156 | +- [1297.maximum-number-of-occurrences-of-a-substring](../problems/1297.maximum-number-of-occurrences-of-a-substring.md) |
| 157 | +- [1310.xor-queries-of-a-subarray](../problems/1310.xor-queries-of-a-subarray.md) |
| 158 | +- [1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](../problems/1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.md) |
| 159 | +- [1371.find-the-longest-substring-containing-vowels-in-even-counts](../problems/1371.find-the-longest-substring-containing-vowels-in-even-counts.md) |
| 160 | + |
| 161 | +## 高频考题(困难) |
48 | 162 |
|
49 |
| -- [中等合集](collections/medium.md) |
50 |
| -- [困难合集](collections/hard.md) |
| 163 | +- [0004.median-of-two-sorted-array](../problems/4.median-of-two-sorted-arrays.md) |
| 164 | +- [0023.merge-k-sorted-lists](../problems/23.merge-k-sorted-lists.md) |
| 165 | +- [0025.reverse-nodes-in-k-group](../problems/25.reverse-nodes-in-k-groups-cn.md) |
| 166 | +- [0030.substring-with-concatenation-of-all-words](../problems/30.substring-with-concatenation-of-all-words.md) |
| 167 | +- [0032.longest-valid-parentheses](../problems/32.longest-valid-parentheses.md) |
| 168 | +- [0042.trapping-rain-water](../problems/42.trapping-rain-water.md) |
| 169 | +- [0052.N-Queens-II](../problems/52.N-Queens-II.md) |
| 170 | +- [0084.largest-rectangle-in-histogram](../problems/84.largest-rectangle-in-histogram.md) |
| 171 | +- [0085.maximal-rectangle](../problems/85.maximal-rectangle.md) |
| 172 | +- [0124.binary-tree-maximum-path-sum](../problems/124.binary-tree-maximum-path-sum.md) |
| 173 | +- [0128.longest-consecutive-sequence](../problems/128.longest-consecutive-sequence.md) |
| 174 | +- [0145.binary-tree-postorder-traversal](../problems/145.binary-tree-postorder-traversal.md) |
| 175 | +- [0212.word-search-ii](../problems/212.word-search-ii.md) |
| 176 | +- [0239.sliding-window-maximum](../problems/239.sliding-window-maximum.md) |
| 177 | +- [0295.find-median-from-data-stream](../problems/295.find-median-from-data-stream.md) |
| 178 | +- [0301.remove-invalid-parentheses](../problems/301.remove-invalid-parentheses.md) |
| 179 | +- [0312.burst-balloons](../problems/312.burst-balloons.md) |
| 180 | +- [0335.self-crossPing](../problems/335.self-crossing.md) |
| 181 | +- [0460.lfu-cache](../problems/460.lfu-cache.md) |
| 182 | +- [0472.concatenated-words](../problems/472.concatenated-words.md) |
| 183 | +- [0488.zuma-game.md](../problems/488.zuma-game.md) |
| 184 | +- [0493.reverse-pairs](../problems/493.reverse-pairs.md) |
| 185 | +- [0887.super-egg-drop](../problems/887.super-egg-drop.md) |
| 186 | +- [0895.maximum-frequency-stack](../problems/895.maximum-frequency-stack.md) |
| 187 | +- [1032.stream-of-characters](../problems/1032.stream-of-characters.md) |
| 188 | +- [1168.optimize-water-distribution-in-a-village](../problems/1168.optimize-water-distribution-in-a-village-cn.md) |
| 189 | +- [1449.form-largest-integer-with-digits-that-add-up-to-target](../problems/1449.form-largest-integer-with-digits-that-add-up-to-target.md) |
51 | 190 |
|
52 | 191 | ## 算法专题
|
53 | 192 |
|
|
0 commit comments