https://github.com/themysterysolver/leet-and-fun

A collection of LeetCode questions to ace the coding interview!
https://github.com/themysterysolver/leet-and-fun

c-language data-structures db java javascript leetcode mysql pandas-python python python3

Last synced: 6 months ago
JSON representation

A collection of LeetCode questions to ace the coding interview!

• Host: GitHub
• URL: https://github.com/themysterysolver/leet-and-fun
• Owner: themysterysolver
• License: gpl-3.0
• Created: 2024-08-31T08:34:18.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2025-03-30T16:16:15.000Z (over 1 year ago)
• Last Synced: 2025-03-30T17:23:21.087Z (over 1 year ago)
• Topics: c-language, data-structures, db, java, javascript, leetcode, mysql, pandas-python, python, python3
• Language: Python
• Homepage:
• Size: 14.9 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# LEET-AND-FUN

A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

# LeetCode Topics

## Math

|  |

| ------- |

| [0002-add-two-numbers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0002-add-two-numbers) |

| [0007-reverse-integer](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0007-reverse-integer) |

| [0009-palindrome-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0009-palindrome-number) |

| [0012-integer-to-roman](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0012-integer-to-roman) |

| [0013-roman-to-integer](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0013-roman-to-integer) |

| [0029-divide-two-integers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0029-divide-two-integers) |

| [0043-multiply-strings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0043-multiply-strings) |

| [0048-rotate-image](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0048-rotate-image) |

| [0050-powx-n](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0050-powx-n) |

| [0062-unique-paths](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0062-unique-paths) |

| [0066-plus-one](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0066-plus-one) |

| [0069-sqrtx](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0069-sqrtx) |

| [0070-climbing-stairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0070-climbing-stairs) |

| [0149-max-points-on-a-line](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0149-max-points-on-a-line) |

| [0150-evaluate-reverse-polish-notation](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0150-evaluate-reverse-polish-notation) |

| [0166-fraction-to-recurring-decimal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0166-fraction-to-recurring-decimal) |

| [0168-excel-sheet-column-title](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0168-excel-sheet-column-title) |

| [0171-excel-sheet-column-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0171-excel-sheet-column-number) |

| [0172-factorial-trailing-zeroes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0172-factorial-trailing-zeroes) |

| [0189-rotate-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0189-rotate-array) |

| [0204-count-primes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0204-count-primes) |

| [0223-rectangle-area](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0223-rectangle-area) |

| [0224-basic-calculator](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0224-basic-calculator) |

| [0227-basic-calculator-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0227-basic-calculator-ii) |

| [0231-power-of-two](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0231-power-of-two) |

| [0258-add-digits](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0258-add-digits) |

| [0263-ugly-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0263-ugly-number) |

| [0268-missing-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0268-missing-number) |

| [0273-integer-to-english-words](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0273-integer-to-english-words) |

| [0282-expression-add-operators](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0282-expression-add-operators) |

| [0292-nim-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0292-nim-game) |

| [0326-power-of-three](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0326-power-of-three) |

| [0342-power-of-four](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0342-power-of-four) |

| [0357-count-numbers-with-unique-digits](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0357-count-numbers-with-unique-digits) |

| [0367-valid-perfect-square](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0367-valid-perfect-square) |

| [0368-largest-divisible-subset](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0368-largest-divisible-subset) |

| [0382-linked-list-random-node](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0382-linked-list-random-node) |

| [0384-shuffle-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0384-shuffle-an-array) |

| [0391-perfect-rectangle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0391-perfect-rectangle) |

| [0398-random-pick-index](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0398-random-pick-index) |

| [0412-fizz-buzz](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0412-fizz-buzz) |

| [0415-add-strings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0415-add-strings) |

| [0441-arranging-coins](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0441-arranging-coins) |

| [0445-add-two-numbers-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0445-add-two-numbers-ii) |

| [0462-minimum-moves-to-equal-array-elements-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0462-minimum-moves-to-equal-array-elements-ii) |

| [0477-total-hamming-distance](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0477-total-hamming-distance) |

| [0492-construct-the-rectangle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0492-construct-the-rectangle) |

| [0504-base-7](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0504-base-7) |

| [0507-perfect-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0507-perfect-number) |

| [0539-minimum-time-difference](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0539-minimum-time-difference) |

| [0593-valid-square](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0593-valid-square) |

| [0633-sum-of-square-numbers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0633-sum-of-square-numbers) |

| [0650-2-keys-keyboard](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0650-2-keys-keyboard) |

| [0670-maximum-swap](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0670-maximum-swap) |

| [0797-rabbits-in-forest](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0797-rabbits-in-forest) |

| [0805-escape-the-ghosts](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0805-escape-the-ghosts) |

| [0909-stone-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0909-stone-game) |

| [0915-generate-random-point-in-a-circle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0915-generate-random-point-in-a-circle) |

| [0919-projection-area-of-3d-shapes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0919-projection-area-of-3d-shapes) |

| [1006-clumsy-factorial](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1006-clumsy-factorial) |

| [1010-powerful-integers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1010-powerful-integers) |

| [1013-fibonacci-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1013-fibonacci-number) |

| [1033-broken-calculator](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1033-broken-calculator) |

| [1119-robot-bounded-in-circle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1119-robot-bounded-in-circle) |

| [1146-greatest-common-divisor-of-strings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1146-greatest-common-divisor-of-strings) |

| [1236-n-th-tribonacci-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1236-n-th-tribonacci-number) |

| [1252-cells-with-odd-values-in-a-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1252-cells-with-odd-values-in-a-matrix) |

| [1260-day-of-the-year](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1260-day-of-the-year) |

| [1266-minimum-time-visiting-all-points](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1266-minimum-time-visiting-all-points) |

| [1284-four-divisors](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1284-four-divisors) |

| [1349-check-if-it-is-a-straight-line](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1349-check-if-it-is-a-straight-line) |

| [1421-find-numbers-with-even-number-of-digits](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1421-find-numbers-with-even-number-of-digits) |

| [1426-find-n-unique-integers-sum-up-to-zero](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1426-find-n-unique-integers-sum-up-to-zero) |

| [1430-find-the-k-beauty-of-a-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1430-find-the-k-beauty-of-a-number) |

| [1440-convert-integer-to-the-sum-of-two-no-zero-integers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1440-convert-integer-to-the-sum-of-two-no-zero-integers) |

| [1446-angle-between-hands-of-a-clock](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1446-angle-between-hands-of-a-clock) |

| [1477-product-of-the-last-k-numbers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1477-product-of-the-last-k-numbers) |

| [1523-count-odd-numbers-in-an-interval-range](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1523-count-odd-numbers-in-an-interval-range) |

| [1642-water-bottles](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1642-water-bottles) |

| [1817-calculate-money-in-leetcode-bank](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1817-calculate-money-in-leetcode-bank) |

| [1885-count-number-of-homogenous-substrings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1885-count-number-of-homogenous-substrings) |

| [1889-check-if-number-is-a-sum-of-powers-of-three](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1889-check-if-number-is-a-sum-of-powers-of-three) |

| [1920-determine-color-of-a-chessboard-square](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1920-determine-color-of-a-chessboard-square) |

| [1925-count-nice-pairs-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1925-count-nice-pairs-in-an-array) |

| [1951-find-the-winner-of-the-circular-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1951-find-the-winner-of-the-circular-game) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2083-three-divisors](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2083-three-divisors) |

