https://github.com/xhofe/daily-problem-of-leetcode
✍️daily problem of leetcode
https://github.com/xhofe/daily-problem-of-leetcode
go leetcode rust
Last synced: 5 months ago
JSON representation
✍️daily problem of leetcode
- Host: GitHub
- URL: https://github.com/xhofe/daily-problem-of-leetcode
- Owner: Xhofe
- Created: 2022-03-08T13:02:10.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2023-07-06T07:01:16.000Z (almost 2 years ago)
- Last Synced: 2023-07-06T08:39:49.011Z (almost 2 years ago)
- Topics: go, leetcode, rust
- Language: Rust
- Homepage:
- Size: 236 KB
- Stars: 3
- Watchers: 1
- Forks: 3
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# daily-problem-of-leetcode
## 2023
### 07
- 05: [maximum-split-of-positive-even-integers](./2023/07/05-maximum-split-of-positive-even-integers.rs) [](https://leetcode.cn/problems/maximum-split-of-positive-even-integers/)
- 04: [sum-in-a-matrix](./2023/07/04-sum-in-a-matrix.rs) [](https://leetcode.cn/problems/sum-in-a-matrix/)
- 03: [add-two-numbers-ii](./2023/07/03-add-two-numbers-ii.rs) [](https://leetcode.cn/problems/add-two-numbers-ii/)
- 02: [add-two-numbers](./2023/07/02-add-two-numbers.rs) [](https://leetcode.cn/problems/add-two-numbers/)
- 01: [two-sum](./2023/07/01-two-sum.rs) [](https://leetcode.cn/problems/two-sum/)
### 06
- 30: [circular-sentence](./2023/06/30-circular-sentence.rs) [](https://leetcode.cn/problems/circular-sentence/)
- 29: [reconstruct-a-2-row-binary-matrix](./2023/06/29-reconstruct-a-2-row-binary-matrix.rs) [](https://leetcode.cn/problems/reconstruct-a-2-row-binary-matrix/)
- 28: [minimum-incompatibility](./2023/06/28-minimum-incompatibility.rs) [](https://leetcode.cn/problems/minimum-incompatibility/)
- 27: [maximum-subarray-sum-with-one-deletion](./2023/06/27-maximum-subarray-sum-with-one-deletion.rs) [](https://leetcode.cn/problems/maximum-subarray-sum-with-one-deletion/)
- 26: [find-the-pivot-integer](./2023/06/26-find-the-pivot-integer.rs) [](https://leetcode.cn/problems/find-the-pivot-integer/)
- 23: [maximum-value-of-a-string-in-an-array](./2023/06/23-maximum-value-of-a-string-in-an-array.rs) [](https://leetcode.cn/problems/maximum-value-of-a-string-in-an-array/)
- 22: [pond-sizes-lcci](./2023/06/22-pond-sizes-lcci.rs) [](https://leetcode.cn/problems/pond-sizes-lcci/)
- 21: [fHi6rV](./2023/06/21-fHi6rV.rs) [](https://leetcode.cn/problems/fHi6rV/)
- 20: [minimum-cost-to-connect-two-groups-of-points](./2023/06/20-minimum-cost-to-connect-two-groups-of-points.rs) [](https://leetcode.cn/problems/minimum-cost-to-connect-two-groups-of-points/)
- 19: [greatest-sum-divisible-by-three](./2023/06/19-greatest-sum-divisible-by-three.rs) [](https://leetcode.cn/problems/greatest-sum-divisible-by-three/)
- 07: [mice-and-cheese](./2023/06/07-mice-and-cheese.rs) [](https://leetcode.cn/problems/mice-and-cheese/)
- 06: [equal-row-and-column-pairs](./2023/06/06-equal-row-and-column-pairs.rs) [](https://leetcode.cn/problems/equal-row-and-column-pairs/)
- 05: [apply-operations-to-an-array](./2023/06/05-apply-operations-to-an-array.rs) [](https://leetcode.cn/problems/apply-operations-to-an-array/)
- 04: [number-of-distinct-averages](./2023/06/04-number-of-distinct-averages.rs) [](https://leetcode.cn/problems/number-of-distinct-averages/)
- 02: [count-vowel-strings-in-rangessubmissions](./2023/06/02-count-vowel-strings-in-rangessubmissions.rs) [](https://leetcode.cn/problems/count-vowel-strings-in-rangessubmissions/)
- 01: [maximum-tastiness-of-candy-basket](./2023/06/01-maximum-tastiness-of-candy-basket.rs) [](https://leetcode.cn/problems/maximum-tastiness-of-candy-basket/)
### 05
- 30: [delete-nodes-and-return-forest](./2023/05/30-delete-nodes-and-return-forest.rs) [](https://leetcode.cn/problems/delete-nodes-and-return-forest/)
- 26: [shortest-path-in-binary-matrix](./2023/05/26-shortest-path-in-binary-matrix.rs) [](https://leetcode.cn/problems/shortest-path-in-binary-matrix/)
- 25: [odd-string-difference](./2023/05/25-odd-string-difference.rs) [](https://leetcode.cn/problems/odd-string-difference/)
- 24: [frog-position-after-t-seconds](./2023/05/24-frog-position-after-t-seconds.rs) [](https://leetcode.cn/problems/frog-position-after-t-seconds/)
### 04
- 20: [make-array-strictly-increasing](./2023/04/20-make-array-strictly-increasing.py) [](https://leetcode.cn/problems/make-array-strictly-increasing/)
## 2022
### 08
- 09: [minimum-value-to-get-positive-step-by-step-sum](./2022/08/09-minimum-value-to-get-positive-step-by-step-sum.rs) [](https://leetcode.cn/problems/minimum-value-to-get-positive-step-by-step-sum/)
- 07: [exclusive-time-of-functions](./2022/08/07-exclusive-time-of-functions.rs) [](https://leetcode.cn/problems/exclusive-time-of-functions/)
- 06: [string-matching-in-an-array](./2022/08/06-string-matching-in-an-array.rs) [](https://leetcode.cn/problems/string-matching-in-an-array/)
- 05: [add-one-row-to-tree](./2022/08/05-add-one-row-to-tree.rs) [](https://leetcode.cn/problems/add-one-row-to-tree/)
- 04: [minimum-subsequence-in-non-increasing-order](./2022/08/04-minimum-subsequence-in-non-increasing-order.rs) [](https://leetcode.cn/problems/minimum-subsequence-in-non-increasing-order/)
- 03: [orderly-queue](./2022/08/03-orderly-queue.rs) [](https://leetcode.cn/problems/orderly-queue/)
- 02: [design-circular-queue](./2022/08/02-design-circular-queue.rs) [](https://leetcode.cn/problems/design-circular-queue/)
- 01: [generate-a-string-with-characters-that-have-odd-counts](./2022/08/01-generate-a-string-with-characters-that-have-odd-counts.rs) [](https://leetcode.cn/problems/generate-a-string-with-characters-that-have-odd-counts/)
### 07
- 31: [maximum-level-sum-of-a-binary-tree](./2022/07/31-maximum-level-sum-of-a-binary-tree.rs) [](https://leetcode.cn/problems/maximum-level-sum-of-a-binary-tree/)
- 28: [rank-transform-of-an-array](./2022/07/28-rank-transform-of-an-array.rs) [](https://leetcode.cn/problems/rank-transform-of-an-array/)
- 25: [complete-binary-tree-inserter](./2022/07/25-complete-binary-tree-inserter.rs) [](https://leetcode.cn/problems/complete-binary-tree-inserter/)
- 24: [distance-between-bus-stops](./2022/07/24-distance-between-bus-stops.go) [](https://leetcode.cn/problems/distance-between-bus-stops/)
- 23: [ur2n8P](./2022/07/23-ur2n8P.rs) [](https://leetcode.cn/problems/ur2n8P/)
- 22: [set-intersection-size-at-least-two](./2022/07/22-set-intersection-size-at-least-two.rs) [](https://leetcode.cn/problems/set-intersection-size-at-least-two/)
- 21: [binary-tree-pruning](./2022/07/21-binary-tree-pruning.rs) [](https://leetcode.cn/problems/binary-tree-pruning/)
- 20: [shift-2d-grid](./2022/07/20-shift-2d-grid.rs) [](https://leetcode.cn/problems/shift-2d-grid/)
- 19: [my-calendar-ii](./2022/07/19-my-calendar-ii.rs) [](https://leetcode.cn/problems/my-calendar-ii/)
- 17: [array-nesting](./2022/07/17-array-nesting.rs) [](https://leetcode.cn/problems/array-nesting/)
- 16: [qIsx9U](./2022/07/16-qIsx9U.rs) [](https://leetcode.cn/problems/qIsx9U/)
- 14: [prefix-and-suffix-search](./2022/07/14-prefix-and-suffix-search.rs) [](https://leetcode.cn/problems/prefix-and-suffix-search/)
- 12: [cells-with-odd-values-in-a-matrix](./2022/07/12-cells-with-odd-values-in-a-matrix.rs) [](https://leetcode.cn/problems/cells-with-odd-values-in-a-matrix/)
- 11: [implement-magic-dictionary](./2022/07/11-implement-magic-dictionary.rs) [](https://leetcode.cn/problems/implement-magic-dictionary/)
- 09: [length-of-longest-fibonacci-subsequence](./2022/07/09-length-of-longest-fibonacci-subsequence.rs) [](https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence/)
- 08: [minimum-cost-to-move-chips-to-the-same-position](./2022/07/08-minimum-cost-to-move-chips-to-the-same-position.rs) [](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position/)
- 07: [replace-words](./2022/07/07-replace-words.rs) [](https://leetcode.cn/problems/replace-words/)
- 05: [my-calendar-i](./2022/07/05-my-calendar-i.rs) [](https://leetcode.cn/problems/my-calendar-i/)
- 04: [minimum-absolute-difference](./2022/07/04-minimum-absolute-difference.rs) [](https://leetcode.cn/problems/minimum-absolute-difference/)
- 02: [minimum-number-of-refueling-stops](./2022/07/02-minimum-number-of-refueling-stops.rs) [](https://leetcode.cn/problems/minimum-number-of-refueling-stops/)
### 06
- 27: [longest-uncommon-subsequence-ii](./2022/06/27-longest-uncommon-subsequence-ii.rs) [](https://leetcode.cn/problems/longest-uncommon-subsequence-ii/)
- 26: [random-pick-with-blacklist](./2022/06/26-random-pick-with-blacklist.rs) [](https://leetcode.cn/problems/random-pick-with-blacklist/)
- 25: [JEj789](./2022/06/25-JEj789.rs) [](https://leetcode.cn/problems/JEj789/)
- 24: [find-largest-value-in-each-tree-row](./2022/06/24-find-largest-value-in-each-tree-row.rs) [](https://leetcode.cn/problems/find-largest-value-in-each-tree-row/)
- 23: [substring-with-concatenation-of-all-words](./2022/06/23-substring-with-concatenation-of-all-words.rs) [](https://leetcode.cn/problems/substring-with-concatenation-of-all-words/)
- 22: [find-bottom-left-tree-value](./2022/06/22-find-bottom-left-tree-value.rs) [](https://leetcode.cn/problems/find-bottom-left-tree-value/)
- 21: [defanging-an-ip-address](./2022/06/21-defanging-an-ip-address.rs) [](https://leetcode.cn/problems/defanging-an-ip-address/)
- 20: [range-module](./2022/06/20-range-module.rs) [](https://leetcode.cn/problems/range-module/)
- 19: [most-frequent-subtree-sum](./2022/06/19-most-frequent-subtree-sum.rs) [](https://leetcode.cn/problems/most-frequent-subtree-sum/)
- 18: [4ueAj6](./2022/06/18-4ueAj6.go) [](https://leetcode.cn/problems/4ueAj6/)
- 17: [duplicate-zeros](./2022/06/17-duplicate-zeros.rs) [](https://leetcode.cn/problems/duplicate-zeros/)
- 16: [k-diff-pairs-in-an-array](./2022/06/16-k-diff-pairs-in-an-array.rs) [](https://leetcode.cn/problems/k-diff-pairs-in-an-array/)
- 15: [find-k-th-smallest-pair-distance](./2022/06/15-find-k-th-smallest-pair-distance.rs) [](https://leetcode.cn/problems/find-k-th-smallest-pair-distance/)
- 14: [diagonal-traverse](./2022/06/14-diagonal-traverse.rs) [](https://leetcode.cn/problems/diagonal-traverse/)
- 13: [height-checker](./2022/06/13-height-checker.rs) [](https://leetcode.cn/problems/height-checker/)
- 12: [find-and-replace-pattern](./2022/06/12-find-and-replace-pattern.rs) [](https://leetcode.cn/problems/find-and-replace-pattern/)
- 11: [flip-string-to-monotone-increasing](./2022/06/11-flip-string-to-monotone-increasing.rs) [](https://leetcode.cn/problems/flip-string-to-monotone-increasing/)
- 10: [count-different-palindromic-subsequences](./2022/06/10-count-different-palindromic-subsequences.rs) [](https://leetcode.cn/problems/count-different-palindromic-subsequences/)
- 09: [random-point-in-non-overlapping-rectangles](./2022/06/09-random-point-in-non-overlapping-rectangles.rs) [](https://leetcode.cn/problems/random-point-in-non-overlapping-rectangles/)
- 08: [valid-boomerang](./2022/06/08-valid-boomerang.rs) [](https://leetcode.cn/problems/valid-boomerang/)
- 07: [koko-eating-bananas](./2022/06/07-koko-eating-bananas.rs) [](https://leetcode.cn/problems/koko-eating-bananas/)
- 06: [my-calendar-iii](./2022/06/06-my-calendar-iii.rs) [](https://leetcode.cn/problems/my-calendar-iii/)
- 05: [generate-random-point-in-a-circle](./2022/06/05-generate-random-point-in-a-circle.rs) [](https://leetcode.cn/problems/generate-random-point-in-a-circle/)
- 04: [unique-email-addresses](./2022/06/04-unique-email-addresses.rs) [](https://leetcode.cn/problems/unique-email-addresses/)
- 03: [consecutive-numbers-sum](./2022/06/03-consecutive-numbers-sum.rs) [](https://leetcode.cn/problems/consecutive-numbers-sum/)
- 02: [delete-node-in-a-bst](./2022/06/02-delete-node-in-a-bst.rs) [](https://leetcode.cn/problems/delete-node-in-a-bst/)
- 01: [matchsticks-to-square](./2022/06/01-matchsticks-to-square.rs) [](https://leetcode.cn/problems/matchsticks-to-square/)
### 05
- 31: [Jf1JuT](./2022/05/31-Jf1JuT.rs) [](https://leetcode.cn/problems/Jf1JuT/)
- 30: [sum-of-root-to-leaf-binary-numbers](./2022/05/30-sum-of-root-to-leaf-binary-numbers.rs) [](https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/)
- 29: [validate-ip-address](./2022/05/29-validate-ip-address.rs) [](https://leetcode.cn/problems/validate-ip-address/)
- 28: [remove-outermost-parentheses](./2022/05/28-remove-outermost-parentheses.rs) [](https://leetcode.cn/problems/remove-outermost-parentheses/)
- 27: [find-closest-lcci](./2022/05/27-find-closest-lcci.rs) [](https://leetcode.cn/problems/find-closest-lcci/)
- 26: [falling-squares](./2022/05/26-falling-squares.rs) [](https://leetcode.cn/problems/falling-squares/)
- 25: [unique-substrings-in-wraparound-string](./2022/05/25-unique-substrings-in-wraparound-string.rs) [](https://leetcode.cn/problems/unique-substrings-in-wraparound-string/)
- 24: [univalued-binary-tree](./2022/05/24-univalued-binary-tree.rs) [](https://leetcode.cn/problems/univalued-binary-tree/)
- 23: [cut-off-trees-for-golf-event](./2022/05/23-cut-off-trees-for-golf-event.rs) [](https://leetcode.cn/problems/cut-off-trees-for-golf-event/)
- 22: [can-i-win](./2022/05/22-can-i-win.rs) [](https://leetcode.cn/problems/can-i-win/)
- 21: [n-repeated-element-in-size-2n-array](./2022/05/21-n-repeated-element-in-size-2n-array.rs) [](https://leetcode.cn/problems/n-repeated-element-in-size-2n-array/)
- 20: [find-right-interval](./2022/05/20-find-right-interval.rs) [](https://leetcode.cn/problems/find-right-interval/)
- 19: [minimum-moves-to-equal-array-elements-ii](./2022/05/19-minimum-moves-to-equal-array-elements-ii.rs) [](https://leetcode.cn/problems/minimum-moves-to-equal-array-elements-ii/)
- 18: [kth-smallest-number-in-multiplication-table](./2022/05/18-kth-smallest-number-in-multiplication-table.rs) [](https://leetcode.cn/problems/kth-smallest-number-in-multiplication-table/)
- 17: [verifying-an-alien-dictionary](./2022/05/17-verifying-an-alien-dictionary.rs) [](https://leetcode.cn/problems/verifying-an-alien-dictionary/)
- 16: [successor-lcci](./2022/05/16-successor-lcci.go) [](https://leetcode.cn/problems/successor-lcci/)
- 15: [largest-triangle-area](./2022/05/15-largest-triangle-area.rs) [](https://leetcode.cn/problems/largest-triangle-area/)
- 14: [stickers-to-spell-word](./2022/05/14-stickers-to-spell-word.rs) [](https://leetcode.cn/problems/stickers-to-spell-word/)
- 13: [one-away-lcci](./2022/05/13-one-away-lcci.rs) [](https://leetcode.cn/problems/one-away-lcci/)
- 12: [delete-columns-to-make-sorted](./2022/05/12-delete-columns-to-make-sorted.rs) [](https://leetcode.cn/problems/delete-columns-to-make-sorted/)
- 11: [serialize-and-deserialize-bst](./2022/05/11-serialize-and-deserialize-bst.rs) [](https://leetcode.cn/problems/serialize-and-deserialize-bst/)
- 09: [di-string-match](./2022/05/09-di-string-match.rs) [](https://leetcode.cn/problems/di-string-match/)
- 08: [find-all-duplicates-in-an-array](./2022/05/08-find-all-duplicates-in-an-array.rs) [](https://leetcode.cn/problems/find-all-duplicates-in-an-array/)
- 07: [minimum-genetic-mutation](./2022/05/07-minimum-genetic-mutation.rs) [](https://leetcode.cn/problems/minimum-genetic-mutation/)
- 06: [number-of-recent-calls](./2022/05/06-number-of-recent-calls.rs) [](https://leetcode.cn/problems/number-of-recent-calls/)
- 05: [subarray-product-less-than-k](./2022/05/05-subarray-product-less-than-k.rs) [](https://leetcode.cn/problems/subarray-product-less-than-k/)
- 04: [find-the-winner-of-the-circular-game](./2022/05/04-find-the-winner-of-the-circular-game.rs) [](https://leetcode.cn/problems/find-the-winner-of-the-circular-game/)
- 03: [reorder-data-in-log-files](./2022/05/03-reorder-data-in-log-files.rs) [](https://leetcode.cn/problems/reorder-data-in-log-files/)
- 02: [tag-validator](./2022/05/02-tag-validator.rs) [](https://leetcode.cn/problems/tag-validator/)
- 01: [all-elements-in-two-binary-search-trees](./2022/05/01-all-elements-in-two-binary-search-trees.rs) [](https://leetcode.cn/problems/all-elements-in-two-binary-search-trees/)
### 04
- 30: [smallest-range-i](./2022/04/30-smallest-range-i.rs) [](https://leetcode.cn/problems/smallest-range-i/)
- 29: [construct-quad-tree](./2022/04/29-construct-quad-tree.go) [](https://leetcode.cn/problems/construct-quad-tree/)
- 28: [sort-array-by-parity](./2022/04/28-sort-array-by-parity.rs) [](https://leetcode.cn/problems/sort-array-by-parity/)
- 27: [pacific-atlantic-water-flow](./2022/04/27-pacific-atlantic-water-flow.rs) [](https://leetcode.cn/problems/pacific-atlantic-water-flow/)
- 26: [projection-area-of-3d-shapes](./2022/04/26-projection-area-of-3d-shapes.rs) [](https://leetcode.cn/problems/projection-area-of-3d-shapes/)
- 25: [random-pick-index](./2022/04/25-random-pick-index.rs) [](https://leetcode.cn/problems/random-pick-index/)
- 24: [binary-gap](./2022/04/24-binary-gap.rs) [](https://leetcode.cn/problems/binary-gap/)
- 23: [erect-the-fence](./2022/04/23-erect-the-fence.rs) [](https://leetcode.cn/problems/erect-the-fence/)
- 22: [rotate-function](./2022/04/22-rotate-function.rs) [](https://leetcode.cn/problems/rotate-function/)
- 21: [goat-latin](./2022/04/21-goat-latin.rs) [](https://leetcode.cn/problems/goat-latin/)
- 20: [longest-absolute-file-path](./2022/04/20-longest-absolute-file-path.rs) [](https://leetcode.cn/problems/longest-absolute-file-path/)
- 19: [shortest-distance-to-a-character](./2022/04/19-shortest-distance-to-a-character.rs) [](https://leetcode.cn/problems/shortest-distance-to-a-character/)
- 18: [lexicographical-numbers](./2022/04/18-lexicographical-numbers.rs) [](https://leetcode.cn/problems/lexicographical-numbers/)
- 17: [most-common-word](./2022/04/17-most-common-word.rs) [](https://leetcode.cn/problems/most-common-word/)
- 16: [largest-palindrome-product](./2022/04/16-largest-palindrome-product.rs) [](https://leetcode.cn/problems/largest-palindrome-product/)
- 15: [mini-parser](./2022/04/15-mini-parser.rs) [](https://leetcode.cn/problems/mini-parser/)
- 14: [richest-customer-wealth](./2022/04/14-richest-customer-wealth.rs) [](https://leetcode.cn/problems/richest-customer-wealth/)
- 13: [insert-delete-getrandom-o1](./2022/04/13-insert-delete-getrandom-o1.rs) [](https://leetcode.cn/problems/insert-delete-getrandom-o1/)
- 12: [number-of-lines-to-write-string](./2022/04/12-number-of-lines-to-write-string.rs) [](https://leetcode.cn/problems/number-of-lines-to-write-string/)
- 11: [count-numbers-with-unique-digits](./2022/04/11-count-numbers-with-unique-digits.rs) [](https://leetcode.cn/problems/count-numbers-with-unique-digits/)
- 10: [unique-morse-code-words](./2022/04/10-unique-morse-code-words.rs) [](https://leetcode.cn/problems/unique-morse-code-words/)
- 09: [reaching-points](./2022/04/09-reaching-points.rs) [](https://leetcode.cn/problems/reaching-points/)
- 08: [n-ary-tree-level-order-traversal](./2022/04/08-n-ary-tree-level-order-traversal.rs) [](https://leetcode.cn/problems/n-ary-tree-level-order-traversal/)
- 07: [rotate-string](./2022/04/07-rotate-string.rs) [](https://leetcode.cn/problems/rotate-string/)
- 06: [minimum-height-trees](./2022/04/06-minimum-height-trees.rs) [](https://leetcode.cn/problems/minimum-height-trees/)
- 05: [prime-number-of-set-bits-in-binary-representation](./2022/04/05-prime-number-of-set-bits-in-binary-representation.rs) [](https://leetcode.cn/problems/prime-number-of-set-bits-in-binary-representation/)
- 03: [find-smallest-letter-greater-than-target](./2022/04/03-find-smallest-letter-greater-than-target.rs) [](https://leetcode.cn/problems/find-smallest-letter-greater-than-target/)
- 01: [array-of-doubled-pairs](./2022/04/01-array-of-doubled-pairs.rs) [](https://leetcode.cn/problems/array-of-doubled-pairs/)
### 03
- 31: [self-dividing-numbers](./2022/03/31-self-dividing-numbers.rs) [](https://leetcode.cn/problems/self-dividing-numbers/)
- 29: [maximize-the-confusion-of-an-exam](./2022/03/29-maximize-the-confusion-of-an-exam.rs) [](https://leetcode.cn/problems/maximize-the-confusion-of-an-exam/)
- 28: [binary-number-with-alternating-bits](./2022/03/28-binary-number-with-alternating-bits.rs) [](https://leetcode.cn/problems/binary-number-with-alternating-bits/)
- 27: [find-missing-observations](./2022/03/27-find-missing-observations.rs) [](https://leetcode.cn/problems/find-missing-observations/)
- 26: [baseball-game](./2022/03/26-baseball-game.rs) [](https://leetcode.cn/problems/baseball-game/)
- 25: [factorial-trailing-zeroes](./2022/03/25-factorial-trailing-zeroes.rs) [](https://leetcode.cn/problems/factorial-trailing-zeroes/)
- 24: [image-smoother](./2022/03/24-image-smoother.rs) [](https://leetcode.cn/problems/image-smoother/)
- 23: [k-th-smallest-in-lexicographical-order](./2022/03/23-k-th-smallest-in-lexicographical-order.rs) [](https://leetcode.cn/problems/k-th-smallest-in-lexicographical-order/)
- 22: [remove-colored-pieces-if-both-neighbors-are-the-same-color](./2022/03/22-remove-colored-pieces-if-both-neighbors-are-the-same-color.rs) [](https://leetcode.cn/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/)
- 21: [two-sum-iv-input-is-a-bst](./2022/03/21-two-sum-iv-input-is-a-bst.rs) [](https://leetcode.cn/problems/two-sum-iv-input-is-a-bst/)
- 20: [the-time-when-the-network-becomes-idle](./2022/03/20-the-time-when-the-network-becomes-idle.rs) [](https://leetcode.cn/problems/the-time-when-the-network-becomes-idle/)
- 19: [construct-string-from-binary-tree](./2022/03/19-construct-string-from-binary-tree.rs) [](https://leetcode.cn/problems/construct-string-from-binary-tree/)
- 18: [simple-bank-system](./2022/03/18-simple-bank-system.rs) [](https://leetcode.cn/problems/simple-bank-system/)
- 17: [longest-word-in-dictionary](./2022/03/17-longest-word-in-dictionary.rs) [](https://leetcode.cn/problems/longest-word-in-dictionary/)
- 16: [all-oone-data-structure](./2022/03/16-all-oone-data-structure.go) [](https://leetcode.cn/problems/all-oone-data-structure/)
- 15: [count-number-of-maximum-bitwise-or-subsets](./2022/03/15-count-number-of-maximum-bitwise-or-subsets.rs) [](https://leetcode.cn/problems/count-number-of-maximum-bitwise-or-subsets/)
- 14: [minimum-index-sum-of-two-lists](./2022/03/14-minimum-index-sum-of-two-lists.rs) [](https://leetcode.cn/problems/minimum-index-sum-of-two-lists/)
- 13: [utf-8-validation](./2022/03/13-utf-8-validation.rs) [](https://leetcode.cn/problems/utf-8-validation/)
- 12: [n-ary-tree-postorder-traversal](./2022/03/12-n-ary-tree-postorder-traversal.go) [](https://leetcode.cn/problems/n-ary-tree-postorder-traversal/)
- 11: [count-nodes-with-the-highest-score](./2022/03/11-count-nodes-with-the-highest-score.rs) [](https://leetcode.cn/problems/count-nodes-with-the-highest-score/)
- 10: [n-ary-tree-preorder-traversal](./2022/03/10-n-ary-tree-preorder-traversal.go) [](https://leetcode.cn/problems/n-ary-tree-preorder-traversal/)
- 09: [smallest-rotation-with-highest-score](./2022/03/09-smallest-rotation-with-highest-score.rs) [](https://leetcode.cn/problems/smallest-rotation-with-highest-score/)
- 08: [plates-between-candles](./2022/03/08-plates-between-candles.go) [](https://leetcode.cn/problems/plates-between-candles/)
- 06: [find-good-days-to-rob-the-bank](./2022/03/06-find-good-days-to-rob-the-bank.go) [](https://leetcode.cn/problems/find-good-days-to-rob-the-bank/)
- 05: [longest-uncommon-subsequence-i](./2022/03/05-longest-uncommon-subsequence-i.cpp) [](https://leetcode.cn/problems/longest-uncommon-subsequence-i/)
- 04: [sum-of-subarray-ranges](./2022/03/04-sum-of-subarray-ranges.cpp) [](https://leetcode.cn/problems/sum-of-subarray-ranges/)
- 03: [add-digits](./2022/03/03-add-digits.cpp) [](https://leetcode.cn/problems/add-digits/)
- 01: [zigzag-conversion](./2022/03/01-zigzag-conversion.cpp) [](https://leetcode.cn/problems/zigzag-conversion/)
### 02
- 28: [maximum-number-of-achievable-transfer-requests](./2022/02/28-maximum-number-of-achievable-transfer-requests.cpp) [](https://leetcode.cn/problems/maximum-number-of-achievable-transfer-requests/)
- 27: [optimal-division](./2022/02/27-optimal-division.cpp) [](https://leetcode.cn/problems/optimal-division/)
- 26: [maximum-difference-between-increasing-elements](./2022/02/26-maximum-difference-between-increasing-elements.cpp) [](https://leetcode.cn/problems/maximum-difference-between-increasing-elements/)
- 25: [complex-number-multiplication](./2022/02/25-complex-number-multiplication.cpp) [](https://leetcode.cn/problems/complex-number-multiplication/)
- 24: [where-will-the-ball-fall](./2022/02/24-where-will-the-ball-fall.cpp) [](https://leetcode.cn/problems/where-will-the-ball-fall/)
- 23: [reverse-only-letters](./2022/02/23-reverse-only-letters.cpp) [](https://leetcode.cn/problems/reverse-only-letters/)
- 21: [push-dominoes](./2022/02/21-push-dominoes.cpp) [](https://leetcode.cn/problems/push-dominoes/)
- 19: [pancake-sorting](./2022/02/19-pancake-sorting.go) [](https://leetcode.cn/problems/pancake-sorting/)
- 18: [find-center-of-star-graph](./2022/02/18-find-center-of-star-graph.go) [](https://leetcode.cn/problems/find-center-of-star-graph/)
- 15: [lucky-numbers-in-a-matrix](./2022/02/15-lucky-numbers-in-a-matrix.rs) [](https://leetcode.cn/problems/lucky-numbers-in-a-matrix/)
- 14: [single-element-in-a-sorted-array](./2022/02/14-single-element-in-a-sorted-array.rs) [](https://leetcode.cn/problems/single-element-in-a-sorted-array/)
- 13: [maximum-number-of-balloons](./2022/02/13-maximum-number-of-balloons.rs) [](https://leetcode.cn/problems/maximum-number-of-balloons/)
- 12: [number-of-enclaves](./2022/02/12-number-of-enclaves.rs) [](https://leetcode.cn/problems/number-of-enclaves/)
- 11: [minimum-difference-between-highest-and-lowest-of-k-scores](./2022/02/11-minimum-difference-between-highest-and-lowest-of-k-scores.rs) [](https://leetcode.cn/problems/minimum-difference-between-highest-and-lowest-of-k-scores/)
- 10: [simplified-fractions](./2022/02/10-simplified-fractions.rs) [](https://leetcode.cn/problems/simplified-fractions/)
- 09: [count-number-of-pairs-with-absolute-difference-k](./2022/02/09-count-number-of-pairs-with-absolute-difference-k.rs) [](https://leetcode.cn/problems/count-number-of-pairs-with-absolute-difference-k/)
- 06: [sum-of-unique-elements](./2022/02/06-sum-of-unique-elements.go) [](https://leetcode.cn/problems/sum-of-unique-elements/)
- 04: [number-of-rectangles-that-can-form-the-largest-square](./2022/02/04-number-of-rectangles-that-can-form-the-largest-square.go) [](https://leetcode.cn/problems/number-of-rectangles-that-can-form-the-largest-square/)
### 01
- 22: [remove-palindromic-subsequences](./2022/01/22-remove-palindromic-subsequences.go) [](https://leetcode.cn/problems/remove-palindromic-subsequences/)
- 07: [maximum-nesting-depth-of-the-parentheses](./2022/01/07-maximum-nesting-depth-of-the-parentheses.rs) [](https://leetcode.cn/problems/maximum-nesting-depth-of-the-parentheses/)
- 01: [convert-1d-array-into-2d-array](./2022/01/01-convert-1d-array-into-2d-array.rs) [](https://leetcode.cn/problems/convert-1d-array-into-2d-array/)