@@ -97,10 +97,11 @@ The data structures mainly includes:
97
97
- [ 0020.Valid Parentheses] ( ./problems/20.validParentheses.md )
98
98
- [ 0026.remove-duplicates-from-sorted-array] ( ./problems/26.remove-duplicates-from-sorted-array.md )
99
99
- [ 0088.merge-sorted-array] ( ./problems/88.merge-sorted-array.md )
100
- - [ 0121.best-time-to-buy-and-sell-stock] ( ./problems/121.best-time-to-buy-and-sell-stock.md ) 🆕
101
- - [ 0122.best-time-to-buy-and-sell-stock-ii] ( ./problems/122.best-time-to-buy-and-sell-stock-ii.md ) 🆕
100
+ - [ 0121.best-time-to-buy-and-sell-stock] ( ./problems/121.best-time-to-buy-and-sell-stock.md )
101
+ - [ 0122.best-time-to-buy-and-sell-stock-ii] ( ./problems/122.best-time-to-buy-and-sell-stock-ii.md )
102
102
- [ 0136.single-number] ( ./problems/136.single-number.md )
103
103
- [ 0167.two-sum-ii-input-array-is-sorted] ( ./problems/167.two-sum-ii-input-array-is-sorted.md )
104
+ - [ 0172.factorial-trailing-zeroes] ( ./problems/172.factorial-trailing-zeroes.md ) 🆕
104
105
- [ 0169.majority-element] ( ./problems/169.majority-element.md )
105
106
- [ 0190.reverse-bits] ( ./problems/190.reverse-bits.md )
106
107
- [ 0191.number-of-1-bits] ( ./problems/191.number-of-1-bits.md )
@@ -109,24 +110,27 @@ The data structures mainly includes:
109
110
- [ 0206.reverse-linked-list] ( ./problems/206.reverse-linked-list.md )
110
111
- [ 0219.contains-duplicate-ii] ( ./problems/219.contains-duplicate-ii.md )
111
112
- [ 0226.invert-binary-tree] ( ./problems/226.invert-binary-tree.md )
113
+ - [ 0263.ugly-number] ( ./problems/263.ugly-number.md ) 🆕
112
114
- [ 0283.move-zeroes] ( ./problems/283.move-zeroes.md )
115
+ - [ 0342.power-of-four] ( ./problems/342.power-of-four.md ) 🆕
113
116
- [ 0349.intersection-of-two-arrays] ( ./problems/349.intersection-of-two-arrays.md )
117
+ - [ 0575.distribute-candies] ( ./problems/575.distribute-candies.md ) 🆕
114
118
115
119
116
120
#### Medium
117
121
118
122
- [ 0002. Add Two Numbers] ( ./problems/2.addTwoNumbers.md )
119
123
- [ 0003. Longest Substring Without Repeating Characters] ( ./problems/3.longestSubstringWithoutRepeatingCharacters.md )
120
124
- [ 0011.container-with-most-water] ( ./problems/11.container-with-most-water.md )
121
- - [ 0015.3-sum] ( ./problems/15.3-sum.md ) 🆕
125
+ - [ 0015.3-sum] ( ./problems/15.3-sum.md )
122
126
- [ 0019. Remove Nth Node From End of List] ( ./problems/19.removeNthNodeFromEndofList.md )
123
127
- [ 0024. Swap Nodes In Pairs] ( ./problems/24.swapNodesInPairs.md )
124
128
- [ 0039.combination-sum] ( ./problems/39.combination-sum.md )
125
129
- [ 0040.combination-sum-ii] ( ./problems/40.combination-sum-ii.md )
126
130
- [ 0046.permutations] ( ./problems/46.permutations.md )
127
131
- [ 0047.permutations-ii] ( ./problems/47.permutations-ii.md )
128
- - [ 0055.jump-game] ( ./problems/55.jump-game.md ) 🆕
129
- - [ 0062.unique-paths] ( ./problems/62.unique-paths.md ) 🆕
132
+ - [ 0055.jump-game] ( ./problems/55.jump-game.md )
133
+ - [ 0062.unique-paths] ( ./problems/62.unique-paths.md )
130
134
- [ 0075.sort-colors] ( ./problems/75.sort-colors.md )
131
135
- [ 0078.subsets] ( ./problems/78.subsets.md )
132
136
- [ 0086.partition-list] ( ./problems/86.partition-list.md )
@@ -138,12 +142,12 @@ The data structures mainly includes:
138
142
- [ 0103.binary-tree-zigzag-level-order-traversal] ( ./problems/103.binary-tree-zigzag-level-order-traversal.md )
139
143
- [ 0139.word-break] ( ./problems/139.word-breakmd )
140
144
- [ 0144.binary-tree-preorder-traversal] ( ./problems/144.binary-tree-preorder-traversal.md )
141
- - [ 0150.evaluate-reverse-polish-notation] ( ./problems/150.evaluate-reverse-polish-notation.md ) 🖊
145
+ - [ 0150.evaluate-reverse-polish-notation] ( ./problems/150.evaluate-reverse-polish-notation.md )
142
146
- [ 0152.maximum-product-subarray] ( ./problems/152.maximum-product-subarray.md ) 🆕
143
147
- [ 0199.binary-tree-right-side-view] ( ./problems/199.binary-tree-right-side-view.md )
144
148
- [ 0201.bitwise-and-of-numbers-range] ( ./problems/201.bitwise-and-of-numbers-range.md )
145
149
- [ 0208.implement-trie-prefix-tree] ( ./problems/208.implement-trie-prefix-tree.md )
146
- - [ 0209.minimum-size-subarray-sum] ( ./problems/209.minimum-size-subarray-sum.md ) 🖊
150
+ - [ 0209.minimum-size-subarray-sum] ( ./problems/209.minimum-size-subarray-sum.md )
147
151
- [ 0236.lowest-common-ancestor-of-a-binary-tree] ( ./problems/236.lowest-common-ancestor-of-a-binary-tree.md )
148
152
- [ 0238.product-of-array-except-self] ( ./problems/238.product-of-array-except-self.md ) 🆕
149
153
- [ 0240.search-a-2-d-matrix-ii] ( ./problems/240.search-a-2-d-matrix-ii.md )
0 commit comments