| [2106-find-greatest-common-divisor-of-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2106-find-greatest-common-divisor-of-array) |

| [2110-number-of-smooth-descent-periods-of-a-stock](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2110-number-of-smooth-descent-periods-of-a-stock) |

| [2129-number-of-pairs-of-interchangeable-rectangles](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2129-number-of-pairs-of-interchangeable-rectangles) |

| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |

| [2206-detonate-the-maximum-bombs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2206-detonate-the-maximum-bombs) |

| [2238-a-number-after-a-double-reversal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2238-a-number-after-a-double-reversal) |

| [2244-number-of-laser-beams-in-a-bank](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2244-number-of-laser-beams-in-a-bank) |

| [2278-find-three-consecutive-integers-that-sum-to-a-given-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2278-find-three-consecutive-integers-that-sum-to-a-given-number) |

| [2284-smallest-value-of-the-rearranged-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2284-smallest-value-of-the-rearranged-number) |

| [2307-replace-non-coprime-numbers-in-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2307-replace-non-coprime-numbers-in-array) |

| [2367-minimum-lines-to-represent-a-line-chart](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2367-minimum-lines-to-represent-a-line-chart) |

| [2383-add-two-integers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2383-add-two-integers) |

| [2432-number-of-zero-filled-subarrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2432-number-of-zero-filled-subarrays) |

| [2448-count-number-of-bad-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2448-count-number-of-bad-pairs) |

| [2481-strictly-palindromic-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2481-strictly-palindromic-number) |

| [2491-smallest-even-multiple](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2491-smallest-even-multiple) |

| [2525-count-number-of-distinct-integers-after-reverse-operations](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2525-count-number-of-distinct-integers-after-reverse-operations) |

| [2544-minimum-addition-to-make-integer-beautiful](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2544-minimum-addition-to-make-integer-beautiful) |

| [2575-minimum-cuts-to-divide-a-circle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2575-minimum-cuts-to-divide-a-circle) |

| [2610-closest-prime-numbers-in-range](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2610-closest-prime-numbers-in-range) |

| [2645-pass-the-pillow](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2645-pass-the-pillow) |

| [2680-count-collisions-of-monkeys-on-a-polygon](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2680-count-collisions-of-monkeys-on-a-polygon) |

| [2752-sum-multiples](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2752-sum-multiples) |

| [2802-find-the-punishment-number-of-an-integer](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2802-find-the-punishment-number-of-an-integer) |

| [2824-check-if-the-number-is-fascinating](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2824-check-if-the-number-is-fascinating) |

| [2857-total-distance-traveled](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2857-total-distance-traveled) |

| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |

| [2998-count-symmetric-integers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2998-count-symmetric-integers) |

| [3172-divisible-and-non-divisible-sums-difference](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3172-divisible-and-non-divisible-sums-difference) |

| [3199-distribute-candies-among-children-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3199-distribute-candies-among-children-i) |

| [3227-find-missing-and-repeated-values](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3227-find-missing-and-repeated-values) |

| [3321-type-of-triangle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3321-type-of-triangle) |

| [3336-water-bottles-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3336-water-bottles-ii) |

| [3371-harshad-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3371-harshad-number) |

| [3416-sum-of-digit-differences-of-all-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3416-sum-of-digit-differences-of-all-pairs) |

| [3433-count-mentions-per-user](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3433-count-mentions-per-user) |

| [3462-vowels-game-in-a-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3462-vowels-game-in-a-string) |

| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |

| [3629-total-characters-in-string-after-transformations-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3629-total-characters-in-string-after-transformations-i) |

| [3676-smallest-number-with-all-set-bits](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3676-smallest-number-with-all-set-bits) |

| [3744-minimum-operations-to-make-array-elements-zero](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3744-minimum-operations-to-make-array-elements-zero) |

| [3830-find-closest-person](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3830-find-closest-person) |

## Greedy

|  |

| ------- |

| [0011-container-with-most-water](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0011-container-with-most-water) |

| [0045-jump-game-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0045-jump-game-ii) |

| [0055-jump-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0055-jump-game) |

| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |

| [0135-candy](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0135-candy) |

| [0179-largest-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0179-largest-number) |

| [0316-remove-duplicate-letters](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0316-remove-duplicate-letters) |

| [0334-increasing-triplet-subsequence](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0334-increasing-triplet-subsequence) |

| [0402-remove-k-digits](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0402-remove-k-digits) |

| [0435-non-overlapping-intervals](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0435-non-overlapping-intervals) |

| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |

| [0455-assign-cookies](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0455-assign-cookies) |

| [0605-can-place-flowers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0605-can-place-flowers) |

| [0611-valid-triangle-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0611-valid-triangle-number) |

| [0621-task-scheduler](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0621-task-scheduler) |

| [0624-maximum-distance-in-arrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0624-maximum-distance-in-arrays) |

| [0649-dota2-senate](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0649-dota2-senate) |

| [0670-maximum-swap](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0670-maximum-swap) |

| [0678-valid-parenthesis-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0678-valid-parenthesis-string) |

| [0680-valid-palindrome-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0680-valid-palindrome-ii) |

| [0714-best-time-to-buy-and-sell-stock-with-transaction-fee](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0714-best-time-to-buy-and-sell-stock-with-transaction-fee) |

| [0768-partition-labels](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0768-partition-labels) |

| [0778-reorganize-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0778-reorganize-string) |

| [0780-max-chunks-to-make-sorted](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0780-max-chunks-to-make-sorted) |

| [0797-rabbits-in-forest](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0797-rabbits-in-forest) |

| [0825-max-increase-to-keep-city-skyline](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0825-max-increase-to-keep-city-skyline) |

| [0876-hand-of-straights](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0876-hand-of-straights) |

| [0890-lemonade-change](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0890-lemonade-change) |

| [0917-boats-to-save-people](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0917-boats-to-save-people) |

| [0957-minimum-add-to-make-parentheses-valid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0957-minimum-add-to-make-parentheses-valid) |

| [0979-di-string-match](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0979-di-string-match) |

| [1033-broken-calculator](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1033-broken-calculator) |

| [1049-minimum-domino-rotations-for-equal-row](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1049-minimum-domino-rotations-for-equal-row) |

| [1169-largest-values-from-labels](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1169-largest-values-from-labels) |

| [1252-break-a-palindrome](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1252-break-a-palindrome) |

| [1304-longest-happy-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1304-longest-happy-string) |

| [1346-maximize-the-topmost-element-after-k-moves](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1346-maximize-the-topmost-element-after-k-moves) |

| [1422-divide-array-in-sets-of-k-consecutive-numbers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1422-divide-array-in-sets-of-k-consecutive-numbers) |

| [1499-maximum-performance-of-a-team](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1499-maximum-performance-of-a-team) |

| [1502-construct-k-palindrome-strings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1502-construct-k-palindrome-strings) |

| [1575-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1575-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts) |

| [1647-minimum-deletions-to-make-character-frequencies-unique](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1647-minimum-deletions-to-make-character-frequencies-unique) |

| [1762-furthest-building-you-can-reach](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1762-furthest-building-you-can-reach) |

| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |

| [1818-maximum-score-from-removing-substrings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1818-maximum-score-from-removing-substrings) |

| [1834-minimum-number-of-people-to-teach](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1834-minimum-number-of-people-to-teach) |

| [1880-largest-merge-of-two-strings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1880-largest-merge-of-two-strings) |

| [1917-maximum-average-pass-ratio](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1917-maximum-average-pass-ratio) |

| [1988-minimize-maximum-pair-sum-in-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1988-minimize-maximum-pair-sum-in-array) |

| [2026-merge-triplets-to-form-target-triplet](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2026-merge-triplets-to-form-target-triplet) |

| [2089-maximum-matrix-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2089-maximum-matrix-sum) |

| [2091-removing-minimum-and-maximum-from-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2091-removing-minimum-and-maximum-from-array) |

| [2094-remove-stones-to-minimize-the-total](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2094-remove-stones-to-minimize-the-total) |

| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |

| [2154-minimum-moves-to-convert-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2154-minimum-moves-to-convert-string) |

| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |

| [2245-destroying-asteroids](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2245-destroying-asteroids) |

| [2300-construct-string-with-repeat-limit](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2300-construct-string-with-repeat-limit) |

| [2345-minimum-number-of-operations-to-convert-time](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2345-minimum-number-of-operations-to-convert-time) |

| [2456-construct-smallest-number-from-di-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2456-construct-smallest-number-from-di-string) |

| [2487-optimal-partition-of-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2487-optimal-partition-of-string) |

| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |

| [2509-minimize-xor](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2509-minimize-xor) |

| [2544-minimum-addition-to-make-integer-beautiful](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2544-minimum-addition-to-make-integer-beautiful) |

| [2590-maximum-star-sum-of-a-graph](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2590-maximum-star-sum-of-a-graph) |

| [2616-maximal-score-after-applying-k-operations](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2616-maximal-score-after-applying-k-operations) |

| [2636-maximum-subsequence-score](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2636-maximum-subsequence-score) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2681-put-marbles-in-bags](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2681-put-marbles-in-bags) |

| [2816-lexicographically-smallest-palindrome](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2816-lexicographically-smallest-palindrome) |

| [3195-separate-black-and-white-balls](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3195-separate-black-and-white-balls) |

| [3262-find-polygon-with-the-largest-perimeter](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3262-find-polygon-with-the-largest-perimeter) |

| [3493-maximum-number-of-operations-to-move-ones-to-the-end](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3493-maximum-number-of-operations-to-move-ones-to-the-end) |

| [3788-maximum-unique-subarray-sum-after-deletion](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3788-maximum-unique-subarray-sum-after-deletion) |

| [3894-maximize-ysum-by-picking-a-triplet-of-distinct-xvalues](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3894-maximize-ysum-by-picking-a-triplet-of-distinct-xvalues) |

## Linked List

|  |

| ------- |

| [0002-add-two-numbers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0002-add-two-numbers) |

| [0019-remove-nth-node-from-end-of-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0019-remove-nth-node-from-end-of-list) |

| [0021-merge-two-sorted-lists](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0021-merge-two-sorted-lists) |

| [0023-merge-k-sorted-lists](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0023-merge-k-sorted-lists) |

| [0024-swap-nodes-in-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0024-swap-nodes-in-pairs) |

| [0025-reverse-nodes-in-k-group](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0025-reverse-nodes-in-k-group) |

| [0061-rotate-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0061-rotate-list) |

| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0082-remove-duplicates-from-sorted-list-ii) |

| [0083-remove-duplicates-from-sorted-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0083-remove-duplicates-from-sorted-list) |

| [0086-partition-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0086-partition-list) |

| [0092-reverse-linked-list-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0092-reverse-linked-list-ii) |

| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0109-convert-sorted-list-to-binary-search-tree) |

| [0114-flatten-binary-tree-to-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0114-flatten-binary-tree-to-linked-list) |

| [0116-populating-next-right-pointers-in-each-node](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0116-populating-next-right-pointers-in-each-node) |

| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |

| [0138-copy-list-with-random-pointer](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0138-copy-list-with-random-pointer) |

| [0141-linked-list-cycle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0141-linked-list-cycle) |

| [0142-linked-list-cycle-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0142-linked-list-cycle-ii) |

| [0143-reorder-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0143-reorder-list) |

| [0147-insertion-sort-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0147-insertion-sort-list) |

| [0148-sort-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0148-sort-list) |

| [0160-intersection-of-two-linked-lists](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0160-intersection-of-two-linked-lists) |

| [0206-reverse-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0206-reverse-linked-list) |

| [0234-palindrome-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0234-palindrome-linked-list) |

| [0237-delete-node-in-a-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0237-delete-node-in-a-linked-list) |

| [0328-odd-even-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0328-odd-even-linked-list) |

| [0382-linked-list-random-node](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0382-linked-list-random-node) |

| [0445-add-two-numbers-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0445-add-two-numbers-ii) |

| [0528-swapping-nodes-in-a-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0528-swapping-nodes-in-a-linked-list) |

| [0766-flatten-a-multilevel-doubly-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0766-flatten-a-multilevel-doubly-linked-list) |

| [0817-design-hashmap](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0817-design-hashmap) |

| [0835-linked-list-components](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0835-linked-list-components) |

| [0860-design-circular-queue](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0860-design-circular-queue) |

| [0908-middle-of-the-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0908-middle-of-the-linked-list) |

| [1072-next-greater-node-in-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1072-next-greater-node-in-linked-list) |

| [1582-design-browser-history](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1582-design-browser-history) |

| [1767-design-front-middle-back-queue](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1767-design-front-middle-back-queue) |

| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2216-delete-the-middle-node-of-a-linked-list) |

| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2236-maximum-twin-sum-of-a-linked-list) |

| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |

## Stack

|  |

| ------- |

| [0020-valid-parentheses](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0020-valid-parentheses) |

| [0042-trapping-rain-water](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0042-trapping-rain-water) |

| [0071-simplify-path](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0071-simplify-path) |

| [0094-binary-tree-inorder-traversal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0094-binary-tree-inorder-traversal) |

| [0114-flatten-binary-tree-to-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0114-flatten-binary-tree-to-linked-list) |

| [0143-reorder-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0143-reorder-list) |

| [0144-binary-tree-preorder-traversal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0144-binary-tree-preorder-traversal) |

| [0145-binary-tree-postorder-traversal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0145-binary-tree-postorder-traversal) |

| [0150-evaluate-reverse-polish-notation](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0150-evaluate-reverse-polish-notation) |

| [0155-min-stack](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0155-min-stack) |

| [0173-binary-search-tree-iterator](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0173-binary-search-tree-iterator) |

| [0224-basic-calculator](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0224-basic-calculator) |

| [0225-implement-stack-using-queues](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0225-implement-stack-using-queues) |

| [0227-basic-calculator-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0227-basic-calculator-ii) |

| [0232-implement-queue-using-stacks](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0232-implement-queue-using-stacks) |

| [0234-palindrome-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0234-palindrome-linked-list) |

| [0316-remove-duplicate-letters](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0316-remove-duplicate-letters) |

| [0331-verify-preorder-serialization-of-a-binary-tree](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0331-verify-preorder-serialization-of-a-binary-tree) |

| [0394-decode-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0394-decode-string) |

| [0402-remove-k-digits](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0402-remove-k-digits) |

| [0445-add-two-numbers-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0445-add-two-numbers-ii) |

| [0496-next-greater-element-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0496-next-greater-element-i) |

| [0636-exclusive-time-of-functions](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0636-exclusive-time-of-functions) |

| [0678-valid-parenthesis-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0678-valid-parenthesis-string) |

| [0682-baseball-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0682-baseball-game) |

| [0726-number-of-atoms](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0726-number-of-atoms) |

| [0735-asteroid-collision](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0735-asteroid-collision) |

| [0739-daily-temperatures](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0739-daily-temperatures) |

| [0775-n-ary-tree-preorder-traversal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0775-n-ary-tree-preorder-traversal) |

| [0776-n-ary-tree-postorder-traversal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0776-n-ary-tree-postorder-traversal) |

| [0780-max-chunks-to-make-sorted](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0780-max-chunks-to-make-sorted) |

| [0957-minimum-add-to-make-parentheses-valid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0957-minimum-add-to-make-parentheses-valid) |

| [0983-validate-stack-sequences](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0983-validate-stack-sequences) |

| [1002-maximum-width-ramp](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1002-maximum-width-ramp) |

| [1006-clumsy-factorial](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1006-clumsy-factorial) |

| [1045-check-if-word-is-valid-after-substitutions](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1045-check-if-word-is-valid-after-substitutions) |

| [1072-next-greater-node-in-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1072-next-greater-node-in-linked-list) |

| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1128-remove-all-adjacent-duplicates-in-string) |

| [1197-parsing-a-boolean-expression](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1197-parsing-a-boolean-expression) |

| [1320-remove-all-adjacent-duplicates-in-string-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1320-remove-all-adjacent-duplicates-in-string-ii) |

| [1371-minimum-remove-to-make-valid-parentheses](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1371-minimum-remove-to-make-valid-parentheses) |

| [1441-build-an-array-with-stack-operations](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1441-build-an-array-with-stack-operations) |

| [1582-design-browser-history](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1582-design-browser-history) |

| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |

| [1720-crawler-log-folder](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1720-crawler-log-folder) |

| [1818-maximum-score-from-removing-substrings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1818-maximum-score-from-removing-substrings) |

| [2021-remove-all-occurrences-of-a-substring](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2021-remove-all-occurrences-of-a-substring) |

| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |

| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |

| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2236-maximum-twin-sum-of-a-linked-list) |

| [2307-replace-non-coprime-numbers-in-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2307-replace-non-coprime-numbers-in-array) |

| [2317-count-collisions-on-a-road](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2317-count-collisions-on-a-road) |

| [2456-construct-smallest-number-from-di-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2456-construct-smallest-number-from-di-string) |

| [2470-removing-stars-from-a-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2470-removing-stars-from-a-string) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3447-clear-digits](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3447-clear-digits) |

## Recursion

|  |

| ------- |

| [0002-add-two-numbers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0002-add-two-numbers) |

| [0010-regular-expression-matching](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0010-regular-expression-matching) |

| [0021-merge-two-sorted-lists](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0021-merge-two-sorted-lists) |

| [0024-swap-nodes-in-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0024-swap-nodes-in-pairs) |

| [0025-reverse-nodes-in-k-group](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0025-reverse-nodes-in-k-group) |

| [0050-powx-n](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0050-powx-n) |

| [0143-reorder-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0143-reorder-list) |

| [0206-reverse-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0206-reverse-linked-list) |

| [0224-basic-calculator](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0224-basic-calculator) |

| [0231-power-of-two](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0231-power-of-two) |

| [0234-palindrome-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0234-palindrome-linked-list) |

| [0273-integer-to-english-words](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0273-integer-to-english-words) |

| [0326-power-of-three](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0326-power-of-three) |

| [0342-power-of-four](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0342-power-of-four) |

| [0394-decode-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0394-decode-string) |

| [1013-fibonacci-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1013-fibonacci-number) |

| [1197-parsing-a-boolean-expression](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1197-parsing-a-boolean-expression) |

| [1667-find-kth-bit-in-nth-binary-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1667-find-kth-bit-in-nth-binary-string) |

| [1951-find-the-winner-of-the-circular-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1951-find-the-winner-of-the-circular-game) |

| [2680-count-collisions-of-monkeys-on-a-polygon](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2680-count-collisions-of-monkeys-on-a-polygon) |

## Array

|  |

| ------- |

| [0001-two-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0001-two-sum) |

| [0004-median-of-two-sorted-arrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0004-median-of-two-sorted-arrays) |

| [0011-container-with-most-water](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0011-container-with-most-water) |

| [0014-longest-common-prefix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0014-longest-common-prefix) |

| [0015-3sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0015-3sum) |

| [0018-4sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0018-4sum) |

| [0026-remove-duplicates-from-sorted-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0026-remove-duplicates-from-sorted-array) |

| [0027-remove-element](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0027-remove-element) |

| [0033-search-in-rotated-sorted-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0033-search-in-rotated-sorted-array) |

| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |

| [0035-search-insert-position](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0035-search-insert-position) |

| [0036-valid-sudoku](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0036-valid-sudoku) |

| [0037-sudoku-solver](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0037-sudoku-solver) |

| [0039-combination-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0039-combination-sum) |

| [0040-combination-sum-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0040-combination-sum-ii) |

| [0041-first-missing-positive](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0041-first-missing-positive) |

| [0042-trapping-rain-water](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0042-trapping-rain-water) |

| [0045-jump-game-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0045-jump-game-ii) |

| [0046-permutations](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0046-permutations) |

| [0047-permutations-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0047-permutations-ii) |

| [0048-rotate-image](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0048-rotate-image) |

| [0049-group-anagrams](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0049-group-anagrams) |

| [0051-n-queens](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0051-n-queens) |

| [0053-maximum-subarray](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0053-maximum-subarray) |

| [0054-spiral-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0054-spiral-matrix) |

| [0055-jump-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0055-jump-game) |

| [0056-merge-intervals](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0056-merge-intervals) |

| [0057-insert-interval](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0057-insert-interval) |

| [0059-spiral-matrix-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0059-spiral-matrix-ii) |

| [0063-unique-paths-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0063-unique-paths-ii) |

| [0064-minimum-path-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0064-minimum-path-sum) |

| [0066-plus-one](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0066-plus-one) |

| [0068-text-justification](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0068-text-justification) |

| [0073-set-matrix-zeroes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0073-set-matrix-zeroes) |

| [0074-search-a-2d-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0074-search-a-2d-matrix) |

| [0075-sort-colors](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0075-sort-colors) |

| [0078-subsets](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0078-subsets) |

| [0079-word-search](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0079-word-search) |

| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0080-remove-duplicates-from-sorted-array-ii) |

| [0081-search-in-rotated-sorted-array-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0081-search-in-rotated-sorted-array-ii) |

| [0090-subsets-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0090-subsets-ii) |

| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |

| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |

| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0108-convert-sorted-array-to-binary-search-tree) |

| [0118-pascals-triangle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0118-pascals-triangle) |

| [0119-pascals-triangle-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0119-pascals-triangle-ii) |

| [0120-triangle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0120-triangle) |

| [0121-best-time-to-buy-and-sell-stock](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0121-best-time-to-buy-and-sell-stock) |

| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |

| [0128-longest-consecutive-sequence](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0128-longest-consecutive-sequence) |

| [0130-surrounded-regions](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0130-surrounded-regions) |

| [0135-candy](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0135-candy) |

| [0136-single-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0136-single-number) |

| [0149-max-points-on-a-line](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0149-max-points-on-a-line) |

| [0150-evaluate-reverse-polish-notation](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0150-evaluate-reverse-polish-notation) |

| [0152-maximum-product-subarray](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0152-maximum-product-subarray) |

| [0153-find-minimum-in-rotated-sorted-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0153-find-minimum-in-rotated-sorted-array) |

| [0162-find-peak-element](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0162-find-peak-element) |

| [0164-maximum-gap](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0164-maximum-gap) |

| [0167-two-sum-ii-input-array-is-sorted](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0167-two-sum-ii-input-array-is-sorted) |

| [0169-majority-element](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0169-majority-element) |

| [0179-largest-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0179-largest-number) |

| [0188-best-time-to-buy-and-sell-stock-iv](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0188-best-time-to-buy-and-sell-stock-iv) |

| [0189-rotate-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0189-rotate-array) |

| [0198-house-robber](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0198-house-robber) |

| [0200-number-of-islands](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0200-number-of-islands) |

| [0204-count-primes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0204-count-primes) |

| [0209-minimum-size-subarray-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0209-minimum-size-subarray-sum) |

| [0212-word-search-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0212-word-search-ii) |

| [0213-house-robber-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0213-house-robber-ii) |

| [0215-kth-largest-element-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0215-kth-largest-element-in-an-array) |

| [0216-combination-sum-iii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0216-combination-sum-iii) |

| [0217-contains-duplicate](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0217-contains-duplicate) |

| [0219-contains-duplicate-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0219-contains-duplicate-ii) |

| [0221-maximal-square](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0221-maximal-square) |

| [0238-product-of-array-except-self](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0238-product-of-array-except-self) |

| [0239-sliding-window-maximum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0239-sliding-window-maximum) |

| [0260-single-number-iii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0260-single-number-iii) |

| [0268-missing-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0268-missing-number) |

| [0275-h-index-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0275-h-index-ii) |

| [0283-move-zeroes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0283-move-zeroes) |

| [0284-peeking-iterator](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0284-peeking-iterator) |

| [0287-find-the-duplicate-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0287-find-the-duplicate-number) |

| [0289-game-of-life](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0289-game-of-life) |

| [0300-longest-increasing-subsequence](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0300-longest-increasing-subsequence) |

| [0304-range-sum-query-2d-immutable](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0304-range-sum-query-2d-immutable) |

| [0307-range-sum-query-mutable](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0307-range-sum-query-mutable) |

| [0309-best-time-to-buy-and-sell-stock-with-cooldown](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0309-best-time-to-buy-and-sell-stock-with-cooldown) |

| [0322-coin-change](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0322-coin-change) |

| [0334-increasing-triplet-subsequence](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0334-increasing-triplet-subsequence) |

| [0336-palindrome-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0336-palindrome-pairs) |

| [0347-top-k-frequent-elements](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0347-top-k-frequent-elements) |

| [0350-intersection-of-two-arrays-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0350-intersection-of-two-arrays-ii) |

| [0368-largest-divisible-subset](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0368-largest-divisible-subset) |

| [0384-shuffle-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0384-shuffle-an-array) |

| [0391-perfect-rectangle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0391-perfect-rectangle) |

| [0399-evaluate-division](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0399-evaluate-division) |

| [0403-frog-jump](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0403-frog-jump) |

| [0407-trapping-rain-water-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0407-trapping-rain-water-ii) |

| [0414-third-maximum-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0414-third-maximum-number) |

| [0416-partition-equal-subset-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0416-partition-equal-subset-sum) |

| [0417-pacific-atlantic-water-flow](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0417-pacific-atlantic-water-flow) |

| [0419-battleships-in-a-board](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0419-battleships-in-a-board) |

| [0435-non-overlapping-intervals](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0435-non-overlapping-intervals) |

| [0442-find-all-duplicates-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0442-find-all-duplicates-in-an-array) |

| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0448-find-all-numbers-disappeared-in-an-array) |

| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |

| [0455-assign-cookies](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0455-assign-cookies) |

| [0462-minimum-moves-to-equal-array-elements-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0462-minimum-moves-to-equal-array-elements-ii) |

| [0463-island-perimeter](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0463-island-perimeter) |

| [0474-ones-and-zeroes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0474-ones-and-zeroes) |

| [0477-total-hamming-distance](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0477-total-hamming-distance) |

| [0485-max-consecutive-ones](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0485-max-consecutive-ones) |

| [0494-target-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0494-target-sum) |

| [0496-next-greater-element-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0496-next-greater-element-i) |

| [0498-diagonal-traverse](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0498-diagonal-traverse) |

| [0500-keyboard-row](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0500-keyboard-row) |

| [0518-coin-change-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0518-coin-change-ii) |

| [0524-longest-word-in-dictionary-through-deleting](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0524-longest-word-in-dictionary-through-deleting) |

| [0529-minesweeper](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0529-minesweeper) |

| [0539-minimum-time-difference](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0539-minimum-time-difference) |

| [0540-single-element-in-a-sorted-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0540-single-element-in-a-sorted-array) |

| [0542-01-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0542-01-matrix) |

| [0554-brick-wall](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0554-brick-wall) |

| [0560-subarray-sum-equals-k](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0560-subarray-sum-equals-k) |

| [0565-array-nesting](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0565-array-nesting) |

| [0605-can-place-flowers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0605-can-place-flowers) |

| [0609-find-duplicate-file-in-system](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0609-find-duplicate-file-in-system) |

| [0611-valid-triangle-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0611-valid-triangle-number) |

| [0621-task-scheduler](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0621-task-scheduler) |

| [0624-maximum-distance-in-arrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0624-maximum-distance-in-arrays) |

| [0636-exclusive-time-of-functions](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0636-exclusive-time-of-functions) |

| [0643-maximum-average-subarray-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0643-maximum-average-subarray-i) |

| [0645-set-mismatch](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0645-set-mismatch) |

| [0682-baseball-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0682-baseball-game) |

| [0689-maximum-sum-of-3-non-overlapping-subarrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0689-maximum-sum-of-3-non-overlapping-subarrays) |

| [0695-max-area-of-island](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0695-max-area-of-island) |

| [0714-best-time-to-buy-and-sell-stock-with-transaction-fee](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0714-best-time-to-buy-and-sell-stock-with-transaction-fee) |

| [0720-longest-word-in-dictionary](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0720-longest-word-in-dictionary) |

| [0724-find-pivot-index](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0724-find-pivot-index) |

| [0729-my-calendar-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0729-my-calendar-i) |

| [0733-flood-fill](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0733-flood-fill) |

| [0735-asteroid-collision](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0735-asteroid-collision) |

| [0739-daily-temperatures](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0739-daily-temperatures) |

| [0745-find-smallest-letter-greater-than-target](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0745-find-smallest-letter-greater-than-target) |

| [0747-min-cost-climbing-stairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0747-min-cost-climbing-stairs) |

| [0764-largest-plus-sign](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0764-largest-plus-sign) |

| [0780-max-chunks-to-make-sorted](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0780-max-chunks-to-make-sorted) |

| [0787-sliding-puzzle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0787-sliding-puzzle) |

| [0792-binary-search](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0792-binary-search) |

| [0794-swim-in-rising-water](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0794-swim-in-rising-water) |

| [0797-rabbits-in-forest](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0797-rabbits-in-forest) |

| [0805-escape-the-ghosts](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0805-escape-the-ghosts) |

| [0810-valid-tic-tac-toe-state](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0810-valid-tic-tac-toe-state) |

| [0817-design-hashmap](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0817-design-hashmap) |

| [0825-max-increase-to-keep-city-skyline](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0825-max-increase-to-keep-city-skyline) |

| [0835-linked-list-components](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0835-linked-list-components) |

| [0839-short-encoding-of-words](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0839-short-encoding-of-words) |

| [0860-design-circular-queue](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0860-design-circular-queue) |

| [0861-flipping-an-image](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0861-flipping-an-image) |

| [0869-similar-string-groups](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0869-similar-string-groups) |

| [0876-hand-of-straights](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0876-hand-of-straights) |

| [0878-shifting-letters](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0878-shifting-letters) |

| [0879-maximize-distance-to-closest-person](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0879-maximize-distance-to-closest-person) |

| [0882-peak-index-in-a-mountain-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0882-peak-index-in-a-mountain-array) |

| [0890-lemonade-change](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0890-lemonade-change) |

| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0892-shortest-subarray-with-sum-at-least-k) |

| [0898-transpose-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0898-transpose-matrix) |

| [0905-length-of-longest-fibonacci-subsequence](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0905-length-of-longest-fibonacci-subsequence) |

| [0906-walking-robot-simulation](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0906-walking-robot-simulation) |

| [0907-koko-eating-bananas](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0907-koko-eating-bananas) |

| [0909-stone-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0909-stone-game) |

| [0917-boats-to-save-people](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0917-boats-to-save-people) |

| [0919-projection-area-of-3d-shapes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0919-projection-area-of-3d-shapes) |

| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |

| [0932-monotonic-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0932-monotonic-array) |

| [0948-sort-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0948-sort-an-array) |

| [0951-partition-array-into-disjoint-intervals](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0951-partition-array-into-disjoint-intervals) |

| [0960-minimize-malware-spread](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0960-minimize-malware-spread) |

| [0967-minimum-falling-path-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0967-minimum-falling-path-sum) |

| [0971-shortest-bridge](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0971-shortest-bridge) |

| [0978-valid-mountain-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0978-valid-mountain-array) |

| [0979-di-string-match](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0979-di-string-match) |

| [0983-validate-stack-sequences](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0983-validate-stack-sequences) |

| [0999-regions-cut-by-slashes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/0999-regions-cut-by-slashes) |

| [1002-maximum-width-ramp](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1002-maximum-width-ramp) |

| [1018-binary-prefix-divisible-by-5](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1018-binary-prefix-divisible-by-5) |

| [1022-unique-paths-iii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1022-unique-paths-iii) |

| [1025-minimum-cost-for-tickets](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1025-minimum-cost-for-tickets) |

| [1032-satisfiability-of-equality-equations](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1032-satisfiability-of-equality-equations) |

| [1036-rotting-oranges](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1036-rotting-oranges) |

| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |

| [1039-find-the-town-judge](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1039-find-the-town-judge) |

| [1041-available-captures-for-rook](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1041-available-captures-for-rook) |

| [1046-max-consecutive-ones-iii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1046-max-consecutive-ones-iii) |

| [1049-minimum-domino-rotations-for-equal-row](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1049-minimum-domino-rotations-for-equal-row) |

| [1072-next-greater-node-in-linked-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1072-next-greater-node-in-linked-list) |

| [1073-number-of-enclaves](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1073-number-of-enclaves) |

| [1097-stream-of-characters](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1097-stream-of-characters) |

| [1104-coloring-a-border](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1104-coloring-a-border) |

| [1106-escape-a-large-maze](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1106-escape-a-large-maze) |

| [1111-minimum-score-triangulation-of-polygon](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1111-minimum-score-triangulation-of-polygon) |

| [1127-last-stone-weight](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1127-last-stone-weight) |

| [1137-height-checker](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1137-height-checker) |

| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |

| [1169-largest-values-from-labels](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1169-largest-values-from-labels) |

| [1171-shortest-path-in-binary-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1171-shortest-path-in-binary-matrix) |

| [1184-car-pooling](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1184-car-pooling) |

| [1206-corporate-flight-bookings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1206-corporate-flight-bookings) |

| [1222-remove-covered-intervals](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1222-remove-covered-intervals) |

| [1227-number-of-equivalent-domino-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1227-number-of-equivalent-domino-pairs) |

| [1232-sum-of-mutated-array-closest-to-target](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1232-sum-of-mutated-array-closest-to-target) |

| [1252-cells-with-odd-values-in-a-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1252-cells-with-odd-values-in-a-matrix) |

| [1256-rank-transform-of-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1256-rank-transform-of-an-array) |

| [1266-minimum-time-visiting-all-points](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1266-minimum-time-visiting-all-points) |

| [1272-invalid-transactions](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1272-invalid-transactions) |

| [1284-four-divisors](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1284-four-divisors) |

| [1288-maximum-subarray-sum-with-one-deletion](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1288-maximum-subarray-sum-with-one-deletion) |

| [1293-three-consecutive-odds](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1293-three-consecutive-odds) |

| [1312-count-artifacts-that-can-be-extracted](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1312-count-artifacts-that-can-be-extracted) |

| [1313-decompress-run-length-encoded-list](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1313-decompress-run-length-encoded-list) |

| [1319-unique-number-of-occurrences](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1319-unique-number-of-occurrences) |

| [1325-path-with-maximum-probability](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1325-path-with-maximum-probability) |

| [1329-sort-the-matrix-diagonally](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1329-sort-the-matrix-diagonally) |

| [1331-path-with-maximum-gold](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1331-path-with-maximum-gold) |

| [1335-maximum-candies-allocated-to-k-children](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1335-maximum-candies-allocated-to-k-children) |

| [1342-queens-that-can-attack-the-king](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1342-queens-that-can-attack-the-king) |

| [1346-maximize-the-topmost-element-after-k-moves](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1346-maximize-the-topmost-element-after-k-moves) |

| [1349-check-if-it-is-a-straight-line](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1349-check-if-it-is-a-straight-line) |

| [1350-remove-sub-folders-from-the-filesystem](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1350-remove-sub-folders-from-the-filesystem) |

| [1353-find-resultant-array-after-removing-anagrams](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1353-find-resultant-array-after-removing-anagrams) |

| [1354-find-players-with-zero-or-one-losses](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1354-find-players-with-zero-or-one-losses) |

| [1364-tuple-with-same-product](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1364-tuple-with-same-product) |

| [1365-how-many-numbers-are-smaller-than-the-current-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1365-how-many-numbers-are-smaller-than-the-current-number) |

| [1396-count-servers-that-communicate](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1396-count-servers-that-communicate) |

| [1397-search-suggestions-system](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1397-search-suggestions-system) |

| [1400-find-winner-on-a-tic-tac-toe-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1400-find-winner-on-a-tic-tac-toe-game) |

| [1402-count-square-submatrices-with-all-ones](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1402-count-square-submatrices-with-all-ones) |

| [1414-shortest-path-in-a-grid-with-obstacles-elimination](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1414-shortest-path-in-a-grid-with-obstacles-elimination) |

| [1421-find-numbers-with-even-number-of-digits](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1421-find-numbers-with-even-number-of-digits) |

| [1422-divide-array-in-sets-of-k-consecutive-numbers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1422-divide-array-in-sets-of-k-consecutive-numbers) |

| [1424-maximum-candies-you-can-get-from-boxes](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1424-maximum-candies-you-can-get-from-boxes) |

| [1426-find-n-unique-integers-sum-up-to-zero](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1426-find-n-unique-integers-sum-up-to-zero) |

| [1428-jump-game-iii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1428-jump-game-iii) |

| [1441-build-an-array-with-stack-operations](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1441-build-an-array-with-stack-operations) |

| [1445-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1445-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold) |

| [1447-jump-game-iv](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1447-jump-game-iv) |

| [1449-print-words-vertically](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1449-print-words-vertically) |

| [1458-max-dot-product-of-two-subsequences](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1458-max-dot-product-of-two-subsequences) |

| [1468-check-if-n-and-its-double-exist](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1468-check-if-n-and-its-double-exist) |

| [1476-count-negative-numbers-in-a-sorted-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1476-count-negative-numbers-in-a-sorted-matrix) |

| [1477-product-of-the-last-k-numbers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1477-product-of-the-last-k-numbers) |

| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |

| [1499-maximum-performance-of-a-team](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1499-maximum-performance-of-a-team) |

| [1524-string-matching-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1524-string-matching-in-an-array) |

| [1528-kids-with-the-greatest-number-of-candies](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1528-kids-with-the-greatest-number-of-candies) |

| [1539-diagonal-traverse-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1539-diagonal-traverse-ii) |

| [1547-destination-city](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1547-destination-city) |

| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |

| [1575-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1575-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts) |

| [1580-shuffle-the-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1580-shuffle-the-array) |

| [1582-design-browser-history](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1582-design-browser-history) |

| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |

| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |

| [1627-last-moment-before-all-ants-fall-out-of-a-plank](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1627-last-moment-before-all-ants-fall-out-of-a-plank) |

| [1646-kth-missing-positive-number](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1646-kth-missing-positive-number) |

| [1656-count-good-triplets](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1656-count-good-triplets) |

| [1663-detect-cycles-in-2d-grid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1663-detect-cycles-in-2d-grid) |

| [1677-matrix-diagonal-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1677-matrix-diagonal-sum) |

| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |

| [1694-make-sum-divisible-by-p](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1694-make-sum-divisible-by-p) |

| [1704-special-positions-in-a-binary-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1704-special-positions-in-a-binary-matrix) |

| [1706-min-cost-to-connect-all-points](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1706-min-cost-to-connect-all-points) |

| [1706-where-will-the-ball-fall](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1706-where-will-the-ball-fall) |

| [1720-crawler-log-folder](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1720-crawler-log-folder) |

| [1744-number-of-ways-to-form-a-target-string-given-a-dictionary](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |

| [1755-defuse-the-bomb](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1755-defuse-the-bomb) |

| [1762-furthest-building-you-can-reach](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1762-furthest-building-you-can-reach) |

| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |

| [1767-design-front-middle-back-queue](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1767-design-front-middle-back-queue) |

| [1776-minimum-operations-to-reduce-x-to-zero](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1776-minimum-operations-to-reduce-x-to-zero) |

| [1798-max-number-of-k-sum-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1798-max-number-of-k-sum-pairs) |

| [1803-average-waiting-time](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1803-average-waiting-time) |

| [1813-maximum-erasure-value](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1813-maximum-erasure-value) |

| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |

| [1833-find-the-highest-altitude](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1833-find-the-highest-altitude) |

| [1834-minimum-number-of-people-to-teach](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1834-minimum-number-of-people-to-teach) |

| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1849-maximum-absolute-sum-of-any-subarray) |

| [1866-restore-the-array-from-adjacent-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1866-restore-the-array-from-adjacent-pairs) |

| [1876-map-of-highest-peak](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1876-map-of-highest-peak) |

| [1878-check-if-array-is-sorted-and-rotated](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1878-check-if-array-is-sorted-and-rotated) |

| [1886-minimum-limit-of-balls-in-a-bag](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1886-minimum-limit-of-balls-in-a-bag) |

| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |

| [1905-count-sub-islands](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1905-count-sub-islands) |

| [1917-maximum-average-pass-ratio](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1917-maximum-average-pass-ratio) |

| [1925-count-nice-pairs-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1925-count-nice-pairs-in-an-array) |

| [1927-maximum-ascending-subarray-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1927-maximum-ascending-subarray-sum) |

| [1934-evaluate-the-bracket-pairs-of-a-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1934-evaluate-the-bracket-pairs-of-a-string) |

| [1940-maximum-xor-for-each-query](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1940-maximum-xor-for-each-query) |

| [1951-find-the-winner-of-the-circular-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1951-find-the-winner-of-the-circular-game) |

| [1972-rotating-the-box](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1972-rotating-the-box) |

| [1988-minimize-maximum-pair-sum-in-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1988-minimize-maximum-pair-sum-in-array) |

| [1993-sum-of-all-subset-xor-totals](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/1993-sum-of-all-subset-xor-totals) |

| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2006-find-the-student-that-will-replace-the-chalk) |

| [2023-design-movie-rental-system](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2023-design-movie-rental-system) |

| [2026-merge-triplets-to-form-target-triplet](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2026-merge-triplets-to-form-target-triplet) |

| [2038-nearest-exit-from-entrance-in-maze](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2038-nearest-exit-from-entrance-in-maze) |

| [2048-build-array-from-permutation](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2048-build-array-from-permutation) |

| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |

| [2058-concatenation-of-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2058-concatenation-of-array) |

| [2080-check-if-move-is-legal](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2080-check-if-move-is-legal) |

| [2089-maximum-matrix-sum](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2089-maximum-matrix-sum) |

| [2091-removing-minimum-and-maximum-from-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2091-removing-minimum-and-maximum-from-array) |

| [2094-remove-stones-to-minimize-the-total](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2094-remove-stones-to-minimize-the-total) |

| [2103-find-all-groups-of-farmland](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2103-find-all-groups-of-farmland) |

| [2106-find-greatest-common-divisor-of-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2106-find-greatest-common-divisor-of-array) |

| [2107-find-unique-binary-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2107-find-unique-binary-string) |

| [2110-number-of-smooth-descent-periods-of-a-stock](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2110-number-of-smooth-descent-periods-of-a-stock) |

| [2116-count-number-of-pairs-with-absolute-difference-k](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2116-count-number-of-pairs-with-absolute-difference-k) |

| [2129-number-of-pairs-of-interchangeable-rectangles](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2129-number-of-pairs-of-interchangeable-rectangles) |

| [2132-convert-1d-array-into-2d-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2132-convert-1d-array-into-2d-array) |

| [2133-number-of-pairs-of-strings-with-concatenation-equal-to-target](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2133-number-of-pairs-of-strings-with-concatenation-equal-to-target) |

| [2145-grid-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2145-grid-game) |

| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |

| [2164-two-best-non-overlapping-events](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2164-two-best-non-overlapping-events) |

| [2169-simple-bank-system](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2169-simple-bank-system) |

| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |

| [2175-count-nodes-with-the-highest-score](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2175-count-nodes-with-the-highest-score) |

| [2179-most-beautiful-item-for-each-query](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2179-most-beautiful-item-for-each-query) |

| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |

| [2206-detonate-the-maximum-bombs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2206-detonate-the-maximum-bombs) |

| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2220-find-all-possible-recipes-from-given-supplies) |

| [2231-find-first-palindromic-string-in-the-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2231-find-first-palindromic-string-in-the-array) |

| [2232-adding-spaces-to-a-string](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2232-adding-spaces-to-a-string) |

| [2244-number-of-laser-beams-in-a-bank](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2244-number-of-laser-beams-in-a-bank) |

| [2245-destroying-asteroids](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2245-destroying-asteroids) |

| [2249-count-the-hidden-sequences](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2249-count-the-hidden-sequences) |

| [2262-solving-questions-with-brainpower](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2262-solving-questions-with-brainpower) |

| [2271-rearrange-array-elements-by-sign](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2271-rearrange-array-elements-by-sign) |

| [2274-keep-multiplying-found-values-by-two](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2274-keep-multiplying-found-values-by-two) |

| [2277-count-equal-and-divisible-pairs-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2277-count-equal-and-divisible-pairs-in-an-array) |

| [2280-count-good-triplets-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2280-count-good-triplets-in-an-array) |

| [2306-create-binary-tree-from-descriptions](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2306-create-binary-tree-from-descriptions) |

| [2307-replace-non-coprime-numbers-in-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2307-replace-non-coprime-numbers-in-array) |

| [2308-divide-array-into-equal-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2308-divide-array-into-equal-pairs) |

| [2316-count-hills-and-valleys-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2316-count-hills-and-valleys-in-an-array) |

| [2334-number-of-flowers-in-full-bloom](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2334-number-of-flowers-in-full-bloom) |

| [2339-k-divisible-elements-subarrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2339-k-divisible-elements-subarrays) |

| [2343-count-unguarded-cells-in-the-grid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2343-count-unguarded-cells-in-the-grid) |

| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |

| [2358-number-of-ways-to-split-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2358-number-of-ways-to-split-array) |

| [2367-minimum-lines-to-represent-a-line-chart](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2367-minimum-lines-to-represent-a-line-chart) |

| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |

| [2386-min-max-game](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2386-min-max-game) |

| [2390-naming-a-company](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2390-naming-a-company) |

| [2428-equal-row-and-column-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2428-equal-row-and-column-pairs) |

| [2429-design-a-food-rating-system](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2429-design-a-food-rating-system) |

| [2432-number-of-zero-filled-subarrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2432-number-of-zero-filled-subarrays) |

| [2445-reachable-nodes-with-restrictions](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2445-reachable-nodes-with-restrictions) |

| [2447-merge-similar-items](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2447-merge-similar-items) |

| [2448-count-number-of-bad-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2448-count-number-of-bad-pairs) |

| [2454-largest-local-values-in-a-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2454-largest-local-values-in-a-matrix) |

| [2465-shifting-letters-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2465-shifting-letters-ii) |

| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |

| [2478-longest-nice-subarray](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2478-longest-nice-subarray) |

| [2483-task-scheduler-ii](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2483-task-scheduler-ii) |

| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |

| [2494-sum-of-prefix-scores-of-strings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2494-sum-of-prefix-scores-of-strings) |

| [2525-count-number-of-distinct-integers-after-reverse-operations](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2525-count-number-of-distinct-integers-after-reverse-operations) |

| [2533-bitwise-xor-of-all-pairings](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2533-bitwise-xor-of-all-pairings) |

| [2536-determine-if-two-events-have-conflict](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2536-determine-if-two-events-have-conflict) |

| [2543-most-popular-video-creator](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2543-most-popular-video-creator) |

| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |

| [2550-words-within-two-edits-of-dictionary](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2550-words-within-two-edits-of-dictionary) |

| [2551-apply-operations-to-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2551-apply-operations-to-an-array) |

| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |

| [2553-total-cost-to-hire-k-workers](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2553-total-cost-to-hire-k-workers) |

| [2554-minimum-total-distance-traveled](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2554-minimum-total-distance-traveled) |

| [2561-number-of-distinct-averages](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2561-number-of-distinct-averages) |

| [2581-divide-players-into-teams-of-equal-skill](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2581-divide-players-into-teams-of-equal-skill) |

| [2586-longest-square-streak-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2586-longest-square-streak-in-an-array) |

| [2588-maximum-number-of-points-from-grid-queries](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2588-maximum-number-of-points-from-grid-queries) |

| [2590-maximum-star-sum-of-a-graph](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2590-maximum-star-sum-of-a-graph) |

| [2598-shortest-distance-to-target-string-in-a-circular-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2598-shortest-distance-to-target-string-in-a-circular-array) |

| [2616-maximal-score-after-applying-k-operations](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2616-maximal-score-after-applying-k-operations) |

| [2626-count-the-number-of-good-subarrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2626-count-the-number-of-good-subarrays) |

| [2634-minimum-common-value](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2634-minimum-common-value) |

| [2636-maximum-subsequence-score](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2636-maximum-subsequence-score) |

| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |

| [2662-check-knight-tour-configuration](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2662-check-knight-tour-configuration) |

| [2676-find-the-score-of-all-prefixes-of-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2676-find-the-score-of-all-prefixes-of-an-array) |

| [2681-put-marbles-in-bags](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2681-put-marbles-in-bags) |

| [2685-first-completely-painted-row-or-column](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2685-first-completely-painted-row-or-column) |

| [2691-count-vowel-strings-in-ranges](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2691-count-vowel-strings-in-ranges) |

| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |

| [2699-count-the-number-of-fair-pairs](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2699-count-the-number-of-fair-pairs) |

| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2707-merge-two-2d-arrays-by-summing-values) |

| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |

| [2727-number-of-senior-citizens](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2727-number-of-senior-citizens) |

| [2764-maximum-number-of-fish-in-a-grid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2764-maximum-number-of-fish-in-a-grid) |

| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |

| [2792-neighboring-bitwise-xor](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2792-neighboring-bitwise-xor) |

| [2794-maximum-number-of-moves-in-a-grid](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2794-maximum-number-of-moves-in-a-grid) |

| [2844-sum-of-squares-of-special-elements](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2844-sum-of-squares-of-special-elements) |

| [2855-maximum-number-of-jumps-to-reach-the-last-index](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2855-maximum-number-of-jumps-to-reach-the-last-index) |

| [2856-count-complete-subarrays-in-an-array](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2856-count-complete-subarrays-in-an-array) |

| [2868-continuous-subarrays](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2868-continuous-subarrays) |

| [2888-minimum-index-of-a-valid-split](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2888-minimum-index-of-a-valid-split) |

| [2977-check-if-a-string-is-an-acronym-of-words](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/2977-check-if-a-string-is-an-acronym-of-words) |

| [3031-construct-product-matrix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3031-construct-product-matrix) |

| [3176-minimum-sum-of-mountain-triplets-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3176-minimum-sum-of-mountain-triplets-i) |

| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3181-find-building-where-alice-and-bob-can-meet) |

| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |

| [3221-find-the-peaks](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3221-find-the-peaks) |

| [3227-find-missing-and-repeated-values](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3227-find-missing-and-repeated-values) |

| [3235-minimum-cost-to-convert-string-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3235-minimum-cost-to-convert-string-i) |

| [3242-count-elements-with-maximum-frequency](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3242-count-elements-with-maximum-frequency) |

| [3251-maximum-area-of-longest-diagonal-rectangle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3251-maximum-area-of-longest-diagonal-rectangle) |

| [3262-find-polygon-with-the-largest-perimeter](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3262-find-polygon-with-the-largest-perimeter) |

| [3291-find-if-array-can-be-sorted](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3291-find-if-array-can-be-sorted) |

| [3309-count-prefix-and-suffix-pairs-i](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3309-count-prefix-and-suffix-pairs-i) |

| [3311-ant-on-the-boundary](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3311-ant-on-the-boundary) |

| [3321-type-of-triangle](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3321-type-of-triangle) |

| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/themysterysolver/LEET-AND-FUN/tree/master/3329-find-the-length-of-the-longest-common-prefix) |

| [3332-minimum-operations-to-exceed-threshold-value-ii](https