SortByAC.md

# :pencil2: Leetcode Solutions with Java
Update time:  2023-05-07 11:41:50

Auto created by [leetcode_generate](https://github.com/bonfy/leetcode)

I have solved **390   /   2412** problems
while there are **361** problems still locked.

If you want to use this tool please follow this [Usage Guide](https://github.com/bonfy/leetcode/blob/master/README_leetcode_generate.md)

If you have any question, please give me an [issue](https://github.com/LukeLinXu/leetcode/issues).

If you are loving solving problems in leetcode, please contact me to enjoy it together!

(Notes: :lock: means you need to buy a book from Leetcode to unlock the problem)

| DB# | UI# | Title | Source Code | Article | Acceptance |
|:---:|:---:|:---:|:---:|:---:|:---:|
|2058|1929|[concatenation-of-array](https://leetcode.com/problems/concatenation-of-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/2058-1929(concatenation-of-array)/concatenation-of-array.java)||90.0%|
|2048|1920|[build-array-from-permutation](https://leetcode.com/problems/build-array-from-permutation)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/2048-1920(build-array-from-permutation)/build-array-from-permutation.java)||89.9%|
|1205|1108|[defanging-an-ip-address](https://leetcode.com/problems/defanging-an-ip-address)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1205-1108(defanging-an-ip-address)/defanging-an-ip-address.java)||89.0%|
|1580|1470|[shuffle-the-array](https://leetcode.com/problems/shuffle-the-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1580-1470(shuffle-the-array)/shuffle-the-array.java)|[:memo:](https://leetcode.com/articles/shuffle-the-array/)|88.9%|
|2556|2469|[convert-the-temperature](https://leetcode.com/problems/convert-the-temperature)|||88.9%|
|2137|2011|[final-value-of-variable-after-performing-operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/2137-2011(final-value-of-variable-after-performing-operations)/final-value-of-variable-after-performing-operations.java)||88.7%|
|1635|1512|[number-of-good-pairs](https://leetcode.com/problems/number-of-good-pairs)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1635-1512(number-of-good-pairs)/number-of-good-pairs.java)||88.3%|
|782|771|[jewels-and-stones](https://leetcode.com/problems/jewels-and-stones)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0782-0771(jewels-and-stones)/jewels-and-stones.java)|[:memo:](https://leetcode.com/articles/jewels-and-stones/)|88.2%|
|2383|2235|[add-two-integers](https://leetcode.com/problems/add-two-integers)|||88.2%|
|2714|2574|[left-and-right-sum-differences](https://leetcode.com/problems/left-and-right-sum-differences)|||88.2%|
|1528|1431|[kids-with-the-greatest-number-of-candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1528-1431(kids-with-the-greatest-number-of-candies)/kids-with-the-greatest-number-of-candies.java)|[:memo:](https://leetcode.com/articles/kids-with-the-greatest-number-of-candies/)|88.0%|
|1708|1603|[design-parking-system](https://leetcode.com/problems/design-parking-system)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1708-1603(design-parking-system)/design-parking-system.java)|[:memo:](https://leetcode.com/articles/design-parking-system/)|87.9%|
|1791|1672|[richest-customer-wealth](https://leetcode.com/problems/richest-customer-wealth)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1791-1672(richest-customer-wealth)/richest-customer-wealth.java)|[:memo:](https://leetcode.com/articles/richest-customer-wealth/)|87.8%|
|2491|2413|[smallest-even-multiple](https://leetcode.com/problems/smallest-even-multiple)|||87.7%|
|1603|1480|[running-sum-of-1d-array](https://leetcode.com/problems/running-sum-of-1d-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1603-1480(running-sum-of-1d-array)/running-sum-of-1d-array.java)|[:memo:](https://leetcode.com/articles/running-sum-of-1d-array/)|87.3%|
|2219|2114|[maximum-number-of-words-found-in-sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences)|||87.0%|
|1797|1678|[goal-parser-interpretation](https://leetcode.com/problems/goal-parser-interpretation)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1797-1678(goal-parser-interpretation)/goal-parser-interpretation.java)||86.7%|
|2264|2160|[minimum-sum-of-four-digit-number-after-splitting-digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits)|||86.7%|
|1406|1281|[subtract-the-product-and-sum-of-digits-of-an-integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1406-1281(subtract-the-product-and-sum-of-digits-of-an-integer)/subtract-the-product-and-sum-of-digits-of-an-integer.java)||86.6%|
|1482|1365|[how-many-numbers-are-smaller-than-the-current-number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1482-1365(how-many-numbers-are-smaller-than-the-current-number)/how-many-numbers-are-smaller-than-the-current-number.java)||86.6%|
|1498|1379|[find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree)||[:memo:](https://leetcode.com/articles/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/)|86.5%|
|975|938|[range-sum-of-bst](https://leetcode.com/problems/range-sum-of-bst)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0975-0938(range-sum-of-bst)/range-sum-of-bst.java)|[:memo:](https://leetcode.com/articles/range-sum-of-bst/)|85.9%|
|1241|1313|[decompress-run-length-encoded-list](https://leetcode.com/problems/decompress-run-length-encoded-list)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1241-1313(decompress-run-length-encoded-list)/decompress-run-length-encoded-list.java)||85.8%|
|1505|1389|[create-target-array-in-the-given-order](https://leetcode.com/problems/create-target-array-in-the-given-order)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1505-1389(create-target-array-in-the-given-order)/create-target-array-in-the-given-order.java)||85.8%|
|1839|1720|[decode-xored-array](https://leetcode.com/problems/decode-xored-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1839-1720(decode-xored-array)/decode-xored-array.java)||85.8%|
|1341|1221|[split-a-string-in-balanced-strings](https://leetcode.com/problems/split-a-string-in-balanced-strings)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1341-1221(split-a-string-in-balanced-strings)/split-a-string-in-balanced-strings.java)||85.2%|
|1444|1342|[number-of-steps-to-reduce-a-number-to-zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1444-1342(number-of-steps-to-reduce-a-number-to-zero)/number-of-steps-to-reduce-a-number-to-zero.java)|[:memo:](https://leetcode.com/articles/number-of-steps-to-reduce-a-number-to-zero/)|85.1%|
|1651|1528|[shuffle-string](https://leetcode.com/problems/shuffle-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1651-1528(shuffle-string)/shuffle-string.java)||85.1%|
|2752|2652|[sum-multiples](https://leetcode.com/problems/sum-multiples)|||85.1%|
|1775|1656|[design-an-ordered-stream](https://leetcode.com/problems/design-an-ordered-stream)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1775-1656(design-an-ordered-stream)/design-an-ordered-stream.java)||85.0%|
|1610|1486|[xor-operation-in-an-array](https://leetcode.com/problems/xor-operation-in-an-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1610-1486(xor-operation-in-an-array)/xor-operation-in-an-array.java)||84.7%|
|2608|2520|[count-the-digits-that-divide-a-number](https://leetcode.com/problems/count-the-digits-that-divide-a-number)|||84.6%|
|2624|2535|[difference-between-element-sum-and-digit-sum-of-an-array](https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array)|||84.6%|
|2304|2194|[cells-in-a-range-on-an-excel-sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet)|||84.5%|
|1899|1773|[count-items-matching-a-rule](https://leetcode.com/problems/count-items-matching-a-rule)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1899-1773(count-items-matching-a-rule)/count-items-matching-a-rule.java)||84.4%|
|2406|2325|[decode-the-message](https://leetcode.com/problems/decode-the-message)|||84.4%|
|2384|2236|[root-equals-sum-of-children](https://leetcode.com/problems/root-equals-sum-of-children)|||84.1%|
|1970|1859|[sorting-the-sentence](https://leetcode.com/problems/sorting-the-sentence)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1970-1859(sorting-the-sentence)/sorting-the-sentence.java)||83.9%|
|2442|2367|[number-of-arithmetic-triplets](https://leetcode.com/problems/number-of-arithmetic-triplets)|||83.6%|
|1781|1662|[check-if-two-string-arrays-are-equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1781-1662(check-if-two-string-arrays-are-equivalent)/check-if-two-string-arrays-are-equivalent.java)|[:memo:](https://leetcode.com/articles/check-if-two-string-arrays-are-equivalent/)|83.5%|
|1916|1791|[find-center-of-star-graph](https://leetcode.com/problems/find-center-of-star-graph)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1916-1791(find-center-of-star-graph)/find-center-of-star-graph.java)||83.5%|
|1693|1588|[sum-of-all-odd-length-subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1693-1588(sum-of-all-odd-length-subarrays)/sum-of-all-odd-length-subarrays.java)|[:memo:](https://leetcode.com/articles/sum-of-all-odd-length-subarrays/)|83.4%|
|1960|1832|[check-if-the-sentence-is-pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1960-1832(check-if-the-sentence-is-pangram)/check-if-the-sentence-is-pangram.java)|[:memo:](https://leetcode.com/articles/check-if-the-sentence-is-pangram/)|83.4%|
|2454|2373|[largest-local-values-in-a-matrix](https://leetcode.com/problems/largest-local-values-in-a-matrix)|||83.3%|
|1944|1816|[truncate-sentence](https://leetcode.com/problems/truncate-sentence)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1944-1816(truncate-sentence)/truncate-sentence.java)||83.2%|
|1806|1688|[count-of-matches-in-tournament](https://leetcode.com/problems/count-of-matches-in-tournament)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1806-1688(count-of-matches-in-tournament)/count-of-matches-in-tournament.java)||83.0%|
|2767|2656|[maximum-sum-with-exactly-k-elements](https://leetcode.com/problems/maximum-sum-with-exactly-k-elements)|||83.0%|
|1894|1768|[merge-strings-alternately](https://leetcode.com/problems/merge-strings-alternately)||[:memo:](https://leetcode.com/articles/merge-strings-alternately/)|82.8%|
|2116|2006|[count-number-of-pairs-with-absolute-difference-k](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/2116-2006(count-number-of-pairs-with-absolute-difference-k)/count-number-of-pairs-with-absolute-difference-k.java)||82.8%|
|2748|2651|[calculate-delayed-arrival-time](https://leetcode.com/problems/calculate-delayed-arrival-time)|||82.7%|
|822|804|[unique-morse-code-words](https://leetcode.com/problems/unique-morse-code-words)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0822-0804(unique-morse-code-words)/unique-morse-code-words.java)|[:memo:](https://leetcode.com/articles/unique-morse-code-words/)|82.6%|
|742|709|[to-lower-case](https://leetcode.com/problems/to-lower-case)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0742-0709(to-lower-case)/to-lower-case.java)|[:memo:](https://leetcode.com/articles/to-lower-case/)|82.4%|
|1786|1684|[count-the-number-of-consistent-strings](https://leetcode.com/problems/count-the-number-of-consistent-strings)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1786-1684(count-the-number-of-consistent-strings)/count-the-number-of-consistent-strings.java)||82.4%|
|2323|2220|[minimum-bit-flips-to-convert-number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number)|||82.4%|
|2148|2037|[minimum-number-of-moves-to-seat-everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone)|||82.2%|
|1448|1323|[maximum-69-number](https://leetcode.com/problems/maximum-69-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1448-1323(maximum-69-number)/maximum-69-number.java)|[:memo:](https://leetcode.com/articles/maximum-69-number/)|82.1%|
|1737|1614|[maximum-nesting-depth-of-the-parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1737-1614(maximum-nesting-depth-of-the-parentheses)/maximum-nesting-depth-of-the-parentheses.java)||82.1%|
|1411|1290|[convert-binary-number-in-a-linked-list-to-integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1411-1290(convert-binary-number-in-a-linked-list-to-integer)/convert-binary-number-in-a-linked-list-to-integer.java)|[:memo:](https://leetcode.com/articles/convert-binary-number-in-a-linked-list-to-integer/)|82.0%|
|2401|2315|[count-asterisks](https://leetcode.com/problems/count-asterisks)|||82.0%|
|557|557|[reverse-words-in-a-string-iii](https://leetcode.com/problems/reverse-words-in-a-string-iii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0557-0557(reverse-words-in-a-string-iii)/reverse-words-in-a-string-iii.java)|[:memo:](https://leetcode.com/articles/reverse-words-in-a-string-iii/)|81.9%|
|2042|1913|[maximum-product-difference-between-two-pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/2042-1913(maximum-product-difference-between-two-pairs)/maximum-product-difference-between-two-pairs.java)||81.2%|
|2226|2103|[rings-and-rods](https://leetcode.com/problems/rings-and-rods)|||81.2%|
|1656|1534|[count-good-triplets](https://leetcode.com/problems/count-good-triplets)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1656-1534(count-good-triplets)/count-good-triplets.java)||80.9%|
|861|832|[flipping-an-image](https://leetcode.com/problems/flipping-an-image)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0861-0832(flipping-an-image)/flipping-an-image.java)|[:memo:](https://leetcode.com/articles/flipping-an-image/)|80.8%|
|1078|1021|[remove-outermost-parentheses](https://leetcode.com/problems/remove-outermost-parentheses)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1078-1021(remove-outermost-parentheses)/remove-outermost-parentheses.java)||80.8%|
|2502|2418|[sort-the-people](https://leetcode.com/problems/sort-the-people)|||80.6%|
|1677|1572|[matrix-diagonal-sum](https://leetcode.com/problems/matrix-diagonal-sum)||[:memo:](https://leetcode.com/articles/matrix-diagonal-sum/)|80.4%|
|1993|1863|[sum-of-all-subset-xor-totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals)|||80.3%|
|2585|2500|[delete-greatest-value-in-each-row](https://leetcode.com/problems/delete-greatest-value-in-each-row)|||80.3%|
|1954|1844|[replace-all-digits-with-characters](https://leetcode.com/problems/replace-all-digits-with-characters)|||80.2%|
|1574|1464|[maximum-product-of-two-elements-in-an-array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array)|||80.1%|
|2099|1967|[number-of-strings-that-appear-as-substrings-in-word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word)|||80.1%|
|2571|2485|[find-the-pivot-integer](https://leetcode.com/problems/find-the-pivot-integer)|||80.0%|
|1434|1309|[decrypt-string-from-alphabet-to-integer-mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1434-1309(decrypt-string-from-alphabet-to-integer-mapping)/decrypt-string-from-alphabet-to-integer-mapping.java)||79.8%|
|2277|2176|[count-equal-and-divisible-pairs-in-an-array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array)|||79.5%|
|2639|2553|[separate-the-digits-in-an-array](https://leetcode.com/problems/separate-the-digits-in-an-array)|||79.5%|
|2507|2427|[number-of-common-factors](https://leetcode.com/problems/number-of-common-factors)|||79.4%|
|1395|1266|[minimum-time-visiting-all-points](https://leetcode.com/problems/minimum-time-visiting-all-points)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1395-1266(minimum-time-visiting-all-points)/minimum-time-visiting-all-points.java)||79.1%|
|2128|2000|[reverse-prefix-of-word](https://leetcode.com/problems/reverse-prefix-of-word)|||79.0%|
|1833|1732|[find-the-highest-altitude](https://leetcode.com/problems/find-the-highest-altitude)||[:memo:](https://leetcode.com/articles/find-the-highest-altitude/)|78.9%|
|617|617|[merge-two-binary-trees](https://leetcode.com/problems/merge-two-binary-trees)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0617-0617(merge-two-binary-trees)/merge-two-binary-trees.java)|[:memo:](https://leetcode.com/articles/merge-two-binary-trees/)|78.7%|
|1843|1725|[number-of-rectangles-that-can-form-the-largest-square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square)|||78.7%|
|2231|2108|[find-first-palindromic-string-in-the-array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array)|||78.6%|
|1378|1252|[cells-with-odd-values-in-a-matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1378-1252(cells-with-odd-values-in-a-matrix)/cells-with-odd-values-in-a-matrix.java)||78.5%|
|933|897|[increasing-order-search-tree](https://leetcode.com/problems/increasing-order-search-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0933-0897(increasing-order-search-tree)/increasing-order-search-tree.java)|[:memo:](https://leetcode.com/articles/increasing-order-search-tree/)|78.4%|
|2416|2331|[evaluate-boolean-binary-tree](https://leetcode.com/problems/evaluate-boolean-binary-tree)|||78.4%|
|1938|1827|[minimum-operations-to-make-the-array-increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing)|||78.3%|
|1392|2215|[find-the-difference-of-two-arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays)||[:memo:](https://leetcode.com/articles/find-the-difference-of-two-arrays/)|78.1%|
|728|728|[self-dividing-numbers](https://leetcode.com/problems/self-dividing-numbers)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0728-0728(self-dividing-numbers)/self-dividing-numbers.java)|[:memo:](https://leetcode.com/articles/self-dividing-numbers/)|77.9%|
|783|700|[search-in-a-binary-search-tree](https://leetcode.com/problems/search-in-a-binary-search-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0783-0700(search-in-a-binary-search-tree)/search-in-a-binary-search-tree.java)|[:memo:](https://leetcode.com/articles/search-in-a-bst/)|77.8%|
|1823|1704|[determine-if-string-halves-are-alike](https://leetcode.com/problems/determine-if-string-halves-are-alike)||[:memo:](https://leetcode.com/articles/determine-if-string-halves-are-alike/)|77.7%|
|1920|1812|[determine-color-of-a-chessboard-square](https://leetcode.com/problems/determine-color-of-a-chessboard-square)|||77.7%|
|1490|1374|[generate-a-string-with-characters-that-have-odd-counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1490-1374(generate-a-string-with-characters-that-have-odd-counts)/generate-a-string-with-characters-that-have-odd-counts.java)||77.6%|
|776|590|[n-ary-tree-postorder-traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0776-0590(n-ary-tree-postorder-traversal)/n-ary-tree-postorder-traversal.java)|[:memo:](https://leetcode.com/articles/n-ary-tree-postorder-traversal/)|77.5%|
|979|942|[di-string-match](https://leetcode.com/problems/di-string-match)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0979-0942(di-string-match)/di-string-match.java)|[:memo:](https://leetcode.com/articles/di-string-match/)|77.5%|
|1547|1436|[destination-city](https://leetcode.com/problems/destination-city)|||77.4%|
|561|561|[array-partition](https://leetcode.com/problems/array-partition)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0561-0561(array-partition)/array-partition.java)|[:memo:](https://leetcode.com/articles/array-partition-i/)|77.3%|
|2292|2185|[counting-words-with-a-given-prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix)|||77.3%|
|2238|2119|[a-number-after-a-double-reversal](https://leetcode.com/problems/a-number-after-a-double-reversal)|||77.2%|
|1421|1295|[find-numbers-with-even-number-of-digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1421-1295(find-numbers-with-even-number-of-digits)/find-numbers-with-even-number-of-digits.java)||77.0%|
|2106|1979|[find-greatest-common-divisor-of-array](https://leetcode.com/problems/find-greatest-common-divisor-of-array)|||77.0%|
|1426|1304|[find-n-unique-integers-sum-up-to-zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1426-1304(find-n-unique-integers-sum-up-to-zero)/find-n-unique-integers-sum-up-to-zero.java)||76.9%|
|1965|1837|[sum-of-digits-in-base-k](https://leetcode.com/problems/sum-of-digits-in-base-k)|||76.9%|
|344|344|[reverse-string](https://leetcode.com/problems/reverse-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0344-0344(reverse-string)/reverse-string.java)|[:memo:](https://leetcode.com/articles/reverse-string/)|76.8%|
|1472|1370|[increasing-decreasing-string](https://leetcode.com/problems/increasing-decreasing-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1472-1370(increasing-decreasing-string)/increasing-decreasing-string.java)||76.8%|
|2053|1941|[check-if-all-characters-have-equal-number-of-occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences)|||76.8%|
|2654|2586|[count-the-number-of-vowel-strings-in-range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range)|||76.6%|
|1848|1748|[sum-of-unique-elements](https://leetcode.com/problems/sum-of-unique-elements)|||76.4%|
|1454|1332|[remove-palindromic-subsequences](https://leetcode.com/problems/remove-palindromic-subsequences)||[:memo:](https://leetcode.com/articles/remove-palindrome-subsequences/)|76.2%|
|1570|1475|[final-prices-with-a-special-discount-in-a-shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop)|||76.2%|
|2737|2643|[row-with-maximum-ones](https://leetcode.com/problems/row-with-maximum-ones)|||76.2%|
|1001|961|[n-repeated-element-in-size-2n-array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1001-0961(n-repeated-element-in-size-2n-array)/n-repeated-element-in-size-2n-array.java)|[:memo:](https://leetcode.com/articles/n-repeated-element-in-size-2n-array/)|76.1%|
|2210|2089|[find-target-indices-after-sorting-array](https://leetcode.com/problems/find-target-indices-after-sorting-array)|||76.1%|
|338|338|[counting-bits](https://leetcode.com/problems/counting-bits)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0338-0338(counting-bits)/counting-bits.java)|[:memo:](https://leetcode.com/articles/counting-bits/)|75.8%|
|775|589|[n-ary-tree-preorder-traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0775-0589(n-ary-tree-preorder-traversal)/n-ary-tree-preorder-traversal.java)|[:memo:](https://leetcode.com/articles/n-ary-tree-preorder-traversal/)|75.8%|
|908|876|[middle-of-the-linked-list](https://leetcode.com/problems/middle-of-the-linked-list)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0908-0876(middle-of-the-linked-list)/middle-of-the-linked-list.java)|[:memo:](https://leetcode.com/articles/middle-of-the-linked-list/)|75.8%|
|1560|1450|[number-of-students-doing-homework-at-a-given-time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time)|||75.8%|
|2421|2341|[maximum-number-of-pairs-in-array](https://leetcode.com/problems/maximum-number-of-pairs-in-array)|||75.8%|
|1137|1051|[height-checker](https://leetcode.com/problems/height-checker)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1137-1051(height-checker)/height-checker.java)||75.7%|
|941|905|[sort-array-by-parity](https://leetcode.com/problems/sort-array-by-parity)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0941-0905(sort-array-by-parity)/sort-array-by-parity.java)|[:memo:](https://leetcode.com/articles/sort-array-by-parity/)|75.6%|
|2447|2363|[merge-similar-items](https://leetcode.com/problems/merge-similar-items)|||75.6%|
|1476|1351|[count-negative-numbers-in-a-sorted-matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1476-1351(count-negative-numbers-in-a-sorted-matrix)/count-negative-numbers-in-a-sorted-matrix.java)|[:memo:](https://leetcode.com/articles/count-negative-numbers-in-a-sorted-matrix/)|75.5%|
|657|657|[robot-return-to-origin](https://leetcode.com/problems/robot-return-to-origin)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0657-0657(robot-return-to-origin)/robot-return-to-origin.java)|[:memo:](https://leetcode.com/articles/judge-route-circle/)|75.3%|
|461|461|[hamming-distance](https://leetcode.com/problems/hamming-distance)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0461-0461(hamming-distance)/hamming-distance.java)|[:memo:](https://leetcode.com/articles/hamming-distance/)|75.0%|
|2288|2169|[count-operations-to-obtain-zero](https://leetcode.com/problems/count-operations-to-obtain-zero)|||75.0%|
|2777|2670|[find-the-distinct-difference-array](https://leetcode.com/problems/find-the-distinct-difference-array)|||75.0%|
|226|226|[invert-binary-tree](https://leetcode.com/problems/invert-binary-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0226-0226(invert-binary-tree)/invert-binary-tree.java)|[:memo:](https://leetcode.com/articles/invert-binary-tree/)|74.9%|
|981|944|[delete-columns-to-make-sorted](https://leetcode.com/problems/delete-columns-to-make-sorted)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0981-0944(delete-columns-to-make-sorted)/delete-columns-to-make-sorted.java)|[:memo:](https://leetcode.com/articles/delete-columns-to-make-sorted/)|74.8%|
|2427|2351|[first-letter-to-appear-twice](https://leetcode.com/problems/first-letter-to-appear-twice)|||74.5%|
|682|682|[baseball-game](https://leetcode.com/problems/baseball-game)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0682-0682(baseball-game)/baseball-game.java)|[:memo:](https://leetcode.com/articles/baseball-game/)|74.4%|
|104|104|[maximum-depth-of-binary-tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0104-0104(maximum-depth-of-binary-tree)/maximum-depth-of-binary-tree.java)|[:memo:](https://leetcode.com/articles/maximum-depth-of-binary-tree/)|74.0%|
|2010|1880|[check-if-word-equals-summation-of-two-words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/2010-1880(check-if-word-equals-summation-of-two-words)/check-if-word-equals-summation-of-two-words.java)||74.0%|
|2365|2278|[percentage-of-letter-in-string](https://leetcode.com/problems/percentage-of-letter-in-string)|||74.0%|
|2614|2529|[maximum-count-of-positive-integer-and-negative-integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer)|||74.0%|
|94|94|[binary-tree-inorder-traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)||[:memo:](https://leetcode.com/articles/binary-tree-inorder-traversal/)|73.9%|
|1829|1710|[maximum-units-on-a-truck](https://leetcode.com/problems/maximum-units-on-a-truck)||[:memo:](https://leetcode.com/articles/maximum-units-on-a-truck/)|73.8%|
|206|206|[reverse-linked-list](https://leetcode.com/problems/reverse-linked-list)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0206-0206(reverse-linked-list)/reverse-linked-list.java)|[:memo:](https://leetcode.com/articles/reverse-linked-list/)|73.7%|
|2159|2032|[two-out-of-three](https://leetcode.com/problems/two-out-of-three)|||73.7%|
|2308|2206|[divide-array-into-equal-pairs](https://leetcode.com/problems/divide-array-into-equal-pairs)|||73.7%|
|1844|1742|[maximum-number-of-balls-in-a-box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box)|||73.6%|
|1079|1022|[sum-of-root-to-leaf-binary-numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1079-1022(sum-of-root-to-leaf-binary-numbers)/sum-of-root-to-leaf-binary-numbers.java)|[:memo:](https://leetcode.com/articles/sum-root-to-leaf-binary-numbers/)|73.5%|
|1319|1207|[unique-number-of-occurrences](https://leetcode.com/problems/unique-number-of-occurrences)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1319-1207(unique-number-of-occurrences)/unique-number-of-occurrences.java)|[:memo:](https://leetcode.com/articles/unique-number-of-occurrences/)|73.5%|
|2707|2570|[merge-two-2d-arrays-by-summing-values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values)|||73.5%|
|1458|1356|[sort-integers-by-the-number-of-1-bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1458-1356(sort-integers-by-the-number-of-1-bits)/sort-integers-by-the-number-of-1-bits.java)||73.3%|
|969|933|[number-of-recent-calls](https://leetcode.com/problems/number-of-recent-calls)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0969-0933(number-of-recent-calls)/number-of-recent-calls.java)|[:memo:](https://leetcode.com/articles/number-of-recent-calls/)|73.2%|
|1231|1299|[replace-elements-with-greatest-element-on-right-side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1231-1299(replace-elements-with-greatest-element-on-right-side)/replace-elements-with-greatest-element-on-right-side.java)||73.1%|
|2377|2283|[check-if-number-has-equal-digit-count-and-digit-value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value)|||72.9%|
|2088|1974|[minimum-time-to-type-word-using-special-typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter)|||72.8%|
|2341|2255|[count-prefixes-of-a-given-string](https://leetcode.com/problems/count-prefixes-of-a-given-string)|||72.6%|
|2274|2154|[keep-multiplying-found-values-by-two](https://leetcode.com/problems/keep-multiplying-found-values-by-two)|||72.4%|
|2436|2357|[make-array-zero-by-subtracting-equal-amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts)|||72.4%|
|1519|1403|[minimum-subsequence-in-non-increasing-order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order)|||72.3%|
|2469|2389|[longest-subsequence-with-limited-sum](https://leetcode.com/problems/longest-subsequence-with-limited-sum)||[:memo:](https://leetcode.com/articles/longest-subsequence-with-limited-sum/)|72.3%|
|1556|1460|[make-two-arrays-equal-by-reversing-subarrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays)|||72.2%|
|2163|2053|[kth-distinct-string-in-an-array](https://leetcode.com/problems/kth-distinct-string-in-an-array)|||72.1%|
|1463|1337|[the-k-weakest-rows-in-a-matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1463-1337(the-k-weakest-rows-in-a-matrix)/the-k-weakest-rows-in-a-matrix.java)|[:memo:](https://leetcode.com/articles/the-k-weakest-rows-in-a-matrix/)|72.0%|
|2589|2496|[maximum-value-of-a-string-in-an-array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array)|||72.0%|
|1019|977|[squares-of-a-sorted-array](https://leetcode.com/problems/squares-of-a-sorted-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1019-0977(squares-of-a-sorted-array)/squares-of-a-sorted-array.java)|[:memo:](https://leetcode.com/articles/squares-of-a-sorted-array/)|71.9%|
|637|637|[average-of-levels-in-binary-tree](https://leetcode.com/problems/average-of-levels-in-binary-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0637-0637(average-of-levels-in-binary-tree)/average-of-levels-in-binary-tree.java)|[:memo:](https://leetcode.com/articles/average-of-levels-in-binary-tree/)|71.8%|
|1329|1217|[minimum-cost-to-move-chips-to-the-same-position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1329-1217(minimum-cost-to-move-chips-to-the-same-position)/minimum-cost-to-move-chips-to-the-same-position.java)|[:memo:](https://leetcode.com/articles/minimum-cost-to-move-chips-to-the-same-position/)|71.8%|
|774|559|[maximum-depth-of-n-ary-tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0774-0559(maximum-depth-of-n-ary-tree)/maximum-depth-of-n-ary-tree.java)|[:memo:](https://leetcode.com/articles/maximum-depth-of-n-ary-tree/)|71.7%|
|1264|1935|[maximum-number-of-words-you-can-type](https://leetcode.com/problems/maximum-number-of-words-you-can-type)|||71.7%|
|2181|2057|[smallest-index-with-equal-value](https://leetcode.com/problems/smallest-index-with-equal-value)|||71.7%|
|496|496|[next-greater-element-i](https://leetcode.com/problems/next-greater-element-i)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0496-0496(next-greater-element-i)/next-greater-element-i.java)|[:memo:](https://leetcode.com/articles/greater-element-i/)|71.4%|
|919|883|[projection-area-of-3d-shapes](https://leetcode.com/problems/projection-area-of-3d-shapes)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0919-0883(projection-area-of-3d-shapes)/projection-area-of-3d-shapes.java)|[:memo:](https://leetcode.com/articles/projection-area-of-3d-shapes/)|71.4%|
|841|821|[shortest-distance-to-a-character](https://leetcode.com/problems/shortest-distance-to-a-character)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0841-0821(shortest-distance-to-a-character)/shortest-distance-to-a-character.java)|[:memo:](https://leetcode.com/articles/shortest-distance-to-a-character/)|71.3%|
|1987|1876|[substrings-of-size-three-with-distinct-characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters)|||71.3%|
|2243|2124|[check-if-all-as-appears-before-all-bs](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs)|||71.2%|
|349|349|[intersection-of-two-arrays](https://leetcode.com/problems/intersection-of-two-arrays)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0349-0349(intersection-of-two-arrays)/intersection-of-two-arrays.java)|[:memo:](https://leetcode.com/articles/intersection-of-two-arrays/)|71.1%|
|118|118|[pascals-triangle](https://leetcode.com/problems/pascals-triangle)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0118-0118(pascals-triangle)/pascals-triangle.java)|[:memo:](https://leetcode.com/articles/pascals-triangle/)|71.0%|
|2659|2595|[number-of-even-and-odd-bits](https://leetcode.com/problems/number-of-even-and-odd-bits)|||71.0%|
|2566|2475|[number-of-unequal-triplets-in-array](https://leetcode.com/problems/number-of-unequal-triplets-in-array)|||70.9%|
|136|136|[single-number](https://leetcode.com/problems/single-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0136-0136(single-number)/single-number.java)|[:memo:](https://leetcode.com/articles/single-number/)|70.8%|
|2476|2399|[check-distances-between-same-letters](https://leetcode.com/problems/check-distances-between-same-letters)|||70.7%|
|958|922|[sort-array-by-parity-ii](https://leetcode.com/problems/sort-array-by-parity-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0958-0922(sort-array-by-parity-ii)/sort-array-by-parity-ii.java)|[:memo:](https://leetcode.com/articles/sort-array-by-parity-ii/)|70.6%|
|1496|1380|[lucky-numbers-in-a-matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1496-1380(lucky-numbers-in-a-matrix)/lucky-numbers-in-a-matrix.java)||70.6%|
|2594|2506|[count-pairs-of-similar-strings](https://leetcode.com/problems/count-pairs-of-similar-strings)|||70.5%|
|412|412|[fizz-buzz](https://leetcode.com/problems/fizz-buzz)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0412-0412(fizz-buzz)/fizz-buzz.java)|[:memo:](https://leetcode.com/articles/fizz-buzz/)|70.1%|
|2190|2085|[count-common-words-with-one-occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence)|||70.1%|
|2650|2578|[split-with-minimum-sum](https://leetcode.com/problems/split-with-minimum-sum)|||70.1%|
|108|108|[convert-sorted-array-to-binary-search-tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0108-0108(convert-sorted-array-to-binary-search-tree)/convert-sorted-array-to-binary-search-tree.java)|[:memo:](https://leetcode.com/articles/convert-sorted-array-to-bst/)|70.0%|
|1013|509|[fibonacci-number](https://leetcode.com/problems/fibonacci-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1013-0509(fibonacci-number)/fibonacci-number.java)|[:memo:](https://leetcode.com/articles/fibonacci-number/)|69.9%|
|1005|965|[univalued-binary-tree](https://leetcode.com/problems/univalued-binary-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1005-0965(univalued-binary-tree)/univalued-binary-tree.java)|[:memo:](https://leetcode.com/articles/univalued-binary-tree/)|69.8%|
|1094|1030|[matrix-cells-in-distance-order](https://leetcode.com/problems/matrix-cells-in-distance-order)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1094-1030(matrix-cells-in-distance-order)/matrix-cells-in-distance-order.java)||69.8%|
|463|463|[island-perimeter](https://leetcode.com/problems/island-perimeter)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0463-0463(island-perimeter)/island-perimeter.java)|[:memo:](https://leetcode.com/articles/island-perimeter/)|69.7%|
|1741|1636|[sort-array-by-increasing-frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency)|||69.7%|
|2698|2562|[find-the-array-concatenation-value](https://leetcode.com/problems/find-the-array-concatenation-value)|||69.7%|
|500|500|[keyboard-row](https://leetcode.com/problems/keyboard-row)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0500-0500(keyboard-row)/keyboard-row.java)||69.6%|
|1306|1200|[minimum-absolute-difference](https://leetcode.com/problems/minimum-absolute-difference)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1306-1200(minimum-absolute-difference)/minimum-absolute-difference.java)|[:memo:](https://leetcode.com/articles/minimum-absolute-difference/)|69.6%|
|1128|1047|[remove-all-adjacent-duplicates-in-string](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1128-1047(remove-all-adjacent-duplicates-in-string)/remove-all-adjacent-duplicates-in-string.java)|[:memo:](https://leetcode.com/articles/remove-all-adjacent-duplicates-in-string/)|69.5%|
|2630|2544|[alternating-digit-sum](https://leetcode.com/problems/alternating-digit-sum)|||69.4%|
|1802|1700|[number-of-students-unable-to-eat-lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch)|||69.0%|
|1363|2309|[greatest-english-letter-in-upper-and-lower-case](https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case)|||68.8%|
|1217|1122|[relative-sort-array](https://leetcode.com/problems/relative-sort-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1217-1122(relative-sort-array)/relative-sort-array.java)||68.7%|
|777|766|[toeplitz-matrix](https://leetcode.com/problems/toeplitz-matrix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0777-0766(toeplitz-matrix)/toeplitz-matrix.java)|[:memo:](https://leetcode.com/articles/toeplitz-matrix/)|68.6%|
|1044|1002|[find-common-characters](https://leetcode.com/problems/find-common-characters)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1044-1002(find-common-characters)/find-common-characters.java)||68.5%|
|2331|2248|[intersection-of-multiple-arrays](https://leetcode.com/problems/intersection-of-multiple-arrays)|||68.5%|
|944|908|[smallest-range-i](https://leetcode.com/problems/smallest-range-i)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0944-0908(smallest-range-i)/smallest-range-i.java)|[:memo:](https://leetcode.com/articles/smallest-range-i/)|68.3%|
|145|145|[binary-tree-postorder-traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)||[:memo:](https://leetcode.com/articles/binary-tree-postorder-traversal/)|68.2%|
|1041|999|[available-captures-for-rook](https://leetcode.com/problems/available-captures-for-rook)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1041-0999(available-captures-for-rook)/available-captures-for-rook.java)||68.2%|
|767|762|[prime-number-of-set-bits-in-binary-representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0767-0762(prime-number-of-set-bits-in-binary-representation)/prime-number-of-set-bits-in-binary-representation.java)|[:memo:](https://leetcode.com/articles/prime-number-of-set-bits-in-binary-representation/)|68.1%|
|2037|1925|[count-square-sum-triples](https://leetcode.com/problems/count-square-sum-triples)|||68.0%|
|851|824|[goat-latin](https://leetcode.com/problems/goat-latin)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0851-0824(goat-latin)/goat-latin.java)|[:memo:](https://leetcode.com/articles/goat-latin/)|67.9%|
|2524|2441|[largest-positive-integer-that-exists-with-its-negative](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative)|||67.9%|
|1086|1025|[divisor-game](https://leetcode.com/problems/divisor-game)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1086-1025(divisor-game)/divisor-game.java)||67.7%|
|1386|1260|[shift-2d-grid](https://leetcode.com/problems/shift-2d-grid)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1386-1260(shift-2d-grid)/shift-2d-grid.java)|[:memo:](https://leetcode.com/articles/shift-2d-grid/)|67.7%|
|1626|1502|[can-make-arithmetic-progression-from-sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence)||[:memo:](https://leetcode.com/articles/can-make-arithmetic-progression-from-sequence/)|67.7%|
|904|872|[leaf-similar-trees](https://leetcode.com/problems/leaf-similar-trees)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0904-0872(leaf-similar-trees)/leaf-similar-trees.java)|[:memo:](https://leetcode.com/articles/leaf-similar-trees/)|67.6%|
|476|476|[number-complement](https://leetcode.com/problems/number-complement)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0476-0476(number-complement)/number-complement.java)|[:memo:](https://leetcode.com/articles/number-complement/)|67.4%|
|1112|1160|[find-words-that-can-be-formed-by-characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1112-1160(find-words-that-can-be-formed-by-characters)/find-words-that-can-be-formed-by-characters.java)||67.4%|
|1888|1779|[find-nearest-point-that-has-the-same-x-or-y-coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate)|||67.4%|
|2168|2042|[check-if-numbers-are-ascending-in-a-sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence)|||67.4%|
|2102|1991|[find-the-middle-index-in-array](https://leetcode.com/problems/find-the-middle-index-in-array)|||67.3%|
|1514|1413|[minimum-value-to-get-positive-step-by-step-sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum)||[:memo:](https://leetcode.com/articles/minimum-value-to-get-positive-step-by-step-total/)|67.2%|
|965|929|[unique-email-addresses](https://leetcode.com/problems/unique-email-addresses)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0965-0929(unique-email-addresses)/unique-email-addresses.java)|[:memo:](https://leetcode.com/articles/unique-email-addresses/)|67.1%|
|2551|2460|[apply-operations-to-an-array](https://leetcode.com/problems/apply-operations-to-an-array)|||67.1%|
|144|144|[binary-tree-preorder-traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)||[:memo:](https://leetcode.com/articles/binary-tree-preorder-traversal/)|67.0%|
|191|191|[number-of-1-bits](https://leetcode.com/problems/number-of-1-bits)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0191-0191(number-of-1-bits)/number-of-1-bits.java)|[:memo:](https://leetcode.com/articles/number-of-1-bits/)|66.9%|
|1500|1399|[count-largest-group](https://leetcode.com/problems/count-largest-group)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1500-1399(count-largest-group)/count-largest-group.java)||66.9%|
|824|806|[number-of-lines-to-write-string](https://leetcode.com/problems/number-of-lines-to-write-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0824-0806(number-of-lines-to-write-string)/number-of-lines-to-write-string.java)|[:memo:](https://leetcode.com/articles/number-of-lines-to-write-string/)|66.8%|
|1486|1385|[find-the-distance-value-between-two-arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays)|||66.8%|
|2199|2078|[two-furthest-houses-with-different-colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors)|||66.8%|
|2692|2558|[take-gifts-from-the-richest-pile](https://leetcode.com/problems/take-gifts-from-the-richest-pile)|||66.7%|
|575|575|[distribute-candies](https://leetcode.com/problems/distribute-candies)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0575-0575(distribute-candies)/distribute-candies.java)|[:memo:](https://leetcode.com/articles/distribute-candies/)|66.5%|
|920|884|[uncommon-words-from-two-sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0920-0884(uncommon-words-from-two-sentences)/uncommon-words-from-two-sentences.java)|[:memo:](https://leetcode.com/articles/uncommon-words-from-two-sentences/)|66.4%|
|2361|2243|[calculate-digit-sum-of-a-string](https://leetcode.com/problems/calculate-digit-sum-of-a-string)|||66.4%|
|2398|2319|[check-if-matrix-is-x-matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix)|||66.4%|
|1817|1716|[calculate-money-in-leetcode-bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank)|||66.3%|
|1950|1822|[sign-of-the-product-of-an-array](https://leetcode.com/problems/sign-of-the-product-of-an-array)||[:memo:](https://leetcode.com/articles/sign-of-the-product-of-an-array/)|66.1%|
|2186|2062|[count-vowel-substrings-of-a-string](https://leetcode.com/problems/count-vowel-substrings-of-a-string)|||66.1%|
|1210|1619|[mean-of-array-after-removing-some-elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements)|||66.0%|
|258|258|[add-digits](https://leetcode.com/problems/add-digits)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0258-0258(add-digits)/add-digits.java)|[:memo:](https://leetcode.com/articles/add-digits/)|65.6%|
|816|705|[design-hashset](https://leetcode.com/problems/design-hashset)||[:memo:](https://leetcode.com/articles/design-hashset/)|65.6%|
|2298|2180|[count-integers-with-even-digit-sum](https://leetcode.com/problems/count-integers-with-even-digit-sum)|||65.6%|
|1127|1046|[last-stone-weight](https://leetcode.com/problems/last-stone-weight)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1127-1046(last-stone-weight)/last-stone-weight.java)|[:memo:](https://leetcode.com/articles/last-stone-weight/)|65.5%|
|2260|2138|[divide-a-string-into-groups-of-size-k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k)|||65.5%|
|696|696|[count-binary-substrings](https://leetcode.com/problems/count-binary-substrings)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0696-0696(count-binary-substrings)/count-binary-substrings.java)|[:memo:](https://leetcode.com/articles/count-binary-substrings/)|65.4%|
|2675|2639|[find-the-width-of-columns-of-a-grid](https://leetcode.com/problems/find-the-width-of-columns-of-a-grid)|||65.4%|
|1704|1582|[special-positions-in-a-binary-matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix)|||65.3%|
|1812|1694|[reformat-phone-number](https://leetcode.com/problems/reformat-phone-number)|||65.1%|
|2320|2200|[find-all-k-distant-indices-in-an-array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array)|||64.9%|
|2345|2224|[minimum-number-of-operations-to-convert-time](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time)|||64.9%|
|1510|1394|[find-lucky-integer-in-an-array](https://leetcode.com/problems/find-lucky-integer-in-an-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1510-1394(find-lucky-integer-in-an-array)/find-lucky-integer-in-an-array.java)|[:memo:](https://leetcode.com/articles/find-lucky-integer-in-an-array/)|64.7%|
|817|706|[design-hashmap](https://leetcode.com/problems/design-hashmap)||[:memo:](https://leetcode.com/articles/design-hashmap/)|64.6%|
|1720|1598|[crawler-log-folder](https://leetcode.com/problems/crawler-log-folder)|||64.6%|
|2283|2164|[sort-even-and-odd-indices-independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently)|||64.6%|
|898|867|[transpose-matrix](https://leetcode.com/problems/transpose-matrix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0898-0867(transpose-matrix)/transpose-matrix.java)|[:memo:](https://leetcode.com/articles/transpose-matrix/)|64.5%|
|2480|2395|[find-subarrays-with-equal-sum](https://leetcode.com/problems/find-subarrays-with-equal-sum)|||64.4%|
|1195|1103|[distribute-candies-to-people](https://leetcode.com/problems/distribute-candies-to-people)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1195-1103(distribute-candies-to-people)/distribute-candies-to-people.java)|[:memo:](https://leetcode.com/articles/distribute-candies-to-people/)|64.3%|
|928|892|[surface-area-of-3d-shapes](https://leetcode.com/problems/surface-area-of-3d-shapes)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0928-0892(surface-area-of-3d-shapes)/surface-area-of-3d-shapes.java)|[:memo:](https://leetcode.com/articles/surface-area-of-3d-shapes/)|64.2%|
|1566|1455|[check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence)|||64.2%|
|606|606|[construct-string-from-binary-tree](https://leetcode.com/problems/construct-string-from-binary-tree)||[:memo:](https://leetcode.com/articles/construct-string-from-binary-tree/)|64.1%|
|1382|2303|[calculate-amount-paid-in-taxes](https://leetcode.com/problems/calculate-amount-paid-in-taxes)|||64.1%|
|169|169|[majority-element](https://leetcode.com/problems/majority-element)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0169-0169(majority-element)/majority-element.java)|[:memo:](https://leetcode.com/articles/majority-element/)|63.9%|
|1584|1491|[average-salary-excluding-the-minimum-and-maximum-salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary)||[:memo:](https://leetcode.com/articles/average-salary-excluding-the-minimum-and-maximum-salary/)|63.9%|
|2177|2068|[check-whether-two-strings-are-almost-equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent)|||63.9%|
|2580|2490|[circular-sentence](https://leetcode.com/problems/circular-sentence)|||63.9%|
|1236|1137|[n-th-tribonacci-number](https://leetcode.com/problems/n-th-tribonacci-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1236-1137(n-th-tribonacci-number)/n-th-tribonacci-number.java)|[:memo:](https://leetcode.com/articles/n-th-tribonacci-number/)|63.7%|
|1524|1408|[string-matching-in-an-array](https://leetcode.com/problems/string-matching-in-an-array)|||63.7%|
|2386|2293|[min-max-game](https://leetcode.com/problems/min-max-game)|||63.7%|
|1156|1078|[occurrences-after-bigram](https://leetcode.com/problems/occurrences-after-bigram)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1156-1078(occurrences-after-bigram)/occurrences-after-bigram.java)||63.6%|
|1293|1550|[three-consecutive-odds](https://leetcode.com/problems/three-consecutive-odds)|||63.5%|
|232|232|[implement-queue-using-stacks](https://leetcode.com/problems/implement-queue-using-stacks)||[:memo:](https://leetcode.com/articles/implement-queue-using-stacks/)|63.4%|
|747|746|[min-cost-climbing-stairs](https://leetcode.com/problems/min-cost-climbing-stairs)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0747-0746(min-cost-climbing-stairs)/min-cost-climbing-stairs.java)|[:memo:](https://leetcode.com/articles/min-cost-climbing-stairs/)|63.4%|
|1283|1507|[reformat-date](https://leetcode.com/problems/reformat-date)|||63.4%|
|1666|1544|[make-the-string-great](https://leetcode.com/problems/make-the-string-great)||[:memo:](https://leetcode.com/articles/make-the-string-great/)|63.2%|
|242|242|[valid-anagram](https://leetcode.com/problems/valid-anagram)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0242-0242(valid-anagram)/valid-anagram.java)|[:memo:](https://leetcode.com/articles/valid-anagram/)|63.1%|
|1927|1800|[maximum-ascending-subarray-sum](https://leetcode.com/problems/maximum-ascending-subarray-sum)|||63.1%|
|566|566|[reshape-the-matrix](https://leetcode.com/problems/reshape-the-matrix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0566-0566(reshape-the-matrix)/reshape-the-matrix.java)|[:memo:](https://leetcode.com/articles/reshape-the-matrix/)|63.0%|
|268|268|[missing-number](https://leetcode.com/problems/missing-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0268-0268(missing-number)/missing-number.java)|[:memo:](https://leetcode.com/articles/missing-number/)|62.8%|
|21|21|[merge-two-sorted-lists](https://leetcode.com/problems/merge-two-sorted-lists)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0021-0021(merge-two-sorted-lists)/merge-two-sorted-lists.java)|[:memo:](https://leetcode.com/articles/merge-two-sorted-lists/)|62.6%|
|1755|1652|[defuse-the-bomb](https://leetcode.com/problems/defuse-the-bomb)|||62.6%|
|2195|2073|[time-needed-to-buy-tickets](https://leetcode.com/problems/time-needed-to-buy-tickets)|||62.4%|
|2235|2129|[capitalize-the-title](https://leetcode.com/problems/capitalize-the-title)|||62.4%|
|899|868|[binary-gap](https://leetcode.com/problems/binary-gap)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0899-0868(binary-gap)/binary-gap.java)|[:memo:](https://leetcode.com/articles/binary-gap/)|62.3%|
|171|171|[excel-sheet-column-number](https://leetcode.com/problems/excel-sheet-column-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0171-0171(excel-sheet-column-number)/excel-sheet-column-number.java)|[:memo:](https://leetcode.com/articles/excel-sheet-column-number/)|62.2%|
|733|733|[flood-fill](https://leetcode.com/problems/flood-fill)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0733-0733(flood-fill)/flood-fill.java)|[:memo:](https://leetcode.com/articles/flood-fill/)|62.2%|
|953|917|[reverse-only-letters](https://leetcode.com/problems/reverse-only-letters)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0953-0917(reverse-only-letters)/reverse-only-letters.java)|[:memo:](https://leetcode.com/articles/reverse-only-letters/)|62.2%|
|2715|2600|[k-items-with-the-maximum-sum](https://leetcode.com/problems/k-items-with-the-maximum-sum)|||61.8%|
|2076|1945|[sum-of-digits-of-string-after-convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert)|||61.7%|
|257|257|[binary-tree-paths](https://leetcode.com/problems/binary-tree-paths)||[:memo:](https://leetcode.com/articles/binary-tree-paths/)|61.6%|
|693|693|[binary-number-with-alternating-bits](https://leetcode.com/problems/binary-number-with-alternating-bits)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0693-0693(binary-number-with-alternating-bits)/binary-number-with-alternating-bits.java)|[:memo:](https://leetcode.com/articles/binary-number-with-alternating-bits/)|61.6%|
|217|217|[contains-duplicate](https://leetcode.com/problems/contains-duplicate)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0217-0217(contains-duplicate)/contains-duplicate.java)|[:memo:](https://leetcode.com/articles/contains-duplicate/)|61.4%|
|283|283|[move-zeroes](https://leetcode.com/problems/move-zeroes)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0283-0283(move-zeroes)/move-zeroes.java)|[:memo:](https://leetcode.com/articles/move-zeroes/)|61.4%|
|1054|1009|[complement-of-base-10-integer](https://leetcode.com/problems/complement-of-base-10-integer)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1054-1009(complement-of-base-10-integer)/complement-of-base-10-integer.java)|[:memo:](https://leetcode.com/articles/complement-of-base-10-integer/)|61.4%|
|1873|1763|[longest-nice-substring](https://leetcode.com/problems/longest-nice-substring)|||61.4%|
|653|653|[two-sum-iv-input-is-a-bst](https://leetcode.com/problems/two-sum-iv-input-is-a-bst)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0653-0653(two-sum-iv-input-is-a-bst)/two-sum-iv-input-is-a-bst.java)|[:memo:](https://leetcode.com/articles/two-sum-iv/)|61.1%|
|1542|1446|[consecutive-characters](https://leetcode.com/problems/consecutive-characters)||[:memo:](https://leetcode.com/articles/consecutive-characters/)|61.0%|
|119|119|[pascals-triangle-ii](https://leetcode.com/problems/pascals-triangle-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0119-0119(pascals-triangle-ii)/pascals-triangle-ii.java)|[:memo:](https://leetcode.com/articles/pascals-triangle-ii/)|60.9%|
|1297|1189|[maximum-number-of-balloons](https://leetcode.com/problems/maximum-number-of-balloons)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1297-1189(maximum-number-of-balloons)/maximum-number-of-balloons.java)|[:memo:](https://leetcode.com/articles/maximum-number-of-balloons/)|60.9%|
|506|506|[relative-ranks](https://leetcode.com/problems/relative-ranks)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0506-0506(relative-ranks)/relative-ranks.java)||60.8%|
|924|888|[fair-candy-swap](https://leetcode.com/problems/fair-candy-swap)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0924-0888(fair-candy-swap)/fair-candy-swap.java)|[:memo:](https://leetcode.com/articles/fair-candy-swap/)|60.8%|
|2248|2144|[minimum-cost-of-buying-candies-with-discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount)|||60.8%|
|2327|2231|[largest-number-after-digit-swaps-by-parity](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity)|||60.7%|
|1642|1518|[water-bottles](https://leetcode.com/problems/water-bottles)|||60.5%|
|1730|1608|[special-array-with-x-elements-greater-than-or-equal-x](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x)|||60.5%|
|2433|2347|[best-poker-hand](https://leetcode.com/problems/best-poker-hand)|||60.5%|
|1999|1869|[longer-contiguous-segments-of-ones-than-zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros)|||60.4%|
|521|521|[longest-uncommon-subsequence-i](https://leetcode.com/problems/longest-uncommon-subsequence-i)||[:memo:](https://leetcode.com/articles/longest-uncommon-subsequence-i/)|60.3%|
|2704|2566|[maximum-difference-by-remapping-a-digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit)|||60.3%|
|563|563|[binary-tree-tilt](https://leetcode.com/problems/binary-tree-tilt)||[:memo:](https://leetcode.com/articles/binary-tree-tilt/)|60.2%|
|1983|1854|[maximum-population-year](https://leetcode.com/problems/maximum-population-year)|||60.1%|
|448|448|[find-all-numbers-disappeared-in-an-array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0448-0448(find-all-numbers-disappeared-in-an-array)/find-all-numbers-disappeared-in-an-array.java)|[:memo:](https://leetcode.com/articles/find-all-numbers-disappeared-in-an-array/)|60.0%|
|2679|2549|[count-distinct-numbers-on-board](https://leetcode.com/problems/count-distinct-numbers-on-board)|||60.0%|
|830|812|[largest-triangle-area](https://leetcode.com/problems/largest-triangle-area)||[:memo:](https://leetcode.com/articles/largest-triangle-area/)|59.9%|
|2122|1995|[count-special-quadruplets](https://leetcode.com/problems/count-special-quadruplets)|||59.9%|
|303|303|[range-sum-query-immutable](https://leetcode.com/problems/range-sum-query-immutable)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0303-0303(range-sum-query-immutable)/range-sum-query-immutable.java)|[:memo:](https://leetcode.com/articles/range-sum-query-immutable/)|59.8%|
|389|389|[find-the-difference](https://leetcode.com/problems/find-the-difference)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0389-0389(find-the-difference)/find-the-difference.java)|[:memo:](https://leetcode.com/articles/find-the-difference/)|59.8%|
|387|387|[first-unique-character-in-a-string](https://leetcode.com/problems/first-unique-character-in-a-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0387-0387(first-unique-character-in-a-string)/first-unique-character-in-a-string.java)|[:memo:](https://leetcode.com/articles/first-unique-character-in-a-string/)|59.7%|
|2269|2148|[count-elements-with-strictly-smaller-and-greater-elements](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements)|||59.6%|
|2312|2190|[most-frequent-number-following-key-in-an-array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array)|||59.6%|
|2346|2264|[largest-3-same-digit-number-in-string](https://leetcode.com/problems/largest-3-same-digit-number-in-string)|||59.5%|
|2547|2451|[odd-string-difference](https://leetcode.com/problems/odd-string-difference)|||59.5%|
|2025|1897|[redistribute-characters-to-make-all-strings-equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal)|||59.4%|
|2542|2455|[average-value-of-even-numbers-that-are-divisible-by-three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three)|||59.4%|
|749|748|[shortest-completing-word](https://leetcode.com/problems/shortest-completing-word)||[:memo:](https://leetcode.com/articles/shortest-completing-word/)|59.3%|
|799|783|[minimum-distance-between-bst-nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes)||[:memo:](https://leetcode.com/articles/minimum-distance-between-bst-nodes/)|59.3%|
|1221|1287|[element-appearing-more-than-25-in-sorted-array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1221-1287(element-appearing-more-than-25-in-sorted-array)/element-appearing-more-than-25-in-sorted-array.java)||59.3%|
|1256|1331|[rank-transform-of-an-array](https://leetcode.com/problems/rank-transform-of-an-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1256-1331(rank-transform-of-an-array)/rank-transform-of-an-array.java)||59.3%|
|2132|2022|[convert-1d-array-into-2d-array](https://leetcode.com/problems/convert-1d-array-into-2d-array)|||59.2%|
|1746|1624|[largest-substring-between-two-equal-characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters)|||59.1%|
|1751|1629|[slowest-key](https://leetcode.com/problems/slowest-key)||[:memo:](https://leetcode.com/articles/slowest-key/)|59.1%|
|225|225|[implement-stack-using-queues](https://leetcode.com/problems/implement-stack-using-queues)||[:memo:](https://leetcode.com/articles/implement-stack-using-queues/)|58.8%|
|1548|1437|[check-if-all-1s-are-at-least-length-k-places-away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away)||[:memo:](https://leetcode.com/articles/check-if-all-ones-are-at-least-k-places-away/)|58.7%|
|13|13|[roman-to-integer](https://leetcode.com/problems/roman-to-integer)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0013-0013(roman-to-integer)/roman-to-integer.java)|[:memo:](https://leetcode.com/articles/roman-to-integer/)|58.6%|
|1646|1539|[kth-missing-positive-number](https://leetcode.com/problems/kth-missing-positive-number)||[:memo:](https://leetcode.com/articles/kth-missing-positive-number/)|58.6%|
|1682|1560|[most-visited-sector-in-a-circular-track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track)|||58.6%|
|2316|2210|[count-hills-and-valleys-in-an-array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array)|||58.5%|
|383|383|[ransom-note](https://leetcode.com/problems/ransom-note)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0383-0383(ransom-note)/ransom-note.java)|[:memo:](https://leetcode.com/articles/ransom-note/)|58.4%|
|932|896|[monotonic-array](https://leetcode.com/problems/monotonic-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0932-0896(monotonic-array)/monotonic-array.java)|[:memo:](https://leetcode.com/articles/monotonic-array/)|58.4%|
|1884|1758|[minimum-changes-to-make-alternating-binary-string](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string)|||58.4%|
|2083|1952|[three-divisors](https://leetcode.com/problems/three-divisors)|||58.4%|
|100|100|[same-tree](https://leetcode.com/problems/same-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0100-0100(same-tree)/same-tree.java)|[:memo:](https://leetcode.com/articles/same-tree/)|58.3%|
|1353|2273|[find-resultant-array-after-removing-anagrams](https://leetcode.com/problems/find-resultant-array-after-removing-anagrams)|||58.2%|
|2372|2287|[rearrange-characters-to-make-target-string](https://leetcode.com/problems/rearrange-characters-to-make-target-string)|||58.1%|
|2561|2465|[number-of-distinct-averages](https://leetcode.com/problems/number-of-distinct-averages)|||58.1%|
|1537|1422|[maximum-score-after-splitting-a-string](https://leetcode.com/problems/maximum-score-after-splitting-a-string)|||58.0%|
|2215|2094|[finding-3-digit-even-numbers](https://leetcode.com/problems/finding-3-digit-even-numbers)|||57.9%|
|2463|2379|[minimum-recolors-to-get-k-consecutive-black-blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks)|||57.9%|
|1430|2269|[find-the-k-beauty-of-a-number](https://leetcode.com/problems/find-the-k-beauty-of-a-number)|||57.8%|
|1289|1185|[day-of-the-week](https://leetcode.com/problems/day-of-the-week)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1289-1185(day-of-the-week)/day-of-the-week.java)||57.4%|
|1975|1848|[minimum-distance-to-the-target-element](https://leetcode.com/problems/minimum-distance-to-the-target-element)|||57.4%|
|530|530|[minimum-absolute-difference-in-bst](https://leetcode.com/problems/minimum-absolute-difference-in-bst)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0530-0530(minimum-absolute-difference-in-bst)/minimum-absolute-difference-in-bst.java)|[:memo:](https://leetcode.com/articles/minimum-absolute-difference-in-bst/)|57.3%|
|1302|1957|[delete-characters-to-make-fancy-string](https://leetcode.com/problems/delete-characters-to-make-fancy-string)|||57.1%|
|520|520|[detect-capital](https://leetcode.com/problems/detect-capital)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0520-0520(detect-capital)/detect-capital.java)|[:memo:](https://leetcode.com/articles/detect-capital/)|57.0%|
|543|543|[diameter-of-binary-tree](https://leetcode.com/problems/diameter-of-binary-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0543-0543(diameter-of-binary-tree)/diameter-of-binary-tree.java)|[:memo:](https://leetcode.com/articles/diameter-of-binary-tree/)|57.0%|
|495|495|[teemo-attacking](https://leetcode.com/problems/teemo-attacking)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0495-0495(teemo-attacking)/teemo-attacking.java)|[:memo:](https://leetcode.com/articles/teemo-attacking/)|56.9%|
|404|404|[sum-of-left-leaves](https://leetcode.com/problems/sum-of-left-leaves)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0404-0404(sum-of-left-leaves)/sum-of-left-leaves.java)|[:memo:](https://leetcode.com/articles/sum-of-left-leaves/)|56.8%|
|485|485|[max-consecutive-ones](https://leetcode.com/problems/max-consecutive-ones)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0485-0485(max-consecutive-ones)/max-consecutive-ones.java)|[:memo:](https://leetcode.com/articles/max-consecutive-ones/)|56.7%|
|1146|1071|[greatest-common-divisor-of-strings](https://leetcode.com/problems/greatest-common-divisor-of-strings)||[:memo:](https://leetcode.com/articles/greatest-common-divisor-of-strings/)|56.5%|
|2412|2335|[minimum-amount-of-time-to-fill-cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups)|||56.5%|
|2032|1903|[largest-odd-number-in-string](https://leetcode.com/problems/largest-odd-number-in-string)|||56.4%|
|1760|1640|[check-array-formation-through-concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation)||[:memo:](https://leetcode.com/articles/check-array-formation-through-concatenation/)|56.3%|
|792|704|[binary-search](https://leetcode.com/problems/binary-search)||[:memo:](https://leetcode.com/articles/binary-search/)|56.2%|
|292|292|[nim-game](https://leetcode.com/problems/nim-game)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0292-0292(nim-game)/nim-game.java)|[:memo:](https://leetcode.com/articles/nim-game/)|56.1%|
|350|350|[intersection-of-two-arrays-ii](https://leetcode.com/problems/intersection-of-two-arrays-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0350-0350(intersection-of-two-arrays-ii)/intersection-of-two-arrays-ii.java)|[:memo:](https://leetcode.com/articles/intersection-of-two-arrays-ii/)|56.1%|
|2391|2299|[strong-password-checker-ii](https://leetcode.com/problems/strong-password-checker-ii)|||56.1%|
|697|697|[degree-of-an-array](https://leetcode.com/problems/degree-of-an-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0697-0697(degree-of-an-array)/degree-of-an-array.java)|[:memo:](https://leetcode.com/articles/degree-of-an-array/)|56.0%|
|1619|1496|[path-crossing](https://leetcode.com/problems/path-crossing)|||56.0%|
|2015|1886|[determine-whether-matrix-can-be-obtained-by-rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation)|||56.0%|
|789|703|[kth-largest-element-in-a-stream](https://leetcode.com/problems/kth-largest-element-in-a-stream)||[:memo:](https://leetcode.com/articles/kth-largest-element-in-a-stream/)|55.5%|
|598|598|[range-addition-ii](https://leetcode.com/problems/range-addition-ii)||[:memo:](https://leetcode.com/articles/range-addition-ii/)|55.4%|
|661|661|[image-smoother](https://leetcode.com/problems/image-smoother)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0661-0661(image-smoother)/image-smoother.java)|[:memo:](https://leetcode.com/articles/image-smoother/)|55.4%|
|812|796|[rotate-string](https://leetcode.com/problems/rotate-string)||[:memo:](https://leetcode.com/articles/rotate-string/)|55.4%|
|1440|1317|[convert-integer-to-the-sum-of-two-no-zero-integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1440-1317(convert-integer-to-the-sum-of-two-no-zero-integers)/convert-integer-to-the-sum-of-two-no-zero-integers.java)||55.4%|
|492|492|[construct-the-rectangle](https://leetcode.com/problems/construct-the-rectangle)|||55.0%|
|724|724|[find-pivot-index](https://leetcode.com/problems/find-pivot-index)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0724-0724(find-pivot-index)/find-pivot-index.java)|[:memo:](https://leetcode.com/articles/find-pivot-index/)|55.0%|
|202|202|[happy-number](https://leetcode.com/problems/happy-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0202-0202(happy-number)/happy-number.java)|[:memo:](https://leetcode.com/articles/happy-number/)|54.9%|
|1279|1175|[prime-arrangements](https://leetcode.com/problems/prime-arrangements)|||54.9%|
|1018|976|[largest-perimeter-triangle](https://leetcode.com/problems/largest-perimeter-triangle)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1018-0976(largest-perimeter-triangle)/largest-perimeter-triangle.java)|[:memo:](https://leetcode.com/articles/largest-perimeter-triangle/)|54.7%|
|1035|993|[cousins-in-binary-tree](https://leetcode.com/problems/cousins-in-binary-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1035-0993(cousins-in-binary-tree)/cousins-in-binary-tree.java)|[:memo:](https://leetcode.com/articles/cousins-in-binary-tree/)|54.7%|
|2112|1984|[minimum-difference-between-highest-and-lowest-of-k-scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores)|||54.6%|
|101|101|[symmetric-tree](https://leetcode.com/problems/symmetric-tree)||[:memo:](https://leetcode.com/articles/symmetric-tree/)|54.5%|
|160|160|[intersection-of-two-linked-lists](https://leetcode.com/problems/intersection-of-two-linked-lists)||[:memo:](https://leetcode.com/articles/intersection-of-two-linked-lists/)|54.5%|
|990|953|[verifying-an-alien-dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0990-0953(verifying-an-alien-dictionary)/verifying-an-alien-dictionary.java)|[:memo:](https://leetcode.com/articles/verifying-an-alien-dictionary/)|54.5%|
|1532|1417|[reformat-the-string](https://leetcode.com/problems/reformat-the-string)|||54.5%|
|1660|1556|[thousand-separator](https://leetcode.com/problems/thousand-separator)|||54.5%|
|2144|2016|[maximum-difference-between-increasing-elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements)|||54.4%|
|121|121|[best-time-to-buy-and-sell-stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0121-0121(best-time-to-buy-and-sell-stock)/best-time-to-buy-and-sell-stock.java)|[:memo:](https://leetcode.com/articles/best-time-to-buy-and-sell-stock/)|54.3%|
|190|190|[reverse-bits](https://leetcode.com/problems/reverse-bits)||[:memo:](https://leetcode.com/articles/reverse-bits/)|54.3%|
|1400|1275|[find-winner-on-a-tic-tac-toe-game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1400-1275(find-winner-on-a-tic-tac-toe-game)/find-winner-on-a-tic-tac-toe-game.java)|[:memo:](https://leetcode.com/articles/find-winner-on-a-tic-tac-toe-game/)|54.2%|
|409|409|[longest-palindrome](https://leetcode.com/problems/longest-palindrome)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0409-0409(longest-palindrome)/longest-palindrome.java)|[:memo:](https://leetcode.com/articles/longest-palindrome/)|54.1%|
|2154|2027|[minimum-moves-to-convert-string](https://leetcode.com/problems/minimum-moves-to-convert-string)|||54.1%|
|1287|1184|[distance-between-bus-stops](https://leetcode.com/problems/distance-between-bus-stops)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1287-1184(distance-between-bus-stops)/distance-between-bus-stops.java)||54.0%|
|9|9|[palindrome-number](https://leetcode.com/problems/palindrome-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0009-0009(palindrome-number)/palindrome-number.java)|[:memo:](https://leetcode.com/articles/palindrome-number/)|53.7%|
|594|594|[longest-harmonious-subsequence](https://leetcode.com/problems/longest-harmonious-subsequence)||[:memo:](https://leetcode.com/articles/longest-harmonious-subsequence/)|53.6%|
|599|599|[minimum-index-sum-of-two-lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists)||[:memo:](https://leetcode.com/articles/minimum-index-sum-of-two-lists/)|53.6%|
|2668|2605|[form-smallest-number-from-two-digit-arrays](https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays)|||53.6%|
|2093|1961|[check-if-string-is-a-prefix-of-array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array)|||53.3%|
|27|27|[remove-element](https://leetcode.com/problems/remove-element)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0027-0027(remove-element)/remove-element.java)|[:memo:](https://leetcode.com/articles/remove-element/)|53.2%|
|890|860|[lemonade-change](https://leetcode.com/problems/lemonade-change)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0890-0860(lemonade-change)/lemonade-change.java)|[:memo:](https://leetcode.com/articles/lemonade-change/)|52.9%|
|415|415|[add-strings](https://leetcode.com/problems/add-strings)||[:memo:](https://leetcode.com/articles/add-strings/)|52.5%|
|2575|2481|[minimum-cuts-to-divide-a-circle](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle)|||52.5%|
|67|67|[add-binary](https://leetcode.com/problems/add-binary)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0067-0067(add-binary)/add-binary.java)|[:memo:](https://leetcode.com/articles/add-binary/)|52.4%|
|401|401|[binary-watch](https://leetcode.com/problems/binary-watch)|||52.4%|
|70|70|[climbing-stairs](https://leetcode.com/problems/climbing-stairs)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0070-0070(climbing-stairs)/climbing-stairs.java)|[:memo:](https://leetcode.com/articles/climbing-stairs/)|52.2%|
|2254|2133|[check-if-every-row-and-column-contains-all-numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers)|||52.2%|
|2121|1971|[find-if-path-exists-in-graph](https://leetcode.com/problems/find-if-path-exists-in-graph)||[:memo:](https://leetcode.com/articles/find-if-path-exists-in-graph/)|52.0%|
|374|374|[guess-number-higher-or-lower](https://leetcode.com/problems/guess-number-higher-or-lower)||[:memo:](https://leetcode.com/articles/guess-number-higher-or-lower/)|51.9%|
|857|830|[positions-of-large-groups](https://leetcode.com/problems/positions-of-large-groups)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0857-0830(positions-of-large-groups)/positions-of-large-groups.java)|[:memo:](https://leetcode.com/articles/positions-of-large-groups/)|51.8%|
|26|26|[remove-duplicates-from-sorted-array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0026-0026(remove-duplicates-from-sorted-array)/remove-duplicates-from-sorted-array.java)|[:memo:](https://leetcode.com/articles/remove-duplicates-from-sorted-array/)|51.7%|
|1168|1089|[duplicate-zeros](https://leetcode.com/problems/duplicate-zeros)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1168-1089(duplicate-zeros)/duplicate-zeros.java)|[:memo:](https://leetcode.com/articles/duplicate-zeros/)|51.5%|
|2634|2540|[minimum-common-value](https://leetcode.com/problems/minimum-common-value)|||51.1%|
|2486|2404|[most-frequent-even-element](https://leetcode.com/problems/most-frequent-even-element)|||50.9%|
|1047|1005|[maximize-sum-of-array-after-k-negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations)|||50.8%|
|83|83|[remove-duplicates-from-sorted-list](https://leetcode.com/problems/remove-duplicates-from-sorted-list)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0083-0083(remove-duplicates-from-sorted-list)/remove-duplicates-from-sorted-list.java)|[:memo:](https://leetcode.com/articles/remove-duplicates-from-sorted-list/)|50.7%|
|541|541|[reverse-string-ii](https://leetcode.com/problems/reverse-string-ii)||[:memo:](https://leetcode.com/articles/reverse-string-ii/)|50.4%|
|234|234|[palindrome-linked-list](https://leetcode.com/problems/palindrome-linked-list)||[:memo:](https://leetcode.com/articles/palindrome-linked-list/)|50.3%|
|2005|1893|[check-if-all-the-integers-in-a-range-are-covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered)|||50.3%|
|345|345|[reverse-vowels-of-a-string](https://leetcode.com/problems/reverse-vowels-of-a-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0345-0345(reverse-vowels-of-a-string)/reverse-vowels-of-a-string.java)|[:memo:](https://leetcode.com/articles/reverse-vowels-of-a-string/)|50.2%|
|1769|1646|[get-maximum-in-generated-array](https://leetcode.com/problems/get-maximum-in-generated-array)||[:memo:](https://leetcode.com/articles/get-maximum-in-generated-array/)|50.2%|
|1878|1752|[check-if-array-is-sorted-and-rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated)|||50.2%|
|2536|2446|[determine-if-two-events-have-conflict](https://leetcode.com/problems/determine-if-two-events-have-conflict)|||50.0%|
|455|455|[assign-cookies](https://leetcode.com/problems/assign-cookies)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0455-0455(assign-cookies)/assign-cookies.java)||49.9%|
|1|1|[two-sum](https://leetcode.com/problems/two-sum)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0001-0001(two-sum)/two-sum.java)|[:memo:](https://leetcode.com/articles/two-sum/)|49.8%|
|2518|2432|[the-employee-that-worked-on-the-longest-task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task)|||49.6%|
|1039|997|[find-the-town-judge](https://leetcode.com/problems/find-the-town-judge)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1039-0997(find-the-town-judge)/find-the-town-judge.java)|[:memo:](https://leetcode.com/articles/find-the-town-judge/)|49.5%|
|1904|1796|[second-largest-digit-in-a-string](https://leetcode.com/problems/second-largest-digit-in-a-string)|||49.5%|
|501|501|[find-mode-in-binary-search-tree](https://leetcode.com/problems/find-mode-in-binary-search-tree)|||49.4%|
|1260|1154|[day-of-the-year](https://leetcode.com/problems/day-of-the-year)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1260-1154(day-of-the-year)/day-of-the-year.java)||49.4%|
|1630|1523|[count-odd-numbers-in-an-interval-range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range)||[:memo:](https://leetcode.com/articles/count-odd-numbers-in-an-interval-range/)|49.4%|
|674|674|[longest-continuous-increasing-subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0674-0674(longest-continuous-increasing-subsequence)/longest-continuous-increasing-subsequence.java)|[:memo:](https://leetcode.com/articles/longest-continuous-increasing-subsequence/)|49.3%|
|110|110|[balanced-binary-tree](https://leetcode.com/problems/balanced-binary-tree)||[:memo:](https://leetcode.com/articles/balanced-binary-tree/)|49.2%|
|2598|2515|[shortest-distance-to-target-string-in-a-circular-array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array)|||48.8%|
|504|504|[base-7](https://leetcode.com/problems/base-7)|||48.6%|
|112|112|[path-sum](https://leetcode.com/problems/path-sum)||[:memo:](https://leetcode.com/articles/path-sum/)|48.4%|
|2694|2644|[find-the-maximum-divisibility-score](https://leetcode.com/problems/find-the-maximum-divisibility-score)|||48.4%|
|551|551|[student-attendance-record-i](https://leetcode.com/problems/student-attendance-record-i)||[:memo:](https://leetcode.com/articles/student-attendance-record-i/)|48.2%|
|1274|1360|[number-of-days-between-two-dates](https://leetcode.com/problems/number-of-days-between-two-dates)|||48.2%|
|874|844|[backspace-string-compare](https://leetcode.com/problems/backspace-string-compare)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0874-0844(backspace-string-compare)/backspace-string-compare.java)|[:memo:](https://leetcode.com/articles/backspace-string-compare/)|48.1%|
|1698|1576|[replace-all-s-to-avoid-consecutive-repeating-characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters)|||48.1%|
|141|141|[linked-list-cycle](https://leetcode.com/problems/linked-list-cycle)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0141-0141(linked-list-cycle)/linked-list-cycle.java)|[:memo:](https://leetcode.com/articles/linked-list-cycle/)|47.6%|
|392|392|[is-subsequence](https://leetcode.com/problems/is-subsequence)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0392-0392(is-subsequence)/is-subsequence.java)|[:memo:](https://leetcode.com/articles/is-subsequence/)|47.4%|
|228|228|[summary-ranges](https://leetcode.com/problems/summary-ranges)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0228-0228(summary-ranges)/summary-ranges.java)|[:memo:](https://leetcode.com/articles/summary-ranges/)|47.3%|
|748|747|[largest-number-at-least-twice-of-others](https://leetcode.com/problems/largest-number-at-least-twice-of-others)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0748-0747(largest-number-at-least-twice-of-others)/largest-number-at-least-twice-of-others.java)|[:memo:](https://leetcode.com/articles/largest-number-at-least-twice-of-others/)|47.3%|
|1227|1128|[number-of-equivalent-domino-pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1227-1128(number-of-equivalent-domino-pairs)/number-of-equivalent-domino-pairs.java)||47.2%|
|1031|989|[add-to-array-form-of-integer](https://leetcode.com/problems/add-to-array-form-of-integer)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1031-0989(add-to-array-form-of-integer)/add-to-array-form-of-integer.java)|[:memo:](https://leetcode.com/articles/add-to-array-form-of-integer/)|47.0%|
|88|88|[merge-sorted-array](https://leetcode.com/problems/merge-sorted-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0088-0088(merge-sorted-array)/merge-sorted-array.java)|[:memo:](https://leetcode.com/articles/merge-sorted-arrays/)|46.8%|
|405|405|[convert-a-number-to-hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal)|||46.8%|
|1071|1018|[binary-prefix-divisible-by-5](https://leetcode.com/problems/binary-prefix-divisible-by-5)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1071-1018(binary-prefix-divisible-by-5)/binary-prefix-divisible-by-5.java)||46.8%|
|572|572|[subtree-of-another-tree](https://leetcode.com/problems/subtree-of-another-tree)||[:memo:](https://leetcode.com/articles/subtree-of-another-tree/)|46.5%|
|441|441|[arranging-coins](https://leetcode.com/problems/arranging-coins)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0441-0441(arranging-coins)/arranging-coins.java)|[:memo:](https://leetcode.com/articles/arranging-coins/)|46.3%|
|203|203|[remove-linked-list-elements](https://leetcode.com/problems/remove-linked-list-elements)||[:memo:](https://leetcode.com/articles/remove-linked-list-elements/)|46.2%|
|342|342|[power-of-four](https://leetcode.com/problems/power-of-four)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0342-0342(power-of-four)/power-of-four.java)|[:memo:](https://leetcode.com/articles/power-of-four/)|46.2%|
|2645|2582|[pass-the-pillow](https://leetcode.com/problems/pass-the-pillow)|||46.2%|
|231|231|[power-of-two](https://leetcode.com/problems/power-of-two)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0231-0231(power-of-two)/power-of-two.java)|[:memo:](https://leetcode.com/articles/power-of-two/)|46.1%|
|745|744|[find-smallest-letter-greater-than-target](https://leetcode.com/problems/find-smallest-letter-greater-than-target)||[:memo:](https://leetcode.com/articles/find-smallest-letter-greater-than-target/)|46.0%|
|2723|2609|[find-the-longest-balanced-substring-of-a-binary-string](https://leetcode.com/problems/find-the-longest-balanced-substring-of-a-binary-string)|||46.0%|
|2337|2259|[remove-digit-from-number-to-maximize-result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result)|||45.9%|
|628|628|[maximum-product-of-three-numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0628-0628(maximum-product-of-three-numbers)/maximum-product-of-three-numbers.java)|[:memo:](https://leetcode.com/articles/maximmum-product-of-three-numbers/)|45.8%|
|717|717|[1-bit-and-2-bit-characters](https://leetcode.com/problems/1-bit-and-2-bit-characters)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0717-0717(1-bit-and-2-bit-characters)/1-bit-and-2-bit-characters.java)|[:memo:](https://leetcode.com/articles/1-bit-and-2-bit-characters/)|45.7%|
|326|326|[power-of-three](https://leetcode.com/problems/power-of-three)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0326-0326(power-of-three)/power-of-three.java)|[:memo:](https://leetcode.com/articles/power-of-three/)|45.6%|
|2350|2239|[find-closest-number-to-zero](https://leetcode.com/problems/find-closest-number-to-zero)|||45.3%|
|1915|1790|[check-if-one-string-swap-can-make-strings-equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal)|||45.2%|
|837|819|[most-common-word](https://leetcode.com/problems/most-common-word)||[:memo:](https://leetcode.com/articles/most-common-word/)|44.7%|
|111|111|[minimum-depth-of-binary-tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)||[:memo:](https://leetcode.com/articles/minimum-depth-of-binary-tree/)|44.6%|
|125|125|[valid-palindrome](https://leetcode.com/problems/valid-palindrome)||[:memo:](https://leetcode.com/articles/valid-palindrome/)|44.5%|
|671|671|[second-minimum-node-in-a-binary-tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree)||[:memo:](https://leetcode.com/articles/second-minimum-node-in-a-binary-tree/)|44.1%|
|866|836|[rectangle-overlap](https://leetcode.com/problems/rectangle-overlap)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0866-0836(rectangle-overlap)/rectangle-overlap.java)|[:memo:](https://leetcode.com/articles/rectangle-overlap/)|43.9%|
|2496|2409|[count-days-spent-together](https://leetcode.com/problems/count-days-spent-together)|||43.9%|
|66|66|[plus-one](https://leetcode.com/problems/plus-one)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0066-0066(plus-one)/plus-one.java)|[:memo:](https://leetcode.com/articles/plus-one/)|43.7%|
|459|459|[repeated-substring-pattern](https://leetcode.com/problems/repeated-substring-pattern)||[:memo:](https://leetcode.com/articles/repeated-substring-pattern/)|43.7%|
|643|643|[maximum-average-subarray-i](https://leetcode.com/problems/maximum-average-subarray-i)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0643-0643(maximum-average-subarray-i)/maximum-average-subarray-i.java)|[:memo:](https://leetcode.com/articles/maximum-average-subarray/)|43.7%|
|35|35|[search-insert-position](https://leetcode.com/problems/search-insert-position)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0035-0035(search-insert-position)/search-insert-position.java)|[:memo:](https://leetcode.com/articles/search-insert-position/)|43.6%|
|1714|1592|[rearrange-spaces-between-words](https://leetcode.com/problems/rearrange-spaces-between-words)|||43.5%|
|278|278|[first-bad-version](https://leetcode.com/problems/first-bad-version)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0278-0278(first-bad-version)/first-bad-version.java)|[:memo:](https://leetcode.com/articles/first-bad-version/)|43.4%|
|367|367|[valid-perfect-square](https://leetcode.com/problems/valid-perfect-square)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0367-0367(valid-perfect-square)/valid-perfect-square.java)|[:memo:](https://leetcode.com/articles/valid-perfect-square/)|43.4%|
|58|58|[length-of-last-word](https://leetcode.com/problems/length-of-last-word)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0058-0058(length-of-last-word)/length-of-last-word.java)|[:memo:](https://leetcode.com/articles/length-of-last-word/)|43.3%|
|482|482|[license-key-formatting](https://leetcode.com/problems/license-key-formatting)||[:memo:](https://leetcode.com/articles/license-key-formatting/)|43.3%|
|1689|1566|[detect-pattern-of-length-m-repeated-k-or-more-times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times)|||43.3%|
|2528|2437|[number-of-valid-clock-times](https://leetcode.com/problems/number-of-valid-clock-times)|||43.3%|
|205|205|[isomorphic-strings](https://leetcode.com/problems/isomorphic-strings)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0205-0205(isomorphic-strings)/isomorphic-strings.java)|[:memo:](https://leetcode.com/articles/isomorphic-strings/)|43.0%|
|2204|2099|[find-subsequence-of-length-k-with-the-largest-sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum)|||42.8%|
|219|219|[contains-duplicate-ii](https://leetcode.com/problems/contains-duplicate-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0219-0219(contains-duplicate-ii)/contains-duplicate-ii.java)|[:memo:](https://leetcode.com/articles/contains-duplicate-ii/)|42.6%|
|645|645|[set-mismatch](https://leetcode.com/problems/set-mismatch)||[:memo:](https://leetcode.com/articles/set-mismatch/)|42.6%|
|1062|1013|[partition-array-into-three-parts-with-equal-sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1062-1013(partition-array-into-three-parts-with-equal-sum)/partition-array-into-three-parts-with-equal-sum.java)||42.6%|
|1858|1736|[latest-time-by-replacing-hidden-digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits)|||42.5%|
|263|263|[ugly-number](https://leetcode.com/problems/ugly-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0263-0263(ugly-number)/ugly-number.java)|[:memo:](https://leetcode.com/articles/ugly-number/)|42.2%|
|290|290|[word-pattern](https://leetcode.com/problems/word-pattern)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0290-0290(word-pattern)/word-pattern.java)|[:memo:](https://leetcode.com/articles/word-pattern/)|41.7%|
|2459|2383|[minimum-hours-of-training-to-win-a-competition](https://leetcode.com/problems/minimum-hours-of-training-to-win-a-competition)|||41.0%|
|14|14|[longest-common-prefix](https://leetcode.com/problems/longest-common-prefix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0014-0014(longest-common-prefix)/longest-common-prefix.java)|[:memo:](https://leetcode.com/articles/longest-common-prefix/)|40.9%|
|20|20|[valid-parentheses](https://leetcode.com/problems/valid-parentheses)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0020-0020(valid-parentheses)/valid-parentheses.java)|[:memo:](https://leetcode.com/articles/valid-parentheses/)|40.5%|
|1349|1232|[check-if-it-is-a-straight-line](https://leetcode.com/problems/check-if-it-is-a-straight-line)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1349-1232(check-if-it-is-a-straight-line)/check-if-it-is-a-straight-line.java)|[:memo:](https://leetcode.com/articles/check-if-it-is-a-straight-line/)|40.2%|
|1910|1784|[check-if-binary-string-has-at-most-one-segment-of-ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)|||39.9%|
|680|680|[valid-palindrome-ii](https://leetcode.com/problems/valid-palindrome-ii)||[:memo:](https://leetcode.com/articles/valid-palindrome-ii/)|39.4%|
|28|28|[find-the-index-of-the-first-occurrence-in-a-string](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0028-0028(find-the-index-of-the-first-occurrence-in-a-string)/find-the-index-of-the-first-occurrence-in-a-string.java)|[:memo:](https://leetcode.com/articles/find-the-index-of-the-first-occurrence-in-a-string/)|39.3%|
|1764|1668|[maximum-repeating-substring](https://leetcode.com/problems/maximum-repeating-substring)|||39.3%|
|507|507|[perfect-number](https://leetcode.com/problems/perfect-number)||[:memo:](https://leetcode.com/articles/perfect-number/)|37.7%|
|2602|2511|[maximum-enemy-forts-that-can-be-captured](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured)|||37.7%|
|69|69|[sqrtx](https://leetcode.com/problems/sqrtx)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0069-0069(sqrtx)/sqrtx.java)|[:memo:](https://leetcode.com/articles/sqrtx/)|37.5%|
|434|434|[number-of-segments-in-a-string](https://leetcode.com/problems/number-of-segments-in-a-string)||[:memo:](https://leetcode.com/articles/number-of-segments-in-a-string/)|37.1%|
|1115|1037|[valid-boomerang](https://leetcode.com/problems/valid-boomerang)|||36.9%|
|1933|1805|[number-of-different-integers-in-a-string](https://leetcode.com/problems/number-of-different-integers-in-a-string)|||36.7%|
|1468|1346|[check-if-n-and-its-double-exist](https://leetcode.com/problems/check-if-n-and-its-double-exist)|||36.6%|
|168|168|[excel-sheet-column-title](https://leetcode.com/problems/excel-sheet-column-title)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0168-0168(excel-sheet-column-title)/excel-sheet-column-title.java)||35.7%|
|2619|2525|[categorize-box-according-to-criteria](https://leetcode.com/problems/categorize-box-according-to-criteria)|||34.3%|
|978|941|[valid-mountain-array](https://leetcode.com/problems/valid-mountain-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0978-0941(valid-mountain-array)/valid-mountain-array.java)|[:memo:](https://leetcode.com/articles/valid-mountain-array/)|33.4%|
|414|414|[third-maximum-number](https://leetcode.com/problems/third-maximum-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0414-0414(third-maximum-number)/third-maximum-number.java)|[:memo:](https://leetcode.com/articles/third-maximum-number/)|33.3%|
|2684|2660|[determine-the-winner-of-a-bowling-game](https://leetcode.com/problems/determine-the-winner-of-a-bowling-game)|||33.1%|
|961|925|[long-pressed-name](https://leetcode.com/problems/long-pressed-name)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0961-0925(long-pressed-name)/long-pressed-name.java)|[:memo:](https://leetcode.com/articles/long-pressed-name/)|33.0%|
|605|605|[can-place-flowers](https://leetcode.com/problems/can-place-flowers)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0605-0605(can-place-flowers)/can-place-flowers.java)|[:memo:](https://leetcode.com/articles/can-place-flowers/)|32.7%|
|2722|2614|[prime-in-diagonal](https://leetcode.com/problems/prime-in-diagonal)|||32.4%|
|950|914|[x-of-a-kind-in-a-deck-of-cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0950-0914(x-of-a-kind-in-a-deck-of-cards)/x-of-a-kind-in-a-deck-of-cards.java)|[:memo:](https://leetcode.com/articles/x-of-a-kind-in-a-deck-of-cards/)|31.0%|
|889|859|[buddy-strings](https://leetcode.com/problems/buddy-strings)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0889-0859(buddy-strings)/buddy-strings.java)|[:memo:](https://leetcode.com/articles/buddy-strings/)|29.2%|
|2173|2047|[number-of-valid-words-in-a-sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence)|||29.1%|
|2020|1909|[remove-one-element-to-make-the-array-strictly-increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing)|||26.2%|
|2663|2591|[distribute-money-to-maximum-children](https://leetcode.com/problems/distribute-money-to-maximum-children)|||18.5%|
|2532|2423|[remove-letter-to-equalize-frequency](https://leetcode.com/problems/remove-letter-to-equalize-frequency)|||17.8%|
|1807|1689|[partitioning-into-minimum-number-of-deci-binary-numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers)||[:memo:](https://leetcode.com/articles/partitioning-into-minimum-number-of-deci-binary-numbers/)|89.1%|
|1572|1476|[subrectangle-queries](https://leetcode.com/problems/subrectangle-queries)|||88.3%|
|2481|2396|[strictly-palindromic-number](https://leetcode.com/problems/strictly-palindromic-number)|||87.6%|
|1254|1302|[deepest-leaves-sum](https://leetcode.com/problems/deepest-leaves-sum)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1254-1302(deepest-leaves-sum)/deepest-leaves-sum.java)|[:memo:](https://leetcode.com/articles/deepest-leaves-sum/)|86.6%|
|1939|1828|[queries-on-number-of-points-inside-a-circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle)|||86.2%|
|535|535|[encode-and-decode-tinyurl](https://leetcode.com/problems/encode-and-decode-tinyurl)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0535-0535(encode-and-decode-tinyurl)/encode-and-decode-tinyurl.java)|[:memo:](https://leetcode.com/articles/encode-and-decode-tinyurl/)|86.0%|
|825|807|[max-increase-to-keep-city-skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0825-0807(max-increase-to-keep-city-skyline)/max-increase-to-keep-city-skyline.java)|[:memo:](https://leetcode.com/articles/max-increase-to-keep-city-skyline/)|86.0%|
|2299|2181|[merge-nodes-in-between-zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros)|||86.0%|
|2631|2545|[sort-the-students-by-their-kth-score](https://leetcode.com/problems/sort-the-students-by-their-kth-score)|||85.7%|
|2724|2610|[convert-an-array-into-a-2d-array-with-conditions](https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions)|||85.7%|
|1114|1038|[binary-search-tree-to-greater-sum-tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1114-1038(binary-search-tree-to-greater-sum-tree)/binary-search-tree-to-greater-sum-tree.java)||85.6%|
|1407|1282|[group-the-people-given-the-group-size-they-belong-to](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1407-1282(group-the-people-given-the-group-size-they-belong-to)/group-the-people-given-the-group-size-they-belong-to.java)||85.6%|
|1243|1315|[sum-of-nodes-with-even-valued-grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1243-1315(sum-of-nodes-with-even-valued-grandparent)/sum-of-nodes-with-even-valued-grandparent.java)||85.5%|
|2519|2433|[find-the-original-array-of-prefix-xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor)|||85.3%|
|1895|1769|[minimum-number-of-operations-to-move-all-balls-to-each-box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box)|||85.2%|
|2347|2265|[count-nodes-equal-to-average-of-subtree](https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree)|||85.1%|
|654|654|[maximum-binary-tree](https://leetcode.com/problems/maximum-binary-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0654-0654(maximum-binary-tree)/maximum-binary-tree.java)|[:memo:](https://leetcode.com/articles/maximum-binary-tree/)|84.8%|
|2265|2161|[partition-array-according-to-given-pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot)|||84.7%|
|1742|1637|[widest-vertical-area-between-two-points-containing-no-points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points)|||84.4%|
|2471|2391|[minimum-amount-of-time-to-collect-garbage](https://leetcode.com/problems/minimum-amount-of-time-to-collect-garbage)|||84.0%|
|1525|1409|[queries-on-a-permutation-with-key](https://leetcode.com/problems/queries-on-a-permutation-with-key)|||83.5%|
|1253|1329|[sort-the-matrix-diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally)||[:memo:](https://leetcode.com/articles/sort-the-matrix-diagonally/)|83.3%|
|2239|2120|[execution-of-all-suffix-instructions-staying-in-a-grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid)|||82.9%|
|813|797|[all-paths-from-source-to-target](https://leetcode.com/problems/all-paths-from-source-to-target)||[:memo:](https://leetcode.com/articles/all-paths-from-source-to-target/)|82.3%|
|2244|2125|[number-of-laser-beams-in-a-bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank)|||81.8%|
|1674|1551|[minimum-operations-to-make-array-equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal)||[:memo:](https://leetcode.com/articles/minimum-operations-to-make-array-equal/)|81.6%|
|1050|1008|[construct-binary-search-tree-from-preorder-traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1050-1008(construct-binary-search-tree-from-preorder-traversal)/construct-binary-search-tree-from-preorder-traversal.java)|[:memo:](https://leetcode.com/articles/construct-bst-from-preorder-traversal/)|81.2%|
|2271|2149|[rearrange-array-elements-by-sign](https://leetcode.com/problems/rearrange-array-elements-by-sign)|||81.1%|
|1285|1382|[balance-a-binary-search-tree](https://leetcode.com/problems/balance-a-binary-search-tree)|||80.7%|
|2236|2130|[maximum-twin-sum-of-a-linked-list](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list)||[:memo:](https://leetcode.com/articles/maximum-twin-sum-of-a-linked-list/)|80.5%|
|1752|1630|[arithmetic-subarrays](https://leetcode.com/problems/arithmetic-subarrays)|||80.4%|
|1945|1817|[finding-the-users-active-minutes](https://leetcode.com/problems/finding-the-users-active-minutes)|||80.3%|
|930|894|[all-possible-full-binary-trees](https://leetcode.com/problems/all-possible-full-binary-trees)||[:memo:](https://leetcode.com/articles/all-possible-full-binary-trees/)|80.0%|
|2487|2405|[optimal-partition-of-string](https://leetcode.com/problems/optimal-partition-of-string)||[:memo:](https://leetcode.com/articles/optimal-partition-of-string/)|80.0%|
|1310|2079|[watering-plants](https://leetcode.com/problems/watering-plants)|||79.9%|
|1988|1877|[minimize-maximum-pair-sum-in-array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array)|||79.9%|
|1427|1305|[all-elements-in-two-binary-search-trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1427-1305(all-elements-in-two-binary-search-trees)/all-elements-in-two-binary-search-trees.java)|[:memo:](https://leetcode.com/articles/all-elements-in-two-bsts/)|79.8%|
|768|763|[partition-labels](https://leetcode.com/problems/partition-labels)||[:memo:](https://leetcode.com/articles/partition-labels/)|79.7%|
|2606|2482|[difference-between-ones-and-zeros-in-row-and-column](https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column)|||79.7%|
|2766|2657|[find-the-prefix-common-array-of-two-arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays)|||79.6%|
|1661|1557|[minimum-number-of-vertices-to-reach-all-nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes)||[:memo:](https://leetcode.com/articles/minimum-number-of-vertices-to-reach-all-nodes/)|79.3%|
|1683|1561|[maximum-number-of-coins-you-can-get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get)|||79.2%|
|2402|2317|[maximum-xor-after-operations](https://leetcode.com/problems/maximum-xor-after-operations)|||79.2%|
|2525|2442|[count-number-of-distinct-integers-after-reverse-operations](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations)|||78.6%|
|2324|2221|[find-triangular-sum-of-an-array](https://leetcode.com/problems/find-triangular-sum-of-an-array)|||78.3%|
|1582|1472|[design-browser-history](https://leetcode.com/problems/design-browser-history)||[:memo:](https://leetcode.com/articles/design-browser-history/)|78.2%|
|1469|1347|[minimum-number-of-steps-to-make-two-strings-anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram)|||77.9%|
|1951|1823|[find-the-winner-of-the-circular-game](https://leetcode.com/problems/find-the-winner-of-the-circular-game)|||77.9%|
|987|950|[reveal-cards-in-increasing-order](https://leetcode.com/problems/reveal-cards-in-increasing-order)||[:memo:](https://leetcode.com/articles/reveal-cards-in-increasing-order/)|77.8%|
|1711|1605|[find-valid-matrix-given-row-and-column-sums](https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums)|||77.8%|
|926|890|[find-and-replace-pattern](https://leetcode.com/problems/find-and-replace-pattern)||[:memo:](https://leetcode.com/articles/find-and-replace-pattern/)|77.5%|
|1761|1641|[count-sorted-vowel-strings](https://leetcode.com/problems/count-sorted-vowel-strings)||[:memo:](https://leetcode.com/articles/count-sorted-vowel-strings/)|77.5%|
|1497|1381|[design-a-stack-with-increment-operation](https://leetcode.com/problems/design-a-stack-with-increment-operation)|||77.1%|
|2493|2415|[reverse-odd-levels-of-binary-tree](https://leetcode.com/problems/reverse-odd-levels-of-binary-tree)|||77.0%|
|1940|1829|[maximum-xor-for-each-query](https://leetcode.com/problems/maximum-xor-for-each-query)|||76.9%|
|1058|1061|[lexicographically-smallest-equivalent-string](https://leetcode.com/problems/lexicographically-smallest-equivalent-string)||[:memo:](https://leetcode.com/articles/lexicographically-smallest-equivalent-string/)|76.5%|
|1387|1261|[find-elements-in-a-contaminated-binary-tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree)|||76.4%|
|237|237|[delete-node-in-a-linked-list](https://leetcode.com/problems/delete-node-in-a-linked-list)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0237-0237(delete-node-in-a-linked-list)/delete-node-in-a-linked-list.java)|[:memo:](https://leetcode.com/articles/delete-node-in-a-linked-list/)|76.2%|
|1553|1442|[count-triplets-that-can-form-two-arrays-of-equal-xor](https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor)|||76.1%|
|1160|1079|[letter-tile-possibilities](https://leetcode.com/problems/letter-tile-possibilities)|||76.0%|
|46|46|[permutations](https://leetcode.com/problems/permutations)||[:memo:](https://leetcode.com/articles/permutations/)|75.8%|
|1092|1026|[maximum-difference-between-node-and-ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor)||[:memo:](https://leetcode.com/articles/maximum-difference-between-node-and-ancestor/)|75.8%|
|957|921|[minimum-add-to-make-parentheses-valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid)||[:memo:](https://leetcode.com/articles/minimum-add-to-make-parentheses-valid/)|75.6%|
|2170|2044|[count-number-of-maximum-bitwise-or-subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets)|||75.6%|
|829|811|[subdomain-visit-count](https://leetcode.com/problems/subdomain-visit-count)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0829-0811(subdomain-visit-count)/subdomain-visit-count.java)|[:memo:](https://leetcode.com/articles/subdomain-visit-count/)|75.5%|
|1242|1314|[matrix-block-sum](https://leetcode.com/problems/matrix-block-sum)|||75.5%|
|2413|2336|[smallest-number-in-infinite-set](https://leetcode.com/problems/smallest-number-in-infinite-set)||[:memo:](https://leetcode.com/articles/smallest-number-in-infinite-set/)|75.2%|
|78|78|[subsets](https://leetcode.com/problems/subsets)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0078-0078(subsets)/subsets.java)|[:memo:](https://leetcode.com/articles/subsets/)|75.1%|
|1194|1104|[path-in-zigzag-labelled-binary-tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree)|||75.1%|
|419|419|[battleships-in-a-board](https://leetcode.com/problems/battleships-in-a-board)|||74.9%|
|891|861|[score-after-flipping-matrix](https://leetcode.com/problems/score-after-flipping-matrix)||[:memo:](https://leetcode.com/articles/score-after-flipping-matrix/)|74.9%|
|2021|1910|[remove-all-occurrences-of-a-substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring)|||74.7%|
|772|427|[construct-quad-tree](https://leetcode.com/problems/construct-quad-tree)||[:memo:](https://leetcode.com/articles/construct-quad-tree/)|74.6%|
|1402|1277|[count-square-submatrices-with-all-ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1402-1277(count-square-submatrices-with-all-ones)/count-square-submatrices-with-all-ones.java)||74.6%|
|1450|1325|[delete-leaves-with-a-given-value](https://leetcode.com/problems/delete-leaves-with-a-given-value)|||74.6%|
|2411|2326|[spiral-matrix-iv](https://leetcode.com/problems/spiral-matrix-iv)|||74.6%|
|2456|2375|[construct-smallest-number-from-di-string](https://leetcode.com/problems/construct-smallest-number-from-di-string)|||74.4%|
|1544|1448|[count-good-nodes-in-binary-tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree)||[:memo:](https://leetcode.com/articles/count-good-nodes-in-binary-tree/)|74.3%|
|2508|2428|[maximum-sum-of-an-hourglass](https://leetcode.com/problems/maximum-sum-of-an-hourglass)|||74.3%|
|784|701|[insert-into-a-binary-search-tree](https://leetcode.com/problems/insert-into-a-binary-search-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0784-0701(insert-into-a-binary-search-tree)/insert-into-a-binary-search-tree.java)|[:memo:](https://leetcode.com/articles/insert-into-a-bst/)|74.2%|
|1533|1418|[display-table-of-food-orders-in-a-restaurant](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant)|||74.0%|
|1961|1833|[maximum-ice-cream-bars](https://leetcode.com/problems/maximum-ice-cream-bars)||[:memo:](https://leetcode.com/articles/maximum-ice-cream-bars/)|73.9%|
|800|784|[letter-case-permutation](https://leetcode.com/problems/letter-case-permutation)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0800-0784(letter-case-permutation)/letter-case-permutation.java)|[:memo:](https://leetcode.com/articles/letter-case-permutation/)|73.8%|
|1765|1669|[merge-in-between-linked-lists](https://leetcode.com/problems/merge-in-between-linked-lists)|||73.6%|
|442|442|[find-all-duplicates-in-an-array](https://leetcode.com/problems/find-all-duplicates-in-an-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0442-0442(find-all-duplicates-in-an-array)/find-all-duplicates-in-an-array.java)|[:memo:](https://leetcode.com/articles/find-all-duplicates-in-an-array/)|73.5%|
|921|885|[spiral-matrix-iii](https://leetcode.com/problems/spiral-matrix-iii)||[:memo:](https://leetcode.com/articles/spiral-matrix-iii/)|73.5%|
|1512|1396|[design-underground-system](https://leetcode.com/problems/design-underground-system)||[:memo:](https://leetcode.com/articles/design-underground-system/)|73.5%|
|2133|2023|[number-of-pairs-of-strings-with-concatenation-equal-to-target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target)|||73.5%|
|1211|1286|[iterator-for-combination](https://leetcode.com/problems/iterator-for-combination)||[:memo:](https://leetcode.com/articles/iterator-for-combination/)|73.3%|
|406|406|[queue-reconstruction-by-height](https://leetcode.com/problems/queue-reconstruction-by-height)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0406-0406(queue-reconstruction-by-height)/queue-reconstruction-by-height.java)|[:memo:](https://leetcode.com/articles/queue-reconstruction-by-height/)|73.0%|
|1208|1111|[maximum-nesting-depth-of-two-valid-parentheses-strings](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings)|||72.9%|
|2387|2294|[partition-array-such-that-maximum-difference-is-k](https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k)|||72.7%|
|22|22|[generate-parentheses](https://leetcode.com/problems/generate-parentheses)||[:memo:](https://leetcode.com/articles/generate-parentheses/)|72.6%|
|1516|1415|[the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n)|||72.6%|
|1652|1529|[minimum-suffix-flips](https://leetcode.com/problems/minimum-suffix-flips)|||72.6%|
|2470|2390|[removing-stars-from-a-string](https://leetcode.com/problems/removing-stars-from-a-string)||[:memo:](https://leetcode.com/articles/removing-stars-from-a-string/)|72.5%|
|832|814|[binary-tree-pruning](https://leetcode.com/problems/binary-tree-pruning)||[:memo:](https://leetcode.com/articles/binary-tree-pruning/)|72.4%|
|1021|979|[distribute-coins-in-binary-tree](https://leetcode.com/problems/distribute-coins-in-binary-tree)||[:memo:](https://leetcode.com/articles/distribute-coins-in-binary-tree/)|72.3%|
|1354|2225|[find-players-with-zero-or-one-losses](https://leetcode.com/problems/find-players-with-zero-or-one-losses)||[:memo:](https://leetcode.com/articles/find-players-with-zero-or-one-losses/)|72.3%|
|1435|1310|[xor-queries-of-a-subarray](https://leetcode.com/problems/xor-queries-of-a-subarray)|||72.3%|
|2306|2196|[create-binary-tree-from-descriptions](https://leetcode.com/problems/create-binary-tree-from-descriptions)|||72.3%|
|2356|2275|[largest-combination-with-bitwise-and-greater-than-zero](https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero)|||72.3%|
|1935|1806|[minimum-number-of-operations-to-reinitialize-a-permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation)|||72.1%|
|1552|1441|[build-an-array-with-stack-operations](https://leetcode.com/problems/build-an-array-with-stack-operations)|||71.9%|
|695|695|[max-area-of-island](https://leetcode.com/problems/max-area-of-island)||[:memo:](https://leetcode.com/articles/max-area-of-island/)|71.8%|
|1342|1222|[queens-that-can-attack-the-king](https://leetcode.com/problems/queens-that-can-attack-the-king)|||71.8%|
|2293|2186|[minimum-number-of-steps-to-make-two-strings-anagram-ii](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii)|||71.8%|
|1121|1043|[partition-array-for-maximum-sum](https://leetcode.com/problems/partition-array-for-maximum-sum)|||71.7%|
|1971|1860|[incremental-memory-leak](https://leetcode.com/problems/incremental-memory-leak)|||71.7%|
|871|841|[keys-and-rooms](https://leetcode.com/problems/keys-and-rooms)||[:memo:](https://leetcode.com/articles/keys-and-rooms/)|71.6%|
|1324|1706|[where-will-the-ball-fall](https://leetcode.com/problems/where-will-the-ball-fall)||[:memo:](https://leetcode.com/articles/where-will-the-ball-fall/)|71.6%|
|537|537|[complex-number-multiplication](https://leetcode.com/problems/complex-number-multiplication)||[:memo:](https://leetcode.com/articles/complex-number-multiplication/)|71.4%|
|1978|1850|[minimum-adjacent-swaps-to-reach-the-kth-smallest-number](https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number)|||71.4%|
|1028|986|[interval-list-intersections](https://leetcode.com/problems/interval-list-intersections)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1028-0986(interval-list-intersections)/interval-list-intersections.java)|[:memo:](https://leetcode.com/articles/interval-list-intersections/)|71.3%|
|2676|2640|[find-the-score-of-all-prefixes-of-an-array](https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array)|||71.3%|
|48|48|[rotate-image](https://leetcode.com/problems/rotate-image)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0048-0048(rotate-image)/rotate-image.java)|[:memo:](https://leetcode.com/articles/rotate-image/)|71.2%|
|1743|1638|[count-substrings-that-differ-by-one-character](https://leetcode.com/problems/count-substrings-that-differ-by-one-character)|||71.2%|
|929|893|[groups-of-special-equivalent-strings](https://leetcode.com/problems/groups-of-special-equivalent-strings)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0929-0893(groups-of-special-equivalent-strings)/groups-of-special-equivalent-strings.java)|[:memo:](https://leetcode.com/articles/groups-of-special-equivalent-strings/)|71.1%|
|925|889|[construct-binary-tree-from-preorder-and-postorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal)||[:memo:](https://leetcode.com/articles/construct-binary-tree-from-preorder-and-postorder-traversal/)|71.0%|
|1218|1123|[lowest-common-ancestor-of-deepest-leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves)|||71.0%|
|2031|1884|[egg-drop-with-2-eggs-and-n-floors](https://leetcode.com/problems/egg-drop-with-2-eggs-and-n-floors)|||70.8%|
|764|429|[n-ary-tree-level-order-traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal)||[:memo:](https://leetcode.com/articles/n-ary-tree-level-order-traversal/)|70.7%|
|2428|2352|[equal-row-and-column-pairs](https://leetcode.com/problems/equal-row-and-column-pairs)|||70.6%|
|2621|2527|[find-xor-beauty-of-array](https://leetcode.com/problems/find-xor-beauty-of-array)|||70.4%|
|230|230|[kth-smallest-element-in-a-bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0230-0230(kth-smallest-element-in-a-bst)/kth-smallest-element-in-a-bst.java)|[:memo:](https://leetcode.com/articles/kth-smallest-element-in-a-bst/)|70.3%|
|1009|969|[pancake-sorting](https://leetcode.com/problems/pancake-sorting)||[:memo:](https://leetcode.com/articles/pancake-sorting/)|70.2%|
|451|451|[sort-characters-by-frequency](https://leetcode.com/problems/sort-characters-by-frequency)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0451-0451(sort-characters-by-frequency)/sort-characters-by-frequency.java)|[:memo:](https://leetcode.com/articles/sort-characters-by-frequency/)|70.1%|
|1488|1387|[sort-integers-by-the-power-value](https://leetcode.com/problems/sort-integers-by-the-power-value)|||70.1%|
|173|173|[binary-search-tree-iterator](https://leetcode.com/problems/binary-search-tree-iterator)||[:memo:](https://leetcode.com/articles/binary-search-tree-iterator/)|69.9%|
|1459|1357|[apply-discount-every-n-orders](https://leetcode.com/problems/apply-discount-every-n-orders)|||69.9%|
|909|877|[stone-game](https://leetcode.com/problems/stone-game)||[:memo:](https://leetcode.com/articles/stone-game/)|69.8%|
|983|946|[validate-stack-sequences](https://leetcode.com/problems/validate-stack-sequences)||[:memo:](https://leetcode.com/articles/validate-stack-sequences/)|69.4%|
|1464|1338|[reduce-array-size-to-the-half](https://leetcode.com/problems/reduce-array-size-to-the-half)||[:memo:](https://leetcode.com/articles/reduce-array-size-to-the-half/)|69.4%|
|1207|1110|[delete-nodes-and-return-forest](https://leetcode.com/problems/delete-nodes-and-return-forest)|||69.3%|
|1358|1237|[find-positive-integer-solution-for-a-given-equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1358-1237(find-positive-integer-solution-for-a-given-equation)/find-positive-integer-solution-for-a-given-equation.java)||69.3%|
|2095|1963|[minimum-number-of-swaps-to-make-the-string-balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced)|||69.2%|
|967|931|[minimum-falling-path-sum](https://leetcode.com/problems/minimum-falling-path-sum)||[:memo:](https://leetcode.com/articles/minimum-falling-path-sum/)|69.1%|
|999|959|[regions-cut-by-slashes](https://leetcode.com/problems/regions-cut-by-slashes)||[:memo:](https://leetcode.com/articles/regions-cut-by-slashes/)|69.1%|
|807|791|[custom-sort-string](https://leetcode.com/problems/custom-sort-string)||[:memo:](https://leetcode.com/articles/custom-sort-string/)|69.0%|
|882|852|[peak-index-in-a-mountain-array](https://leetcode.com/problems/peak-index-in-a-mountain-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0882-0852(peak-index-in-a-mountain-array)/peak-index-in-a-mountain-array.java)|[:memo:](https://leetcode.com/articles/peak-index-in-a-mountain-array/)|69.0%|
|896|865|[smallest-subtree-with-all-the-deepest-nodes](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes)||[:memo:](https://leetcode.com/articles/smallest-subtree-with-all-the-deepest-nodes/)|69.0%|
|1359|1238|[circular-permutation-in-binary-representation](https://leetcode.com/problems/circular-permutation-in-binary-representation)|||69.0%|
|1530|1433|[check-if-a-string-can-break-another-string](https://leetcode.com/problems/check-if-a-string-can-break-another-string)|||69.0%|
|39|39|[combination-sum](https://leetcode.com/problems/combination-sum)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0039-0039(combination-sum)/combination-sum.java)|[:memo:](https://leetcode.com/articles/combination-sum/)|68.8%|
|1632|1525|[number-of-good-ways-to-split-a-string](https://leetcode.com/problems/number-of-good-ways-to-split-a-string)|||68.8%|
|1073|1020|[number-of-enclaves](https://leetcode.com/problems/number-of-enclaves)||[:memo:](https://leetcode.com/articles/number-of-enclaves/)|68.7%|
|1866|1743|[restore-the-array-from-adjacent-pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs)|||68.7%|
|2103|1992|[find-all-groups-of-farmland](https://leetcode.com/problems/find-all-groups-of-farmland)|||68.3%|
|1228|1130|[minimum-cost-tree-from-leaf-values](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values)|||68.2%|
|2677|2641|[cousins-in-binary-tree-ii](https://leetcode.com/problems/cousins-in-binary-tree-ii)|||68.2%|
|1027|985|[sum-of-even-numbers-after-queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1027-0985(sum-of-even-numbers-after-queries)/sum-of-even-numbers-after-queries.java)|[:memo:](https://leetcode.com/articles/sum-of-even-numbers-after-queries/)|68.1%|
|538|538|[convert-bst-to-greater-tree](https://leetcode.com/problems/convert-bst-to-greater-tree)||[:memo:](https://leetcode.com/articles/convert-bst-to-greater-tree/)|67.9%|
|1056|1011|[capacity-to-ship-packages-within-d-days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days)||[:memo:](https://leetcode.com/articles/capacity-to-ship-packages-within-d-days/)|67.8%|
|216|216|[combination-sum-iii](https://leetcode.com/problems/combination-sum-iii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0216-0216(combination-sum-iii)/combination-sum-iii.java)|[:memo:](https://leetcode.com/articles/combination-sum-iii/)|67.7%|
|260|260|[single-number-iii](https://leetcode.com/problems/single-number-iii)||[:memo:](https://leetcode.com/articles/single-number-iii/)|67.7%|
|609|609|[find-duplicate-file-in-system](https://leetcode.com/problems/find-duplicate-file-in-system)||[:memo:](https://leetcode.com/articles/find-duplicate-file-in-system/)|67.7%|
|1445|1343|[number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold)|||67.7%|
|1568|1457|[pseudo-palindromic-paths-in-a-binary-tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree)||[:memo:](https://leetcode.com/articles/pseudo-palindromic-paths-in-a-binary-tree/)|67.7%|
|2035|1905|[count-sub-islands](https://leetcode.com/problems/count-sub-islands)|||67.7%|
|2366|2279|[maximum-bags-with-full-capacity-of-rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks)||[:memo:](https://leetcode.com/articles/maximum-bags-with-full-capacity-of-rocks/)|67.7%|
|2437|2358|[maximum-number-of-groups-entering-a-competition](https://leetcode.com/problems/maximum-number-of-groups-entering-a-competition)|||67.6%|
|59|59|[spiral-matrix-ii](https://leetcode.com/problems/spiral-matrix-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0059-0059(spiral-matrix-ii)/spiral-matrix-ii.java)|[:memo:](https://leetcode.com/articles/spiral-matrix-ii/)|67.5%|
|1474|1372|[longest-zigzag-path-in-a-binary-tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree)||[:memo:](https://leetcode.com/articles/longest-zigzag-path-in-a-binary-tree/)|67.4%|
|2573|2487|[remove-nodes-from-linked-list](https://leetcode.com/problems/remove-nodes-from-linked-list)|||67.4%|
|289|289|[game-of-life](https://leetcode.com/problems/game-of-life)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0289-0289(game-of-life)/game-of-life.java)|[:memo:](https://leetcode.com/articles/game-of-life/)|67.3%|
|1040|998|[maximum-binary-tree-ii](https://leetcode.com/problems/maximum-binary-tree-ii)|||67.3%|
|2568|2477|[minimum-fuel-cost-to-report-to-the-capital](https://leetcode.com/problems/minimum-fuel-cost-to-report-to-the-capital)||[:memo:](https://leetcode.com/articles/minimum-fuel-cost-to-report-to-the-capital/)|67.2%|
|77|77|[combinations](https://leetcode.com/problems/combinations)||[:memo:](https://leetcode.com/articles/combinations/)|67.1%|
|513|513|[find-bottom-left-tree-value](https://leetcode.com/problems/find-bottom-left-tree-value)|||67.0%|
|528|1721|[swapping-nodes-in-a-linked-list](https://leetcode.com/problems/swapping-nodes-in-a-linked-list)||[:memo:](https://leetcode.com/articles/swapping-nodes-in-a-linked-list/)|67.0%|
|647|647|[palindromic-substrings](https://leetcode.com/problems/palindromic-substrings)||[:memo:](https://leetcode.com/articles/palindromic-substrings/)|67.0%|
|1380|1254|[number-of-closed-islands](https://leetcode.com/problems/number-of-closed-islands)||[:memo:](https://leetcode.com/articles/number-of-closed-islands/)|67.0%|
|1511|1395|[count-number-of-teams](https://leetcode.com/problems/count-number-of-teams)|||67.0%|
|49|49|[group-anagrams](https://leetcode.com/problems/group-anagrams)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0049-0049(group-anagrams)/group-anagrams.java)|[:memo:](https://leetcode.com/articles/group-anagrams/)|66.8%|
|988|951|[flip-equivalent-binary-trees](https://leetcode.com/problems/flip-equivalent-binary-trees)||[:memo:](https://leetcode.com/articles/flip-equivalent-binary-trees/)|66.8%|
|1879|1753|[maximum-score-from-removing-stones](https://leetcode.com/problems/maximum-score-from-removing-stones)|||66.8%|
|1576|1466|[reorder-routes-to-make-all-paths-lead-to-the-city-zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero)||[:memo:](https://leetcode.com/articles/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)|66.7%|
|1782|1663|[smallest-string-with-a-given-numeric-value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value)||[:memo:](https://leetcode.com/articles/smallest-string-with-a-given-numeric-value/)|66.7%|
|2432|2348|[number-of-zero-filled-subarrays](https://leetcode.com/problems/number-of-zero-filled-subarrays)||[:memo:](https://leetcode.com/articles/number-of-zero-filled-subarrays/)|66.7%|
|1934|1807|[evaluate-the-bracket-pairs-of-a-string](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string)|||66.5%|
|669|669|[trim-a-binary-search-tree](https://leetcode.com/problems/trim-a-binary-search-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0669-0669(trim-a-binary-search-tree)/trim-a-binary-search-tree.java)|[:memo:](https://leetcode.com/articles/trim-a-binary-search-tree/)|66.4%|
|215|215|[kth-largest-element-in-an-array](https://leetcode.com/problems/kth-largest-element-in-an-array)||[:memo:](https://leetcode.com/articles/kth-largest-element-in-an-array/)|66.3%|
|739|739|[daily-temperatures](https://leetcode.com/problems/daily-temperatures)||[:memo:](https://leetcode.com/articles/daily-temperatures/)|66.3%|
|1397|1268|[search-suggestions-system](https://leetcode.com/problems/search-suggestions-system)||[:memo:](https://leetcode.com/articles/search-suggestions-system/)|66.2%|
|1116|1161|[maximum-level-sum-of-a-binary-tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree)||[:memo:](https://leetcode.com/articles/maximum-level-sum-of-a-binary-tree/)|66.0%|
|1441|1318|[minimum-flips-to-make-a-or-b-equal-to-c](https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c)||[:memo:](https://leetcode.com/articles/minimum-flips-to-make-a-or-b-equal-to-c/)|66.0%|
|1889|1780|[check-if-number-is-a-sum-of-powers-of-three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three)|||66.0%|
|1298|1190|[reverse-substrings-between-each-pair-of-parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses)|||65.9%|
|1371|1249|[minimum-remove-to-make-valid-parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses)||[:memo:](https://leetcode.com/articles/minimum-remove-to-make-valid-parentheses/)|65.9%|
|1955|1845|[seat-reservation-manager](https://leetcode.com/problems/seat-reservation-manager)|||65.9%|
|1014|973|[k-closest-points-to-origin](https://leetcode.com/problems/k-closest-points-to-origin)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1014-0973(k-closest-points-to-origin)/k-closest-points-to-origin.java)|[:memo:](https://leetcode.com/articles/k-closest-points-to-origin/)|65.8%|
|1025|983|[minimum-cost-for-tickets](https://leetcode.com/problems/minimum-cost-for-tickets)||[:memo:](https://leetcode.com/articles/minimum-cost-for-tickets/)|65.8%|
|1491|1375|[number-of-times-binary-string-is-prefix-aligned](https://leetcode.com/problems/number-of-times-binary-string-is-prefix-aligned)|||65.8%|
|529|529|[minesweeper](https://leetcode.com/problems/minesweeper)|||65.7%|
|690|690|[employee-importance](https://leetcode.com/problems/employee-importance)||[:memo:](https://leetcode.com/articles/employee-importance/)|65.7%|
|1394|2304|[minimum-path-cost-in-a-grid](https://leetcode.com/problems/minimum-path-cost-in-a-grid)|||65.7%|
|1747|1625|[lexicographically-smallest-string-after-applying-operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations)|||65.7%|
|1350|1233|[remove-sub-folders-from-the-filesystem](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem)|||65.6%|
|1362|1227|[airplane-seat-assignment-probability](https://leetcode.com/problems/airplane-seat-assignment-probability)|||65.6%|
|1515|1414|[find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k](https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k)|||65.5%|
|2328|2232|[minimize-result-by-adding-parentheses-to-expression](https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression)|||65.5%|
|1095|1029|[two-city-scheduling](https://leetcode.com/problems/two-city-scheduling)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1095-1029(two-city-scheduling)/two-city-scheduling.java)|[:memo:](https://leetcode.com/articles/two-city-scheduling/)|65.4%|
|714|714|[best-time-to-buy-and-sell-stock-with-transaction-fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)||[:memo:](https://leetcode.com/articles/best-time-to-buy-and-sell-stock-with-transaction-fee/)|65.3%|
|937|901|[online-stock-span](https://leetcode.com/problems/online-stock-span)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0937-0901(online-stock-span)/online-stock-span.java)|[:memo:](https://leetcode.com/articles/online-stock-span/)|65.3%|
|1543|1447|[simplified-fractions](https://leetcode.com/problems/simplified-fractions)|||65.3%|
|1972|1861|[rotating-the-box](https://leetcode.com/problems/rotating-the-box)|||65.3%|
|2107|1980|[find-unique-binary-string](https://leetcode.com/problems/find-unique-binary-string)|||65.3%|
|2169|2043|[simple-bank-system](https://leetcode.com/problems/simple-bank-system)|||65.3%|
|968|932|[beautiful-array](https://leetcode.com/problems/beautiful-array)||[:memo:](https://leetcode.com/articles/beautiful-array/)|65.2%|
|238|238|[product-of-array-except-self](https://leetcode.com/problems/product-of-array-except-self)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0238-0238(product-of-array-except-self)/product-of-array-except-self.java)|[:memo:](https://leetcode.com/articles/product-of-array-except-self/)|65.1%|
|413|413|[arithmetic-slices](https://leetcode.com/problems/arithmetic-slices)||[:memo:](https://leetcode.com/articles/arithmetic-slices/)|65.1%|
|131|131|[palindrome-partitioning](https://leetcode.com/problems/palindrome-partitioning)||[:memo:](https://leetcode.com/articles/palindrome-partitioning/)|65.0%|
|508|508|[most-frequent-subtree-sum](https://leetcode.com/problems/most-frequent-subtree-sum)||[:memo:](https://leetcode.com/articles/most-frequent-subtree-sum/)|65.0%|
|955|919|[complete-binary-tree-inserter](https://leetcode.com/problems/complete-binary-tree-inserter)||[:memo:](https://leetcode.com/articles/complete-binary-tree-inserter/)|65.0%|
|2026|1899|[merge-triplets-to-form-target-triplet](https://leetcode.com/problems/merge-triplets-to-form-target-triplet)|||64.8%|
|886|856|[score-of-parentheses](https://leetcode.com/problems/score-of-parentheses)||[:memo:](https://leetcode.com/articles/score-of-parentheses/)|64.7%|
|1240|1140|[stone-game-ii](https://leetcode.com/problems/stone-game-ii)||[:memo:](https://leetcode.com/articles/stone-game-ii/)|64.6%|
|102|102|[binary-tree-level-order-traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)||[:memo:](https://leetcode.com/articles/binary-tree-level-order-traversal/)|64.5%|
|515|515|[find-largest-value-in-each-tree-row](https://leetcode.com/problems/find-largest-value-in-each-tree-row)|||64.5%|
|2600|2517|[maximum-tastiness-of-candy-basket](https://leetcode.com/problems/maximum-tastiness-of-candy-basket)|||64.5%|
|526|526|[beautiful-arrangement](https://leetcode.com/problems/beautiful-arrangement)||[:memo:](https://leetcode.com/articles/beautiful-arrangement/)|64.4%|
|347|347|[top-k-frequent-elements](https://leetcode.com/problems/top-k-frequent-elements)||[:memo:](https://leetcode.com/articles/top-k-frequent-elements/)|64.1%|
|1369|1247|[minimum-swaps-to-make-strings-equal](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal)|||64.1%|
|1706|1584|[min-cost-to-connect-all-points](https://leetcode.com/problems/min-cost-to-connect-all-points)||[:memo:](https://leetcode.com/articles/min-cost-to-connect-all-points/)|64.1%|
|122|122|[best-time-to-buy-and-sell-stock-ii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0122-0122(best-time-to-buy-and-sell-stock-ii)/best-time-to-buy-and-sell-stock-ii.java)|[:memo:](https://leetcode.com/articles/best-time-to-buy-and-sell-stock-ii/)|64.0%|
|241|241|[different-ways-to-add-parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses)|||64.0%|
|547|547|[number-of-provinces](https://leetcode.com/problems/number-of-provinces)||[:memo:](https://leetcode.com/articles/number-of-provinces/)|63.9%|
|1662|1558|[minimum-numbers-of-function-calls-to-make-target-array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array)|||63.9%|
|2278|2177|[find-three-consecutive-integers-that-sum-to-a-given-number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number)|||63.9%|
|864|835|[image-overlap](https://leetcode.com/problems/image-overlap)||[:memo:](https://leetcode.com/articles/image-overlap/)|63.8%|
|1331|1219|[path-with-maximum-gold](https://leetcode.com/problems/path-with-maximum-gold)|||63.7%|
|1722|1600|[throne-inheritance](https://leetcode.com/problems/throne-inheritance)|||63.7%|
|2572|2486|[append-characters-to-string-to-make-subsequence](https://leetcode.com/problems/append-characters-to-string-to-make-subsequence)|||63.7%|
|1428|1306|[jump-game-iii](https://leetcode.com/problems/jump-game-iii)||[:memo:](https://leetcode.com/articles/jump-game-iii/)|63.6%|
|1147|1072|[flip-columns-for-maximum-number-of-equal-rows](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows)|||63.5%|
|2261|2155|[all-divisions-with-the-highest-score-of-a-binary-array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array)|||63.5%|
|900|869|[reordered-power-of-2](https://leetcode.com/problems/reordered-power-of-2)||[:memo:](https://leetcode.com/articles/reordered-power-of-2/)|63.4%|
|1460|1358|[number-of-substrings-containing-all-three-characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters)|||63.4%|
|1700|1578|[minimum-time-to-make-rope-colorful](https://leetcode.com/problems/minimum-time-to-make-rope-colorful)||[:memo:](https://leetcode.com/articles/minimum-time-to-make-rope-colorful/)|63.4%|
|1446|1344|[angle-between-hands-of-a-clock](https://leetcode.com/problems/angle-between-hands-of-a-clock)||[:memo:](https://leetcode.com/articles/angle-between-hands-of-a-clock/)|63.3%|
|1585|1492|[the-kth-factor-of-n](https://leetcode.com/problems/the-kth-factor-of-n)||[:memo:](https://leetcode.com/articles/the-kth-factor-of-n/)|63.3%|
|1783|1664|[ways-to-make-a-fair-array](https://leetcode.com/problems/ways-to-make-a-fair-array)|||63.3%|
|503|503|[next-greater-element-ii](https://leetcode.com/problems/next-greater-element-ii)||[:memo:](https://leetcode.com/articles/next-greater-element-ii/)|63.2%|
|1046|1004|[max-consecutive-ones-iii](https://leetcode.com/problems/max-consecutive-ones-iii)||[:memo:](https://leetcode.com/articles/max-consecutive-ones-iii/)|63.2%|
|1561|1451|[rearrange-words-in-a-sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence)|||63.2%|
|1787|1685|[sum-of-absolute-differences-in-a-sorted-array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array)|||63.2%|
|1473|1371|[find-the-longest-substring-containing-vowels-in-even-counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts)|||63.1%|
|1835|1734|[decode-xored-permutation](https://leetcode.com/problems/decode-xored-permutation)|||63.1%|
|888|858|[mirror-reflection](https://leetcode.com/problems/mirror-reflection)||[:memo:](https://leetcode.com/articles/mirror-reflection/)|63.0%|
|208|208|[implement-trie-prefix-tree](https://leetcode.com/problems/implement-trie-prefix-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0208-0208(implement-trie-prefix-tree)/implement-trie-prefix-tree.java)|[:memo:](https://leetcode.com/articles/implement-trie-prefix-tree/)|62.9%|
|2362|2244|[minimum-rounds-to-complete-all-tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks)||[:memo:](https://leetcode.com/articles/minimum-rounds-to-complete-all-tasks/)|62.9%|
|382|382|[linked-list-random-node](https://leetcode.com/problems/linked-list-random-node)||[:memo:](https://leetcode.com/articles/linked-list-random-node/)|62.8%|
|1502|1400|[construct-k-palindrome-strings](https://leetcode.com/problems/construct-k-palindrome-strings)|||62.8%|
|62|62|[unique-paths](https://leetcode.com/problems/unique-paths)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0062-0062(unique-paths)/unique-paths.java)|[:memo:](https://leetcode.com/articles/unique-paths/)|62.7%|
|648|648|[replace-words](https://leetcode.com/problems/replace-words)||[:memo:](https://leetcode.com/articles/replace-words/)|62.7%|
|1554|1443|[minimum-time-to-collect-all-apples-in-a-tree](https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree)||[:memo:](https://leetcode.com/articles/minimum-time-to-collect-all-apples-in-a-tree/)|62.7%|
|712|712|[minimum-ascii-delete-sum-for-two-strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings)||[:memo:](https://leetcode.com/articles/minimum-ascii-delete-sum-for-two-strings/)|62.6%|
|1803|1701|[average-waiting-time](https://leetcode.com/problems/average-waiting-time)|||62.6%|
|398|398|[random-pick-index](https://leetcode.com/problems/random-pick-index)||[:memo:](https://leetcode.com/articles/random-pick-index/)|62.5%|
|2016|1887|[reduction-operations-to-make-the-array-elements-equal](https://leetcode.com/problems/reduction-operations-to-make-the-array-elements-equal)|||62.4%|
|684|684|[redundant-connection](https://leetcode.com/problems/redundant-connection)||[:memo:](https://leetcode.com/articles/redundant-connection/)|62.3%|
|893|863|[all-nodes-distance-k-in-binary-tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree)||[:memo:](https://leetcode.com/articles/all-nodes-distance-k-in-binary-tree/)|62.3%|
|1442|1319|[number-of-operations-to-make-network-connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected)||[:memo:](https://leetcode.com/articles/number-of-operations-to-make-network-connected/)|62.2%|
|2558|2471|[minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level)|||62.2%|
|12|12|[integer-to-roman](https://leetcode.com/problems/integer-to-roman)||[:memo:](https://leetcode.com/articles/integer-to-roman/)|62.1%|
|64|64|[minimum-path-sum](https://leetcode.com/problems/minimum-path-sum)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0064-0064(minimum-path-sum)/minimum-path-sum.java)|[:memo:](https://leetcode.com/articles/minimum-path-sum/)|62.1%|
|655|655|[print-binary-tree](https://leetcode.com/problems/print-binary-tree)||[:memo:](https://leetcode.com/articles/print-binary-tree/)|62.1%|
|114|114|[flatten-binary-tree-to-linked-list](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)||[:memo:](https://leetcode.com/articles/flatten-binary-tree-to-linked-list/)|62.0%|
|341|341|[flatten-nested-list-iterator](https://leetcode.com/problems/flatten-nested-list-iterator)||[:memo:](https://leetcode.com/articles/flatten-nested-iterator/)|61.9%|
|235|235|[lowest-common-ancestor-of-a-binary-search-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0235-0235(lowest-common-ancestor-of-a-binary-search-tree)/lowest-common-ancestor-of-a-binary-search-tree.java)|[:memo:](https://leetcode.com/articles/lowest-common-ancestor-of-a-binary-search-tree/)|61.8%|
|378|378|[kth-smallest-element-in-a-sorted-matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix)||[:memo:](https://leetcode.com/articles/kth-smallest-element-in-a-sorted-matrix/)|61.8%|
|105|105|[construct-binary-tree-from-preorder-and-inorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0105-0105(construct-binary-tree-from-preorder-and-inorder-traversal)/construct-binary-tree-from-preorder-and-inorder-traversal.java)|[:memo:](https://leetcode.com/articles/construct-binary-tree-from-preorder-and-inorder-traversal/)|61.7%|
|199|199|[binary-tree-right-side-view](https://leetcode.com/problems/binary-tree-right-side-view)||[:memo:](https://leetcode.com/articles/binary-tree-right-side-view/)|61.7%|
|386|386|[lexicographical-numbers](https://leetcode.com/problems/lexicographical-numbers)|||61.7%|
|516|516|[longest-palindromic-subsequence](https://leetcode.com/problems/longest-palindromic-subsequence)||[:memo:](https://leetcode.com/articles/longest-palindromic-subsequence/)|61.7%|
|1418|2305|[fair-distribution-of-cookies](https://leetcode.com/problems/fair-distribution-of-cookies)|||61.7%|
|1449|1324|[print-words-vertically](https://leetcode.com/problems/print-words-vertically)|||61.7%|
|1273|1170|[compare-strings-by-frequency-of-the-smallest-character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1273-1170(compare-strings-by-frequency-of-the-smallest-character)/compare-strings-by-frequency-of-the-smallest-character.java)||61.6%|
|24|24|[swap-nodes-in-pairs](https://leetcode.com/problems/swap-nodes-in-pairs)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0024-0024(swap-nodes-in-pairs)/swap-nodes-in-pairs.java)|[:memo:](https://leetcode.com/articles/swap-nodes-in-pairs/)|61.5%|
|962|926|[flip-string-to-monotone-increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing)||[:memo:](https://leetcode.com/articles/flip-string-to-monotone-increasing/)|61.5%|
|1845|1727|[largest-submatrix-with-rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements)|||61.4%|
|107|107|[binary-tree-level-order-traversal-ii](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0107-0107(binary-tree-level-order-traversal-ii)/binary-tree-level-order-traversal-ii.java)|[:memo:](https://leetcode.com/articles/binary-tree-level-order-traversal-ii/)|61.3%|
|328|328|[odd-even-linked-list](https://leetcode.com/problems/odd-even-linked-list)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0328-0328(odd-even-linked-list)/odd-even-linked-list.java)|[:memo:](https://leetcode.com/articles/odd-even-linked-list/)|61.3%|
|1212|1291|[sequential-digits](https://leetcode.com/problems/sequential-digits)||[:memo:](https://leetcode.com/articles/sequential-digits/)|61.3%|
|1890|1781|[sum-of-beauty-of-all-substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings)|||61.3%|
|636|636|[exclusive-time-of-functions](https://leetcode.com/problems/exclusive-time-of-functions)||[:memo:](https://leetcode.com/articles/exclusive-time-of-functions/)|61.2%|
|1370|1248|[count-number-of-nice-subarrays](https://leetcode.com/problems/count-number-of-nice-subarrays)|||61.2%|
|1653|1530|[number-of-good-leaf-nodes-pairs](https://leetcode.com/problems/number-of-good-leaf-nodes-pairs)|||61.2%|
|2078|1947|[maximum-compatibility-score-sum](https://leetcode.com/problems/maximum-compatibility-score-sum)|||61.2%|
|2497|2410|[maximum-matching-of-players-with-trainers](https://leetcode.com/problems/maximum-matching-of-players-with-trainers)|||61.2%|
|129|129|[sum-root-to-leaf-numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers)||[:memo:](https://leetcode.com/articles/sum-root-to-leaf-numbers/)|61.1%|
|1169|1090|[largest-values-from-labels](https://leetcode.com/problems/largest-values-from-labels)|||61.1%|
|1705|1583|[count-unhappy-friends](https://leetcode.com/problems/count-unhappy-friends)|||61.1%|
|1860|1738|[find-kth-largest-xor-coordinate-value](https://leetcode.com/problems/find-kth-largest-xor-coordinate-value)|||61.1%|
|805|789|[escape-the-ghosts](https://leetcode.com/problems/escape-the-ghosts)||[:memo:](https://leetcode.com/articles/escape-the-ghosts/)|60.9%|
|1080|1023|[camelcase-matching](https://leetcode.com/problems/camelcase-matching)|||60.8%|
|2591|2498|[frog-jump-ii](https://leetcode.com/problems/frog-jump-ii)|||60.8%|
|222|222|[count-complete-tree-nodes](https://leetcode.com/problems/count-complete-tree-nodes)||[:memo:](https://leetcode.com/articles/count-complete-tree-nodes/)|60.7%|
|518|518|[coin-change-ii](https://leetcode.com/problems/coin-change-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0518-0518(coin-change-ii)/coin-change-ii.java)|[:memo:](https://leetcode.com/articles/coin-change-ii/)|60.7%|
|1206|1109|[corporate-flight-bookings](https://leetcode.com/problems/corporate-flight-bookings)|||60.7%|
|1364|1726|[tuple-with-same-product](https://leetcode.com/problems/tuple-with-same-product)|||60.7%|
|2379|2285|[maximum-total-importance-of-roads](https://leetcode.com/problems/maximum-total-importance-of-roads)|||60.7%|
|116|116|[populating-next-right-pointers-in-each-node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node)||[:memo:](https://leetcode.com/articles/populating-next-right-pointers-in-each-node/)|60.6%|
|839|820|[short-encoding-of-words](https://leetcode.com/problems/short-encoding-of-words)||[:memo:](https://leetcode.com/articles/short-encoding-of-words/)|60.6%|
|1070|1017|[convert-to-base-2](https://leetcode.com/problems/convert-to-base-2)|||60.6%|
|1581|1471|[the-k-strongest-values-in-an-array](https://leetcode.com/problems/the-k-strongest-values-in-an-array)|||60.5%|
|1586|1493|[longest-subarray-of-1s-after-deleting-one-element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element)|||60.5%|
|1886|1760|[minimum-limit-of-balls-in-a-bag](https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag)|||60.5%|
|2134|2024|[maximize-the-confusion-of-an-exam](https://leetcode.com/problems/maximize-the-confusion-of-an-exam)||[:memo:](https://leetcode.com/articles/maximize-the-confusion-of-an-exam/)|60.5%|
|1876|1765|[map-of-highest-peak](https://leetcode.com/problems/map-of-highest-peak)|||60.4%|
|2227|2104|[sum-of-subarray-ranges](https://leetcode.com/problems/sum-of-subarray-ranges)||[:memo:](https://leetcode.com/articles/sum-of-subarray-ranges/)|60.4%|
|2270|2150|[find-all-lonely-numbers-in-the-array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array)|||60.4%|
|109|109|[convert-sorted-list-to-binary-search-tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree)||[:memo:](https://leetcode.com/articles/convert-sorted-list-to-binary-search-tree/)|60.3%|
|2094|1962|[remove-stones-to-minimize-the-total](https://leetcode.com/problems/remove-stones-to-minimize-the-total)||[:memo:](https://leetcode.com/articles/remove-stones-to-minimize-the-total/)|60.3%|
|491|491|[non-decreasing-subsequences](https://leetcode.com/problems/non-decreasing-subsequences)||[:memo:](https://leetcode.com/articles/increasing-subsequences/)|60.2%|
|1455|1333|[filter-restaurants-by-vegan-friendly-price-and-distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance)|||60.2%|
|2550|2452|[words-within-two-edits-of-dictionary](https://leetcode.com/problems/words-within-two-edits-of-dictionary)|||60.2%|
|106|106|[construct-binary-tree-from-inorder-and-postorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0106-0106(construct-binary-tree-from-inorder-and-postorder-traversal)/construct-binary-tree-from-inorder-and-postorder-traversal.java)|[:memo:](https://leetcode.com/articles/construct-binary-tree-from-inorder-and-postorder-traversal/)|60.1%|
|167|167|[two-sum-ii-input-array-is-sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0167-0167(two-sum-ii-input-array-is-sorted)/two-sum-ii-input-array-is-sorted.java)|[:memo:](https://leetcode.com/articles/two-sum-ii-input-array-is-sorted/)|60.1%|
|462|462|[minimum-moves-to-equal-array-elements-ii](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii)||[:memo:](https://leetcode.com/articles/minimum-moves-to-equal-array-elements-ii/)|60.0%|
|1072|1019|[next-greater-node-in-linked-list](https://leetcode.com/problems/next-greater-node-in-linked-list)||[:memo:](https://leetcode.com/articles/next-greater-node-in-linked-list/)|60.0%|
|318|318|[maximum-product-of-word-lengths](https://leetcode.com/problems/maximum-product-of-word-lengths)||[:memo:](https://leetcode.com/articles/maximum-product-of-word-lengths/)|59.9%|
|553|553|[optimal-division](https://leetcode.com/problems/optimal-division)||[:memo:](https://leetcode.com/articles/optimal-division/)|59.9%|
|583|583|[delete-operation-for-two-strings](https://leetcode.com/problems/delete-operation-for-two-strings)||[:memo:](https://leetcode.com/articles/delete-operation-for-two-strings/)|59.9%|
|1276|1362|[closest-divisors](https://leetcode.com/problems/closest-divisors)|||59.9%|
|96|96|[unique-binary-search-trees](https://leetcode.com/problems/unique-binary-search-trees)||[:memo:](https://leetcode.com/articles/unique-binary-search-trees/)|59.8%|
|667|667|[beautiful-arrangement-ii](https://leetcode.com/problems/beautiful-arrangement-ii)||[:memo:](https://leetcode.com/articles/beautiful-arrangement-ii/)|59.8%|
|399|399|[evaluate-division](https://leetcode.com/problems/evaluate-division)||[:memo:](https://leetcode.com/articles/evaluate-division/)|59.7%|
|445|445|[add-two-numbers-ii](https://leetcode.com/problems/add-two-numbers-ii)||[:memo:](https://leetcode.com/articles/add-two-numbers-ii/)|59.7%|
|766|430|[flatten-a-multilevel-doubly-linked-list](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list)||[:memo:](https://leetcode.com/articles/flatten-a-multilevel-doubly-linked-list/)|59.7%|
|1096|1031|[maximum-sum-of-two-non-overlapping-subarrays](https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays)|||59.6%|
|1396|1267|[count-servers-that-communicate](https://leetcode.com/problems/count-servers-that-communicate)|||59.6%|
|623|623|[add-one-row-to-tree](https://leetcode.com/problems/add-one-row-to-tree)||[:memo:](https://leetcode.com/articles/add-one-row-in-a-tree/)|59.5%|
|1196|1105|[filling-bookcase-shelves](https://leetcode.com/problems/filling-bookcase-shelves)|||59.5%|
|936|900|[rle-iterator](https://leetcode.com/problems/rle-iterator)||[:memo:](https://leetcode.com/articles/rle-iterator/)|59.4%|
|1063|1014|[best-sightseeing-pair](https://leetcode.com/problems/best-sightseeing-pair)|||59.4%|
|2279|2178|[maximum-split-of-positive-even-integers](https://leetcode.com/problems/maximum-split-of-positive-even-integers)|||59.4%|
|948|912|[sort-an-array](https://leetcode.com/problems/sort-an-array)||[:memo:](https://leetcode.com/articles/sort-an-array/)|59.3%|
|1129|1048|[longest-string-chain](https://leetcode.com/problems/longest-string-chain)||[:memo:](https://leetcode.com/articles/longest-string-chain/)|59.3%|
|2216|2095|[delete-the-middle-node-of-a-linked-list](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list)||[:memo:](https://leetcode.com/articles/delete-the-middle-node-of-a-linked-list/)|59.3%|
|1105|1035|[uncrossed-lines](https://leetcode.com/problems/uncrossed-lines)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1105-1035(uncrossed-lines)/uncrossed-lines.java)|[:memo:](https://leetcode.com/articles/uncrossed-lines/)|59.2%|
|1567|1456|[maximum-number-of-vowels-in-a-substring-of-given-length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length)||[:memo:](https://leetcode.com/articles/maximum-number-of-vowels-in-a-substring-of-given-length/)|59.2%|
|2022|1911|[maximum-alternating-subsequence-sum](https://leetcode.com/problems/maximum-alternating-subsequence-sum)|||59.2%|
|287|287|[find-the-duplicate-number](https://leetcode.com/problems/find-the-duplicate-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0287-0287(find-the-duplicate-number)/find-the-duplicate-number.java)|[:memo:](https://leetcode.com/articles/find-the-duplicate-number/)|59.1%|
|540|540|[single-element-in-a-sorted-array](https://leetcode.com/problems/single-element-in-a-sorted-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0540-0540(single-element-in-a-sorted-array)/single-element-in-a-sorted-array.java)|[:memo:](https://leetcode.com/articles/single-element-in-a-sorted-array/)|59.1%|
|236|236|[lowest-common-ancestor-of-a-binary-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)||[:memo:](https://leetcode.com/articles/lowest-common-ancestor-of-a-binary-tree/)|59.0%|
|652|652|[find-duplicate-subtrees](https://leetcode.com/problems/find-duplicate-subtrees)||[:memo:](https://leetcode.com/articles/find-duplicate-subtrees/)|59.0%|
|1615|1508|[range-sum-of-sorted-subarray-sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums)|||59.0%|
|1770|1647|[minimum-deletions-to-make-character-frequencies-unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique)||[:memo:](https://leetcode.com/articles/minimum-deletions-to-make-character-frequencies-unique/)|59.0%|
|1956|1846|[maximum-element-after-decreasing-and-rearranging](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging)|||59.0%|
|984|947|[most-stones-removed-with-same-row-or-column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column)||[:memo:](https://leetcode.com/articles/most-stones-removed-with-same-row-or-column/)|58.9%|
|1756|1653|[minimum-deletions-to-make-string-balanced](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced)|||58.9%|
|2662|2596|[check-knight-tour-configuration](https://leetcode.com/problems/check-knight-tour-configuration)|||58.9%|
|75|75|[sort-colors](https://leetcode.com/problems/sort-colors)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0075-0075(sort-colors)/sort-colors.java)|[:memo:](https://leetcode.com/articles/sort-colors/)|58.8%|
|284|284|[peeking-iterator](https://leetcode.com/problems/peeking-iterator)||[:memo:](https://leetcode.com/articles/peeking-iterator/)|58.7%|
|1738|1615|[maximal-network-rank](https://leetcode.com/problems/maximal-network-rank)|||58.7%|
|2581|2491|[divide-players-into-teams-of-equal-skill](https://leetcode.com/problems/divide-players-into-teams-of-equal-skill)|||58.7%|
|137|137|[single-number-ii](https://leetcode.com/problems/single-number-ii)||[:memo:](https://leetcode.com/articles/single-number-ii/)|58.6%|
|1667|1545|[find-kth-bit-in-nth-binary-string](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string)|||58.6%|
|881|851|[loud-and-rich](https://leetcode.com/problems/loud-and-rich)||[:memo:](https://leetcode.com/articles/loud-and-rich/)|58.5%|
|1849|1749|[maximum-absolute-sum-of-any-subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray)|||58.5%|
|1675|1552|[magnetic-force-between-two-balls](https://leetcode.com/problems/magnetic-force-between-two-balls)|||58.4%|
|2533|2425|[bitwise-xor-of-all-pairings](https://leetcode.com/problems/bitwise-xor-of-all-pairings)|||58.4%|
|498|498|[diagonal-traverse](https://leetcode.com/problems/diagonal-traverse)||[:memo:](https://leetcode.com/articles/diagonal-traverse/)|58.3%|
|1045|1003|[check-if-word-is-valid-after-substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions)|||58.3%|
|1250|1143|[longest-common-subsequence](https://leetcode.com/problems/longest-common-subsequence)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1250-1143(longest-common-subsequence)/longest-common-subsequence.java)|[:memo:](https://leetcode.com/articles/longest-common-subsequence/)|58.3%|
|1492|1376|[time-needed-to-inform-all-employees](https://leetcode.com/problems/time-needed-to-inform-all-employees)||[:memo:](https://leetcode.com/articles/time-needed-to-inform-all-employees/)|58.3%|
|36|36|[valid-sudoku](https://leetcode.com/problems/valid-sudoku)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0036-0036(valid-sudoku)/valid-sudoku.java)|[:memo:](https://leetcode.com/articles/valid-sudoku/)|58.2%|
|780|769|[max-chunks-to-make-sorted](https://leetcode.com/problems/max-chunks-to-make-sorted)||[:memo:](https://leetcode.com/articles/max-chunks-to-make-sorted-i/)|58.2%|
|1808|1690|[stone-game-vii](https://leetcode.com/problems/stone-game-vii)||[:memo:](https://leetcode.com/articles/stone-game-vii/)|58.2%|
|2764|2658|[maximum-number-of-fish-in-a-grid](https://leetcode.com/problems/maximum-number-of-fish-in-a-grid)|||58.1%|
|394|394|[decode-string](https://leetcode.com/problems/decode-string)||[:memo:](https://leetcode.com/articles/decode-string/)|58.0%|
|2233|2110|[number-of-smooth-descent-periods-of-a-stock](https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock)|||58.0%|
|384|384|[shuffle-an-array](https://leetcode.com/problems/shuffle-an-array)||[:memo:](https://leetcode.com/articles/shuffle-an-array/)|57.9%|
|1159|1081|[smallest-subsequence-of-distinct-characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters)|||57.9%|
|2149|2038|[remove-colored-pieces-if-both-neighbors-are-the-same-color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color)|||57.9%|
|2582|2492|[minimum-score-of-a-path-between-two-cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities)||[:memo:](https://leetcode.com/articles/minimum-score-of-a-path-between-two-cities/)|57.9%|
|1308|1202|[smallest-string-with-swaps](https://leetcode.com/problems/smallest-string-with-swaps)||[:memo:](https://leetcode.com/articles/smallest-string-with-swaps/)|57.8%|
|1483|1366|[rank-teams-by-votes](https://leetcode.com/problems/rank-teams-by-votes)|||57.8%|
|2445|2368|[reachable-nodes-with-restrictions](https://leetcode.com/problems/reachable-nodes-with-restrictions)||[:memo:](https://leetcode.com/articles/reachable-nodes-with-restrictions/)|57.7%|
|2705|2568|[minimum-impossible-or](https://leetcode.com/problems/minimum-impossible-or)|||57.7%|
|835|817|[linked-list-components](https://leetcode.com/problems/linked-list-components)||[:memo:](https://leetcode.com/articles/linked-list-components/)|57.6%|
|1813|1695|[maximum-erasure-value](https://leetcode.com/problems/maximum-erasure-value)||[:memo:](https://leetcode.com/articles/maximum-erasure-value/)|57.6%|
|47|47|[permutations-ii](https://leetcode.com/problems/permutations-ii)||[:memo:](https://leetcode.com/articles/permutations-ii/)|57.5%|
|2388|2295|[replace-elements-in-an-array](https://leetcode.com/problems/replace-elements-in-an-array)|||57.5%|
|1007|967|[numbers-with-same-consecutive-differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences)||[:memo:](https://leetcode.com/articles/numbers-with-same-consecutive-differences/)|57.4%|
|1304|1405|[longest-happy-string](https://leetcode.com/problems/longest-happy-string)|||57.4%|
|1628|1504|[count-submatrices-with-all-ones](https://leetcode.com/problems/count-submatrices-with-all-ones)|||57.4%|
|2649|2579|[count-total-number-of-colored-cells](https://leetcode.com/problems/count-total-number-of-colored-cells)|||57.4%|
|89|89|[gray-code](https://leetcode.com/problems/gray-code)||[:memo:](https://leetcode.com/articles/gray-code/)|57.3%|
|692|692|[top-k-frequent-words](https://leetcode.com/problems/top-k-frequent-words)||[:memo:](https://leetcode.com/articles/top-k-frequent-words/)|57.3%|
|725|725|[split-linked-list-in-parts](https://leetcode.com/problems/split-linked-list-in-parts)||[:memo:](https://leetcode.com/articles/split-linked-list-in-parts/)|57.3%|
|113|113|[path-sum-ii](https://leetcode.com/problems/path-sum-ii)||[:memo:](https://leetcode.com/articles/path-sum-ii/)|57.2%|
|454|454|[4sum-ii](https://leetcode.com/problems/4sum-ii)||[:memo:](https://leetcode.com/articles/4sum-ii/)|57.2%|
|859|641|[design-circular-deque](https://leetcode.com/problems/design-circular-deque)|||57.2%|
|1065|1016|[binary-string-with-substrings-representing-1-to-n](https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n)|||57.2%|
|1798|1679|[max-number-of-k-sum-pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs)||[:memo:](https://leetcode.com/articles/max-number-of-k-sum-pairs/)|57.2%|
|200|200|[number-of-islands](https://leetcode.com/problems/number-of-islands)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0200-0200(number-of-islands)/number-of-islands.java)|[:memo:](https://leetcode.com/articles/number-of-islands/)|57.1%|
|449|449|[serialize-and-deserialize-bst](https://leetcode.com/problems/serialize-and-deserialize-bst)||[:memo:](https://leetcode.com/articles/serialize-and-deserialize-bst/)|57.1%|
|1138|1052|[grumpy-bookstore-owner](https://leetcode.com/problems/grumpy-bookstore-owner)|||57.1%|
|1905|1797|[design-authentication-manager](https://leetcode.com/problems/design-authentication-manager)|||57.1%|
|103|103|[binary-tree-zigzag-level-order-traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)||[:memo:](https://leetcode.com/articles/binary-tree-zigzag-level-order-traversal/)|57.0%|
|676|676|[implement-magic-dictionary](https://leetcode.com/problems/implement-magic-dictionary)||[:memo:](https://leetcode.com/articles/implement-magic-dictionary/)|57.0%|
|740|740|[delete-and-earn](https://leetcode.com/problems/delete-and-earn)||[:memo:](https://leetcode.com/articles/delete-and-earn/)|57.0%|
|868|838|[push-dominoes](https://leetcode.com/problems/push-dominoes)||[:memo:](https://leetcode.com/articles/push-dominoes/)|57.0%|
|1222|1288|[remove-covered-intervals](https://leetcode.com/problems/remove-covered-intervals)||[:memo:](https://leetcode.com/articles/remove-covered-intervals/)|57.0%|
|1767|1670|[design-front-middle-back-queue](https://leetcode.com/problems/design-front-middle-back-queue)|||57.0%|
|1800|1680|[concatenation-of-consecutive-binary-numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers)||[:memo:](https://leetcode.com/articles/concatenation-of-consecutive-binary-numbers/)|57.0%|
|820|802|[find-eventual-safe-states](https://leetcode.com/problems/find-eventual-safe-states)||[:memo:](https://leetcode.com/articles/find-eventual-safe-states/)|56.9%|
|1562|1452|[people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list](https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list)|||56.9%|
|2182|2058|[find-the-minimum-and-maximum-number-of-nodes-between-critical-points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points)|||56.9%|
|2351|2240|[number-of-ways-to-buy-pens-and-pencils](https://leetcode.com/problems/number-of-ways-to-buy-pens-and-pencils)|||56.9%|
|677|677|[map-sum-pairs](https://leetcode.com/problems/map-sum-pairs)||[:memo:](https://leetcode.com/articles/map-sum-pairs/)|56.8%|
|729|729|[my-calendar-i](https://leetcode.com/problems/my-calendar-i)||[:memo:](https://leetcode.com/articles/my-calendar-i/)|56.8%|
|1184|1094|[car-pooling](https://leetcode.com/problems/car-pooling)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1184-1094(car-pooling)/car-pooling.java)|[:memo:](https://leetcode.com/articles/car-pooling/)|56.8%|
|2461|2385|[amount-of-time-for-binary-tree-to-be-infected](https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected)|||56.8%|
|17|17|[letter-combinations-of-a-phone-number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)||[:memo:](https://leetcode.com/articles/letter-combinations-of-a-phone-number/)|56.7%|
|2664|2592|[maximize-greatness-of-an-array](https://leetcode.com/problems/maximize-greatness-of-an-array)|||56.7%|
|804|788|[rotated-digits](https://leetcode.com/problems/rotated-digits)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0804-0788(rotated-digits)/rotated-digits.java)|[:memo:](https://leetcode.com/articles/rotated-digits/)|56.6%|
|1557|1461|[check-if-a-string-contains-all-binary-codes-of-size-k](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k)||[:memo:](https://leetcode.com/articles/check-if-a-string-contains-all-binary-codes-of-size-k/)|56.6%|
|2232|2109|[adding-spaces-to-a-string](https://leetcode.com/problems/adding-spaces-to-a-string)|||56.6%|
|539|539|[minimum-time-difference](https://leetcode.com/problems/minimum-time-difference)|||56.5%|
|621|621|[task-scheduler](https://leetcode.com/problems/task-scheduler)||[:memo:](https://leetcode.com/articles/task-scheduler/)|56.5%|
|646|646|[maximum-length-of-pair-chain](https://leetcode.com/problems/maximum-length-of-pair-chain)||[:memo:](https://leetcode.com/articles/maximum-length-of-pair-chain/)|56.5%|
|2492|2414|[length-of-the-longest-alphabetical-continuous-substring](https://leetcode.com/problems/length-of-the-longest-alphabetical-continuous-substring)|||56.5%|
|565|565|[array-nesting](https://leetcode.com/problems/array-nesting)||[:memo:](https://leetcode.com/articles/array-nesting/)|56.4%|
|974|937|[reorder-data-in-log-files](https://leetcode.com/problems/reorder-data-in-log-files)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0974-0937(reorder-data-in-log-files)/reorder-data-in-log-files.java)|[:memo:](https://leetcode.com/articles/reorder-data-in-log-files/)|56.4%|
|1422|1296|[divide-array-in-sets-of-k-consecutive-numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers)|||56.4%|
|309|309|[best-time-to-buy-and-sell-stock-with-cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown)||[:memo:](https://leetcode.com/articles/best-time-to-buy-and-sell-stock-with-cooldown/)|56.3%|
|721|721|[accounts-merge](https://leetcode.com/problems/accounts-merge)||[:memo:](https://leetcode.com/articles/accounts-merge/)|56.3%|
|834|816|[ambiguous-coordinates](https://leetcode.com/problems/ambiguous-coordinates)||[:memo:](https://leetcode.com/articles/ambiguous-coordinates/)|56.3%|
|1320|1209|[remove-all-adjacent-duplicates-in-string-ii](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii)||[:memo:](https://leetcode.com/articles/remove-all-adjacent-duplicates-in-string-ii/)|56.3%|
|1408|1283|[find-the-smallest-divisor-given-a-threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold)||[:memo:](https://leetcode.com/articles/find-the-smallest-divisor-given-a-threshold/)|56.3%|
|1777|1657|[determine-if-two-strings-are-close](https://leetcode.com/problems/determine-if-two-strings-are-close)||[:memo:](https://leetcode.com/articles/determine-if-two-strings-are-close/)|56.3%|
|343|343|[integer-break](https://leetcode.com/problems/integer-break)|||56.2%|
|998|958|[check-completeness-of-a-binary-tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree)||[:memo:](https://leetcode.com/articles/check-completeness-of-a-binary-tree/)|56.2%|
|876|846|[hand-of-straights](https://leetcode.com/problems/hand-of-straights)||[:memo:](https://leetcode.com/articles/hand-of-straights/)|56.1%|
|1113|1040|[moving-stones-until-consecutive-ii](https://leetcode.com/problems/moving-stones-until-consecutive-ii)|||56.1%|
|1930|1798|[maximum-number-of-consecutive-values-you-can-make](https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make)|||56.1%|
|90|90|[subsets-ii](https://leetcode.com/problems/subsets-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0090-0090(subsets-ii)/subsets-ii.java)|[:memo:](https://leetcode.com/articles/subsets-ii/)|56.0%|
|453|453|[minimum-moves-to-equal-array-elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0453-0453(minimum-moves-to-equal-array-elements)/minimum-moves-to-equal-array-elements.java)|[:memo:](https://leetcode.com/articles/minimum-moves-to-equal-array-elements/)|56.0%|
|2378|2284|[sender-with-largest-word-count](https://leetcode.com/problems/sender-with-largest-word-count)|||56.0%|
|917|881|[boats-to-save-people](https://leetcode.com/problems/boats-to-save-people)||[:memo:](https://leetcode.com/articles/boats-to-save-people/)|55.8%|
|1627|1503|[last-moment-before-all-ants-fall-out-of-a-plank](https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank)|||55.8%|
|1753|1631|[path-with-minimum-effort](https://leetcode.com/problems/path-with-minimum-effort)||[:memo:](https://leetcode.com/articles/path-with-minimum-effort/)|55.8%|
|753|752|[open-the-lock](https://leetcode.com/problems/open-the-lock)||[:memo:](https://leetcode.com/articles/open-the-lock/)|55.7%|
|1111|1039|[minimum-score-triangulation-of-polygon](https://leetcode.com/problems/minimum-score-triangulation-of-polygon)|||55.7%|
|1048|1006|[clumsy-factorial](https://leetcode.com/problems/clumsy-factorial)|||55.6%|
|1604|1481|[least-number-of-unique-integers-after-k-removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals)|||55.6%|
|2576|2483|[minimum-penalty-for-a-shop](https://leetcode.com/problems/minimum-penalty-for-a-shop)|||55.6%|
|2212|2091|[removing-minimum-and-maximum-from-array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array)|||55.5%|
|1312|2201|[count-artifacts-that-can-be-extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted)|||55.4%|
|1715|1593|[split-a-string-into-the-max-number-of-unique-substrings](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings)|||55.4%|
|2669|2606|[find-the-substring-with-maximum-cost](https://leetcode.com/problems/find-the-substring-with-maximum-cost)|||55.4%|
|148|148|[sort-list](https://leetcode.com/problems/sort-list)||[:memo:](https://leetcode.com/articles/sort-list/)|55.3%|
|452|452|[minimum-number-of-arrows-to-burst-balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons)||[:memo:](https://leetcode.com/articles/minimum-number-of-arrows-to-burst-balloons/)|55.3%|
|1119|1041|[robot-bounded-in-circle](https://leetcode.com/problems/robot-bounded-in-circle)||[:memo:](https://leetcode.com/articles/robot-bounded-in-circle/)|55.3%|
|1643|1519|[number-of-nodes-in-the-sub-tree-with-the-same-label](https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label)||[:memo:](https://leetcode.com/articles/number-of-nodes-in-the-sub-tree-with-the-same-label/)|55.3%|
|731|731|[my-calendar-ii](https://leetcode.com/problems/my-calendar-ii)||[:memo:](https://leetcode.com/articles/my-calendar-ii/)|55.0%|
|1456|1334|[find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance)|||55.0%|
|447|447|[number-of-boomerangs](https://leetcode.com/problems/number-of-boomerangs)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0447-0447(number-of-boomerangs)/number-of-boomerangs.java)||54.9%|
|1788|1686|[stone-game-vi](https://leetcode.com/problems/stone-game-vi)|||54.8%|
|120|120|[triangle](https://leetcode.com/problems/triangle)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0120-0120(triangle)/triangle.java)|[:memo:](https://leetcode.com/articles/triangle/)|54.6%|
|797|781|[rabbits-in-forest](https://leetcode.com/problems/rabbits-in-forest)||[:memo:](https://leetcode.com/articles/rabbits-in-forest/)|54.6%|
|1003|963|[minimum-area-rectangle-ii](https://leetcode.com/problems/minimum-area-rectangle-ii)||[:memo:](https://leetcode.com/articles/minimum-area-rectangle-ii/)|54.6%|
|1616|1509|[minimum-difference-between-largest-and-smallest-value-in-three-moves](https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves)|||54.6%|
|2130|2002|[maximum-product-of-the-length-of-two-palindromic-subsequences](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences)|||54.6%|
|417|417|[pacific-atlantic-water-flow](https://leetcode.com/problems/pacific-atlantic-water-flow)||[:memo:](https://leetcode.com/articles/pacific-atlantic-water-flow/)|54.5%|
|2187|2063|[vowels-of-all-substrings](https://leetcode.com/problems/vowels-of-all-substrings)|||54.5%|
|971|934|[shortest-bridge](https://leetcode.com/problems/shortest-bridge)||[:memo:](https://leetcode.com/articles/shortest-bridge/)|54.4%|
|1731|1609|[even-odd-tree](https://leetcode.com/problems/even-odd-tree)|||54.4%|
|1016|974|[subarray-sums-divisible-by-k](https://leetcode.com/problems/subarray-sums-divisible-by-k)||[:memo:](https://leetcode.com/articles/subarray-sums-divisible-by-k/)|54.3%|
|1033|991|[broken-calculator](https://leetcode.com/problems/broken-calculator)||[:memo:](https://leetcode.com/articles/broken-calculator/)|54.1%|
|11|11|[container-with-most-water](https://leetcode.com/problems/container-with-most-water)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0011-0011(container-with-most-water)/container-with-most-water.java)|[:memo:](https://leetcode.com/articles/container-with-most-water/)|54.0%|
|1263|1155|[number-of-dice-rolls-with-target-sum](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum)||[:memo:](https://leetcode.com/articles/number-of-dice-rolls-with-target-sum/)|54.0%|
|2512|2424|[longest-uploaded-prefix](https://leetcode.com/problems/longest-uploaded-prefix)|||54.0%|
|337|337|[house-robber-iii](https://leetcode.com/problems/house-robber-iii)||[:memo:](https://leetcode.com/articles/house-robber-iii/)|53.9%|
|421|421|[maximum-xor-of-two-numbers-in-an-array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array)||[:memo:](https://leetcode.com/articles/maximum-xor-of-two-numbers-in-an-array/)|53.9%|
|862|833|[find-and-replace-in-string](https://leetcode.com/problems/find-and-replace-in-string)||[:memo:](https://leetcode.com/articles/find-and-replace-in-string/)|53.9%|
|1605|1482|[minimum-number-of-days-to-make-m-bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets)|||53.9%|
|2196|2074|[reverse-nodes-in-even-length-groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups)|||53.8%|
|952|916|[word-subsets](https://leetcode.com/problems/word-subsets)||[:memo:](https://leetcode.com/articles/word-subsets/)|53.7%|
|554|554|[brick-wall](https://leetcode.com/problems/brick-wall)||[:memo:](https://leetcode.com/articles/brick-wall/)|53.6%|
|1157|1080|[insufficient-nodes-in-root-to-leaf-paths](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths)|||53.6%|
|2695|2593|[find-score-of-an-array-after-marking-all-elements](https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements)|||53.6%|
|650|650|[2-keys-keyboard](https://leetcode.com/problems/2-keys-keyboard)||[:memo:](https://leetcode.com/articles/2-keys-keyboard/)|53.5%|
|2780|2673|[make-costs-of-paths-equal-in-a-binary-tree](https://leetcode.com/problems/make-costs-of-paths-equal-in-a-binary-tree)|||53.5%|
|40|40|[combination-sum-ii](https://leetcode.com/problems/combination-sum-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0040-0040(combination-sum-ii)/combination-sum-ii.java)|[:memo:](https://leetcode.com/articles/combination-sum-ii/)|53.4%|
|1295|1954|[minimum-garden-perimeter-to-collect-enough-apples](https://leetcode.com/problems/minimum-garden-perimeter-to-collect-enough-apples)|||53.4%|
|2482|2397|[maximum-rows-covered-by-columns](https://leetcode.com/problems/maximum-rows-covered-by-columns)|||53.4%|
|1130|1049|[last-stone-weight-ii](https://leetcode.com/problems/last-stone-weight-ii)|||53.3%|
|1413|1292|[maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold](https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold)|||53.3%|
|1984|1855|[maximum-distance-between-a-pair-of-values](https://leetcode.com/problems/maximum-distance-between-a-pair-of-values)||[:memo:](https://leetcode.com/articles/maximum-distance-between-a-pair-of-values/)|53.3%|
|133|133|[clone-graph](https://leetcode.com/problems/clone-graph)||[:memo:](https://leetcode.com/articles/clone-graph/)|53.2%|
|801|785|[is-graph-bipartite](https://leetcode.com/problems/is-graph-bipartite)||[:memo:](https://leetcode.com/articles/is-graph-bipartite/)|53.2%|
|2473|2342|[max-sum-of-a-pair-with-equal-sum-of-digits](https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits)|||53.2%|
|638|638|[shopping-offers](https://leetcode.com/problems/shopping-offers)||[:memo:](https://leetcode.com/articles/shopping-offers/)|53.1%|
|1901|1775|[equal-sum-arrays-with-minimum-number-of-operations](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations)|||53.1%|
|304|304|[range-sum-query-2d-immutable](https://leetcode.com/problems/range-sum-query-2d-immutable)||[:memo:](https://leetcode.com/articles/range-sum-query-2d-immutable/)|53.0%|
|831|813|[largest-sum-of-averages](https://leetcode.com/problems/largest-sum-of-averages)||[:memo:](https://leetcode.com/articles/largest-sum-of-averages/)|53.0%|
|976|939|[minimum-area-rectangle](https://leetcode.com/problems/minimum-area-rectangle)||[:memo:](https://leetcode.com/articles/minimum-area-rectangle/)|53.0%|
|1036|994|[rotting-oranges](https://leetcode.com/problems/rotting-oranges)||[:memo:](https://leetcode.com/articles/rotting-oranges/)|53.0%|
|1874|1764|[form-array-by-concatenating-subarrays-of-another-array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array)|||53.0%|
|778|767|[reorganize-string](https://leetcode.com/problems/reorganize-string)||[:memo:](https://leetcode.com/articles/reorganized-string/)|52.9%|
|143|143|[reorder-list](https://leetcode.com/problems/reorder-list)||[:memo:](https://leetcode.com/articles/reorder-list/)|52.8%|
|380|380|[insert-delete-getrandom-o1](https://leetcode.com/problems/insert-delete-getrandom-o1)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0380-0380(insert-delete-getrandom-o1)/insert-delete-getrandom-o1.java)|[:memo:](https://leetcode.com/articles/insert-delete-getrandom-o1/)|52.8%|
|811|795|[number-of-subarrays-with-bounded-maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum)||[:memo:](https://leetcode.com/articles/number-of-subarrays-with-bounded-maximum/)|52.8%|
|279|279|[perfect-squares](https://leetcode.com/problems/perfect-squares)||[:memo:](https://leetcode.com/articles/perfect-squares/)|52.7%|
|757|756|[pyramid-transition-matrix](https://leetcode.com/problems/pyramid-transition-matrix)||[:memo:](https://leetcode.com/articles/pyramid-transition-matrix/)|52.7%|
|806|790|[domino-and-tromino-tiling](https://leetcode.com/problems/domino-and-tromino-tiling)||[:memo:](https://leetcode.com/articles/domino-and-tromino-tiling/)|52.7%|
|1055|1010|[pairs-of-songs-with-total-durations-divisible-by-60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1055-1010(pairs-of-songs-with-total-durations-divisible-by-60)/pairs-of-songs-with-total-durations-divisible-by-60.java)|[:memo:](https://leetcode.com/articles/pairs-of-songs-with-total-durations-divisible-by-60/)|52.7%|
|1520|1404|[number-of-steps-to-reduce-a-number-in-binary-representation-to-one](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one)|||52.6%|
|2640|2554|[maximum-number-of-integers-to-choose-from-a-range-i](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i)|||52.6%|
|80|80|[remove-duplicates-from-sorted-array-ii](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0080-0080(remove-duplicates-from-sorted-array-ii)/remove-duplicates-from-sorted-array-ii.java)|[:memo:](https://leetcode.com/articles/remove-duplicates-from-sorted-array-ii/)|52.5%|
|95|95|[unique-binary-search-trees-ii](https://leetcode.com/problems/unique-binary-search-trees-ii)||[:memo:](https://leetcode.com/articles/unique-binary-search-trees-ii/)|52.5%|
|592|592|[fraction-addition-and-subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction)||[:memo:](https://leetcode.com/articles/fraction-additon-and-subtraction/)|52.5%|
|1252|1328|[break-a-palindrome](https://leetcode.com/problems/break-a-palindrome)||[:memo:](https://leetcode.com/articles/break-a-palindrome/)|52.5%|
|155|155|[min-stack](https://leetcode.com/problems/min-stack)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0155-0155(min-stack)/min-stack.java)|[:memo:](https://leetcode.com/articles/min-stack/)|52.4%|
|319|319|[bulb-switcher](https://leetcode.com/problems/bulb-switcher)||[:memo:](https://leetcode.com/articles/bulb-switcher/)|52.4%|
|433|433|[minimum-genetic-mutation](https://leetcode.com/problems/minimum-genetic-mutation)||[:memo:](https://leetcode.com/articles/minimum-genetic-mutation/)|52.4%|
|966|930|[binary-subarrays-with-sum](https://leetcode.com/problems/binary-subarrays-with-sum)||[:memo:](https://leetcode.com/articles/binary-subarrays-with-sum/)|52.4%|
|1917|1792|[maximum-average-pass-ratio](https://leetcode.com/problems/maximum-average-pass-ratio)|||52.4%|
|38|38|[count-and-say](https://leetcode.com/problems/count-and-say)||[:memo:](https://leetcode.com/articles/count-and-say/)|52.3%|
|300|300|[longest-increasing-subsequence](https://leetcode.com/problems/longest-increasing-subsequence)||[:memo:](https://leetcode.com/articles/longest-increasing-subsequence/)|52.3%|
|443|443|[string-compression](https://leetcode.com/problems/string-compression)||[:memo:](https://leetcode.com/articles/string-compression/)|52.3%|
|1049|1007|[minimum-domino-rotations-for-equal-row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row)||[:memo:](https://leetcode.com/articles/minimum-domino-rotations-for-equal-row/)|52.3%|
|2059|1930|[unique-length-3-palindromic-subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences)|||52.3%|
|2160|2033|[minimum-operations-to-make-a-uni-value-grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid)|||52.3%|
|2300|2182|[construct-string-with-repeat-limit](https://leetcode.com/problems/construct-string-with-repeat-limit)|||52.3%|
|2587|2502|[design-memory-allocator](https://leetcode.com/problems/design-memory-allocator)|||52.3%|
|377|377|[combination-sum-iv](https://leetcode.com/problems/combination-sum-iv)||[:memo:](https://leetcode.com/articles/combination-sum-iv/)|52.2%|
|477|477|[total-hamming-distance](https://leetcode.com/problems/total-hamming-distance)||[:memo:](https://leetcode.com/articles/total-hamming-distance/)|52.2%|
|947|911|[online-election](https://leetcode.com/problems/online-election)||[:memo:](https://leetcode.com/articles/online-election/)|52.2%|
|1360|1239|[maximum-length-of-a-concatenated-string-with-unique-characters](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters)||[:memo:](https://leetcode.com/articles/maximum-length-of-a-concatenated-string-with-unique-characters/)|52.2%|
|1538|1423|[maximum-points-you-can-obtain-from-cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards)||[:memo:](https://leetcode.com/articles/maximum-points-you-can-obtain-from-cards/)|52.2%|
|1819|1718|[construct-the-lexicographically-largest-valid-sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence)|||52.2%|
|86|86|[partition-list](https://leetcode.com/problems/partition-list)||[:memo:](https://leetcode.com/articles/partition-list/)|52.1%|
|424|424|[longest-repeating-character-replacement](https://leetcode.com/problems/longest-repeating-character-replacement)||[:memo:](https://leetcode.com/articles/longest-repeating-character-replacement/)|52.1%|
|688|688|[knight-probability-in-chessboard](https://leetcode.com/problems/knight-probability-in-chessboard)||[:memo:](https://leetcode.com/articles/knight-probability-in-chessboard/)|52.1%|
|985|948|[bag-of-tokens](https://leetcode.com/problems/bag-of-tokens)||[:memo:](https://leetcode.com/articles/bag-of-tokens/)|52.1%|
|2047|1901|[find-a-peak-element-ii](https://leetcode.com/problems/find-a-peak-element-ii)|||52.1%|
|2355|2274|[maximum-consecutive-floors-without-special-floors](https://leetcode.com/problems/maximum-consecutive-floors-without-special-floors)|||52.1%|
|720|720|[longest-word-in-dictionary](https://leetcode.com/problems/longest-word-in-dictionary)||[:memo:](https://leetcode.com/articles/longest-word-in-dictionary/)|52.0%|
|744|743|[network-delay-time](https://leetcode.com/problems/network-delay-time)||[:memo:](https://leetcode.com/articles/network-delay-time/)|52.0%|
|907|875|[koko-eating-bananas](https://leetcode.com/problems/koko-eating-bananas)||[:memo:](https://leetcode.com/articles/koko-eating-bananas/)|52.0%|
|1023|981|[time-based-key-value-store](https://leetcode.com/problems/time-based-key-value-store)||[:memo:](https://leetcode.com/articles/time-based-key-value-store/)|52.0%|
|1238|1138|[alphabet-board-path](https://leetcode.com/problems/alphabet-board-path)|||52.0%|
|2343|2257|[count-unguarded-cells-in-the-grid](https://leetcode.com/problems/count-unguarded-cells-in-the-grid)|||52.0%|
|357|357|[count-numbers-with-unique-digits](https://leetcode.com/problems/count-numbers-with-unique-digits)|||51.9%|
|802|786|[k-th-smallest-prime-fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction)||[:memo:](https://leetcode.com/articles/k-th-smallest-prime-fraction/)|51.9%|
|901|870|[advantage-shuffle](https://leetcode.com/problems/advantage-shuffle)||[:memo:](https://leetcode.com/articles/advantage-shuffle/)|51.9%|
|1117|1162|[as-far-from-land-as-possible](https://leetcode.com/problems/as-far-from-land-as-possible)||[:memo:](https://leetcode.com/articles/as-far-from-land-as-possible/)|51.9%|
|1330|1218|[longest-arithmetic-subsequence-of-given-difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference)||[:memo:](https://leetcode.com/articles/longest-arithmetic-subsequence-of-given-difference/)|51.9%|
|1248|1145|[binary-tree-coloring-game](https://leetcode.com/problems/binary-tree-coloring-game)|||51.8%|
|1423|1297|[maximum-number-of-occurrences-of-a-substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring)|||51.8%|
|1311|1895|[largest-magic-square](https://leetcode.com/problems/largest-magic-square)|||51.7%|
|808|792|[number-of-matching-subsequences](https://leetcode.com/problems/number-of-matching-subsequences)||[:memo:](https://leetcode.com/articles/number-of-matching-subsequences/)|51.6%|
|73|73|[set-matrix-zeroes](https://leetcode.com/problems/set-matrix-zeroes)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0073-0073(set-matrix-zeroes)/set-matrix-zeroes.java)|[:memo:](https://leetcode.com/articles/set-matrix-zeroes/)|51.5%|
|138|138|[copy-list-with-random-pointer](https://leetcode.com/problems/copy-list-with-random-pointer)||[:memo:](https://leetcode.com/articles/copy-list-with-random-pointer/)|51.5%|
|860|622|[design-circular-queue](https://leetcode.com/problems/design-circular-queue)||[:memo:](https://leetcode.com/articles/design-circular-queue/)|51.5%|
|815|799|[champagne-tower](https://leetcode.com/problems/champagne-tower)||[:memo:](https://leetcode.com/articles/champagne-tower/)|51.4%|
|1006|966|[vowel-spellchecker](https://leetcode.com/problems/vowel-spellchecker)||[:memo:](https://leetcode.com/articles/vowel-spellchecker/)|51.4%|
|1526|1410|[html-entity-parser](https://leetcode.com/problems/html-entity-parser)|||51.4%|
|2284|2165|[smallest-value-of-the-rearranged-number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number)|||51.4%|
|423|423|[reconstruct-original-digits-from-english](https://leetcode.com/problems/reconstruct-original-digits-from-english)||[:memo:](https://leetcode.com/articles/reconstruct-original-digits-from-english/)|51.3%|
|486|486|[predict-the-winner](https://leetcode.com/problems/predict-the-winner)||[:memo:](https://leetcode.com/articles/predict-the-winner/)|51.3%|
|982|945|[minimum-increment-to-make-array-unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique)||[:memo:](https://leetcode.com/articles/minimum-increment-to-make-array-unique/)|51.3%|
|2691|2559|[count-vowel-strings-in-ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges)|||51.3%|
|147|147|[insertion-sort-list](https://leetcode.com/problems/insertion-sort-list)||[:memo:](https://leetcode.com/articles/insertion-sort-list/)|51.2%|
|718|718|[maximum-length-of-repeated-subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray)||[:memo:](https://leetcode.com/articles/maximum-length-of-repeated-subarray/)|51.2%|
|2255|2134|[minimum-swaps-to-group-all-1s-together-ii](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii)|||51.2%|
|99|99|[recover-binary-search-tree](https://leetcode.com/problems/recover-binary-search-tree)||[:memo:](https://leetcode.com/articles/recover-binary-search-tree/)|51.1%|
|240|240|[search-a-2d-matrix-ii](https://leetcode.com/problems/search-a-2d-matrix-ii)||[:memo:](https://leetcode.com/articles/search-a-2d-matrix-ii/)|51.1%|
|1748|1626|[best-team-with-no-conflicts](https://leetcode.com/problems/best-team-with-no-conflicts)||[:memo:](https://leetcode.com/articles/best-team-with-no-conflicts/)|51.1%|
|2325|2222|[number-of-ways-to-select-buildings](https://leetcode.com/problems/number-of-ways-to-select-buildings)|||51.1%|
|436|436|[find-right-interval](https://leetcode.com/problems/find-right-interval)||[:memo:](https://leetcode.com/articles/find-right-interval/)|51.0%|
|524|524|[longest-word-in-dictionary-through-deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting)||[:memo:](https://leetcode.com/articles/longest-word-in-dictionary-through-deletion/)|51.0%|
|2338|2260|[minimum-consecutive-cards-to-pick-up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up)|||51.0%|
|2151|2039|[the-time-when-the-network-becomes-idle](https://leetcode.com/problems/the-time-when-the-network-becomes-idle)|||50.9%|
|2192|2087|[minimum-cost-homecoming-of-a-robot-in-a-grid](https://leetcode.com/problems/minimum-cost-homecoming-of-a-robot-in-a-grid)|||50.9%|
|481|481|[magical-string](https://leetcode.com/problems/magical-string)|||50.8%|
|659|659|[split-array-into-consecutive-subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences)||[:memo:](https://leetcode.com/articles/split-array-into-consecutive-subsequences/)|50.8%|
|1401|1276|[number-of-burgers-with-no-waste-of-ingredients](https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients)|||50.8%|
|371|371|[sum-of-two-integers](https://leetcode.com/problems/sum-of-two-integers)||[:memo:](https://leetcode.com/articles/sum-of-two-integers/)|50.7%|
|1120|1042|[flower-planting-with-no-adjacent](https://leetcode.com/problems/flower-planting-with-no-adjacent)|||50.7%|
|1388|1262|[greatest-sum-divisible-by-three](https://leetcode.com/problems/greatest-sum-divisible-by-three)|||50.7%|
|1431|2192|[all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph)|||50.7%|
|2403|2316|[count-unreachable-pairs-of-nodes-in-an-undirected-graph](https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph)||[:memo:](https://leetcode.com/articles/count-unreachable-pairs-of-nodes-in-an-undirected-graph/)|50.7%|
|611|611|[valid-triangle-number](https://leetcode.com/problems/valid-triangle-number)||[:memo:](https://leetcode.com/articles/valid-triangle-number/)|50.6%|
|972|935|[knight-dialer](https://leetcode.com/problems/knight-dialer)||[:memo:](https://leetcode.com/articles/knight-dialer/)|50.6%|
|2188|2064|[minimized-maximum-of-products-distributed-to-any-store](https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store)|||50.6%|
|2332|2249|[count-lattice-points-inside-a-circle](https://leetcode.com/problems/count-lattice-points-inside-a-circle)|||50.6%|
|672|672|[bulb-switcher-ii](https://leetcode.com/problems/bulb-switcher-ii)||[:memo:](https://leetcode.com/articles/bulb-switcher-ii/)|50.5%|
|1032|990|[satisfiability-of-equality-equations](https://leetcode.com/problems/satisfiability-of-equality-equations)||[:memo:](https://leetcode.com/articles/satisfiability-of-equality-equations/)|50.5%|
|1539|1424|[diagonal-traverse-ii](https://leetcode.com/problems/diagonal-traverse-ii)|||50.5%|
|2779|2672|[number-of-adjacent-elements-with-the-same-color](https://leetcode.com/problems/number-of-adjacent-elements-with-the-same-color)|||50.5%|
|117|117|[populating-next-right-pointers-in-each-node-ii](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii)||[:memo:](https://leetcode.com/articles/populating-next-right-pointers-in-each-node-ii/)|50.4%|
|435|435|[non-overlapping-intervals](https://leetcode.com/problems/non-overlapping-intervals)||[:memo:](https://leetcode.com/articles/non-overlapping-intervals/)|50.4%|
|450|450|[delete-node-in-a-bst](https://leetcode.com/problems/delete-node-in-a-bst)||[:memo:](https://leetcode.com/articles/delete-node-in-a-bst/)|50.4%|
|1081|1024|[video-stitching](https://leetcode.com/problems/video-stitching)|||50.4%|
|1139|1053|[previous-permutation-with-one-swap](https://leetcode.com/problems/previous-permutation-with-one-swap)|||50.4%|
|883|853|[car-fleet](https://leetcode.com/problems/car-fleet)||[:memo:](https://leetcode.com/articles/car-fleet/)|50.3%|
|1030|988|[smallest-string-starting-from-leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf)||[:memo:](https://leetcode.com/articles/smallest-string-starting-from-leaf/)|50.3%|
|1995|1865|[finding-pairs-with-a-certain-sum](https://leetcode.com/problems/finding-pairs-with-a-certain-sum)|||50.3%|
|2139|2013|[detect-squares](https://leetcode.com/problems/detect-squares)|||50.3%|
|2609|2521|[distinct-prime-factors-of-product-of-array](https://leetcode.com/problems/distinct-prime-factors-of-product-of-array)|||50.3%|
|53|53|[maximum-subarray](https://leetcode.com/problems/maximum-subarray)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0053-0053(maximum-subarray)/maximum-subarray.java)|[:memo:](https://leetcode.com/articles/maximum-subarray/)|50.2%|
|438|438|[find-all-anagrams-in-a-string](https://leetcode.com/problems/find-all-anagrams-in-a-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0438-0438(find-all-anagrams-in-a-string)/find-all-anagrams-in-a-string.java)|[:memo:](https://leetcode.com/articles/find-all-anagrams-in-a-string/)|50.2%|
|1239|1139|[largest-1-bordered-square](https://leetcode.com/problems/largest-1-bordered-square)|||50.2%|
|1534|1419|[minimum-number-of-frogs-croaking](https://leetcode.com/problems/minimum-number-of-frogs-croaking)|||50.2%|
|922|886|[possible-bipartition](https://leetcode.com/problems/possible-bipartition)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0922-0886(possible-bipartition)/possible-bipartition.java)|[:memo:](https://leetcode.com/articles/possible-bipartition/)|50.1%|
|1477|1352|[product-of-the-last-k-numbers](https://leetcode.com/problems/product-of-the-last-k-numbers)|||50.1%|
|2710|2571|[minimum-operations-to-reduce-an-integer-to-0](https://leetcode.com/problems/minimum-operations-to-reduce-an-integer-to-0)|||50.1%|
|1011|971|[flip-binary-tree-to-match-preorder-traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal)||[:memo:](https://leetcode.com/articles/flip-binary-tree-to-match-preorder-traversal/)|50.0%|
|2197|2075|[decode-the-slanted-ciphertext](https://leetcode.com/problems/decode-the-slanted-ciphertext)|||50.0%|
|2245|2126|[destroying-asteroids](https://leetcode.com/problems/destroying-asteroids)|||50.0%|
|843|823|[binary-trees-with-factors](https://leetcode.com/problems/binary-trees-with-factors)||[:memo:](https://leetcode.com/articles/binary-trees-with-factors/)|49.7%|
|1648|1541|[minimum-insertions-to-balance-a-parentheses-string](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string)|||49.7%|
|2656|2588|[count-the-number-of-beautiful-subarrays](https://leetcode.com/problems/count-the-number-of-beautiful-subarrays)|||49.6%|
|198|198|[house-robber](https://leetcode.com/problems/house-robber)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0198-0198(house-robber)/house-robber.java)|[:memo:](https://leetcode.com/articles/house-robber/)|49.5%|
|299|299|[bulls-and-cows](https://leetcode.com/problems/bulls-and-cows)||[:memo:](https://leetcode.com/articles/bulls-and-cows/)|49.5%|
|2179|2070|[most-beautiful-item-for-each-query](https://leetcode.com/problems/most-beautiful-item-for-each-query)|||49.5%|
|1952|1824|[minimum-sideway-jumps](https://leetcode.com/problems/minimum-sideway-jumps)|||49.4%|
|2318|2212|[maximum-points-in-an-archery-competition](https://leetcode.com/problems/maximum-points-in-an-archery-competition)|||49.4%|
|2478|2401|[longest-nice-subarray](https://leetcode.com/problems/longest-nice-subarray)|||49.4%|
|2685|2661|[first-completely-painted-row-or-column](https://leetcode.com/problems/first-completely-painted-row-or-column)|||49.4%|
|1792|1673|[find-the-most-competitive-subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence)||[:memo:](https://leetcode.com/articles/find-the-most-competitive-subsequence/)|49.3%|
|2085|1968|[array-with-elements-not-equal-to-average-of-neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors)|||49.3%|
|2736|2645|[minimum-additions-to-make-valid-string](https://leetcode.com/problems/minimum-additions-to-make-valid-string)|||49.3%|
|1104|1034|[coloring-a-border](https://leetcode.com/problems/coloring-a-border)|||49.2%|
|2146|2018|[check-if-word-can-be-placed-in-crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword)|||49.2%|
|1230|1131|[maximum-of-absolute-value-expression](https://leetcode.com/problems/maximum-of-absolute-value-expression)|||49.1%|
|142|142|[linked-list-cycle-ii](https://leetcode.com/problems/linked-list-cycle-ii)||[:memo:](https://leetcode.com/articles/linked-list-cycle-ii/)|49.0%|
|1558|1462|[course-schedule-iv](https://leetcode.com/problems/course-schedule-iv)|||49.0%|
|2205|2100|[find-good-days-to-rob-the-bank](https://leetcode.com/problems/find-good-days-to-rob-the-bank)|||49.0%|
|2228|2105|[watering-plants-ii](https://leetcode.com/problems/watering-plants-ii)|||49.0%|
|2464|2380|[time-needed-to-rearrange-a-binary-string](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string)|||49.0%|
|153|153|[find-minimum-in-rotated-sorted-array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0153-0153(find-minimum-in-rotated-sorted-array)/find-minimum-in-rotated-sorted-array.java)|[:memo:](https://leetcode.com/articles/find-minimum-in-rotated-sorted-array/)|48.9%|
|1002|962|[maximum-width-ramp](https://leetcode.com/problems/maximum-width-ramp)||[:memo:](https://leetcode.com/articles/maximum-width-ramp/)|48.9%|
|1303|2139|[minimum-moves-to-reach-target-score](https://leetcode.com/problems/minimum-moves-to-reach-target-score)|||48.9%|
|2038|1926|[nearest-exit-from-entrance-in-maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze)||[:memo:](https://leetcode.com/articles/nearest-exit-from-entrance-in-maze/)|48.9%|
|1321|1208|[get-equal-substrings-within-budget](https://leetcode.com/problems/get-equal-substrings-within-budget)|||48.8%|
|1325|1514|[path-with-maximum-probability](https://leetcode.com/problems/path-with-maximum-probability)||[:memo:](https://leetcode.com/articles/path-with-maximum-probability/)|48.8%|
|2161|2034|[stock-price-fluctuation](https://leetcode.com/problems/stock-price-fluctuation)||[:memo:](https://leetcode.com/articles/stock-price-fluctuation/)|48.8%|
|773|558|[logical-or-of-two-binary-grids-represented-as-quad-trees](https://leetcode.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees)|||48.7%|
|1840|1722|[minimize-hamming-distance-after-swap-operations](https://leetcode.com/problems/minimize-hamming-distance-after-swap-operations)|||48.7%|
|1967|1839|[longest-substring-of-all-vowels-in-order](https://leetcode.com/problems/longest-substring-of-all-vowels-in-order)|||48.7%|
|2546|2447|[number-of-subarrays-with-gcd-equal-to-k](https://leetcode.com/problems/number-of-subarrays-with-gcd-equal-to-k)|||48.7%|
|210|210|[course-schedule-ii](https://leetcode.com/problems/course-schedule-ii)||[:memo:](https://leetcode.com/articles/course-schedule-ii/)|48.6%|
|1928|1801|[number-of-orders-in-the-backlog](https://leetcode.com/problems/number-of-orders-in-the-backlog)|||48.6%|
|2089|1975|[maximum-matrix-sum](https://leetcode.com/problems/maximum-matrix-sum)|||48.6%|
|951|915|[partition-array-into-disjoint-intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals)||[:memo:](https://leetcode.com/articles/parition-array-into-disjoint-intervals/)|48.5%|
|1229|1129|[shortest-path-with-alternating-colors](https://leetcode.com/problems/shortest-path-with-alternating-colors)||[:memo:](https://leetcode.com/articles/shortest-path-with-alternating-colors/)|48.5%|
|1657|1535|[find-the-winner-of-an-array-game](https://leetcode.com/problems/find-the-winner-of-an-array-game)|||48.5%|
|1885|1759|[count-number-of-homogenous-substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings)|||48.5%|
|2217|2096|[step-by-step-directions-from-a-binary-tree-node-to-another](https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another)|||48.5%|
|2220|2115|[find-all-possible-recipes-from-given-supplies](https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies)|||48.5%|
|2625|2536|[increment-submatrices-by-one](https://leetcode.com/problems/increment-submatrices-by-one)|||48.5%|
|128|128|[longest-consecutive-sequence](https://leetcode.com/problems/longest-consecutive-sequence)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0128-0128(longest-consecutive-sequence)/longest-consecutive-sequence.java)|[:memo:](https://leetcode.com/articles/longest-consecutive-sequence/)|48.4%|
|376|376|[wiggle-subsequence](https://leetcode.com/problems/wiggle-subsequence)||[:memo:](https://leetcode.com/articles/wiggle-subsequence/)|48.4%|
|1549|1438|[longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit)|||48.4%|
|2043|1914|[cyclically-rotating-a-grid](https://leetcode.com/problems/cyclically-rotating-a-grid)|||48.4%|
|2595|2507|[smallest-value-after-replacing-with-sum-of-prime-factors](https://leetcode.com/problems/smallest-value-after-replacing-with-sum-of-prime-factors)|||48.4%|
|769|764|[largest-plus-sign](https://leetcode.com/problems/largest-plus-sign)||[:memo:](https://leetcode.com/articles/largest-plus-sign/)|48.3%|
|905|873|[length-of-longest-fibonacci-subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence)||[:memo:](https://leetcode.com/articles/length-of-longest-fibonacci-subsequence/)|48.3%|
|1762|1642|[furthest-building-you-can-reach](https://leetcode.com/problems/furthest-building-you-can-reach)||[:memo:](https://leetcode.com/articles/furthest-building-you-can-reach/)|48.3%|
|2237|2131|[longest-palindrome-by-concatenating-two-letter-words](https://leetcode.com/problems/longest-palindrome-by-concatenating-two-letter-words)||[:memo:](https://leetcode.com/articles/longest-palindrome-by-concatenating-two-letter-words/)|48.3%|
|649|649|[dota2-senate](https://leetcode.com/problems/dota2-senate)||[:memo:](https://leetcode.com/articles/dota2-senate/)|48.2%|
|2055|1943|[describe-the-painting](https://leetcode.com/problems/describe-the-painting)|||48.2%|
|2339|2261|[k-divisible-elements-subarrays](https://leetcode.com/problems/k-divisible-elements-subarrays)|||48.2%|
|1663|1559|[detect-cycles-in-2d-grid](https://leetcode.com/problems/detect-cycles-in-2d-grid)|||48.1%|
|2503|2419|[longest-subarray-with-maximum-bitwise-and](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and)|||48.1%|
|2564|2467|[most-profitable-path-in-a-tree](https://leetcode.com/problems/most-profitable-path-in-a-tree)|||48.1%|
|2626|2537|[count-the-number-of-good-subarrays](https://leetcode.com/problems/count-the-number-of-good-subarrays)|||48.1%|
|74|74|[search-a-2d-matrix](https://leetcode.com/problems/search-a-2d-matrix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0074-0074(search-a-2d-matrix)/search-a-2d-matrix.java)|[:memo:](https://leetcode.com/articles/search-in-2d-matrix/)|47.9%|
|437|437|[path-sum-iii](https://leetcode.com/problems/path-sum-iii)||[:memo:](https://leetcode.com/articles/path-sum-iii/)|47.9%|
|670|670|[maximum-swap](https://leetcode.com/problems/maximum-swap)||[:memo:](https://leetcode.com/articles/maximum-swap/)|47.8%|
|1465|1339|[maximum-product-of-splitted-binary-tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree)||[:memo:](https://leetcode.com/articles/maximum-product-of-splitted-binary-tree/)|47.8%|
|2183|2059|[minimum-operations-to-convert-number](https://leetcode.com/problems/minimum-operations-to-convert-number)|||47.8%|
|2706|2567|[minimum-score-by-changing-two-elements](https://leetcode.com/problems/minimum-score-by-changing-two-elements)|||47.8%|
|2414|2337|[move-pieces-to-obtain-a-string](https://leetcode.com/problems/move-pieces-to-obtain-a-string)|||47.7%|
|93|93|[restore-ip-addresses](https://leetcode.com/problems/restore-ip-addresses)||[:memo:](https://leetcode.com/articles/restore-ip-addresses/)|47.6%|
|879|849|[maximize-distance-to-closest-person](https://leetcode.com/problems/maximize-distance-to-closest-person)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0879-0849(maximize-distance-to-closest-person)/maximize-distance-to-closest-person.java)|[:memo:](https://leetcode.com/articles/maximize-distance-to-closest-person/)|47.6%|
|2175|2049|[count-nodes-with-the-highest-score](https://leetcode.com/problems/count-nodes-with-the-highest-score)|||47.6%|
|858|831|[masking-personal-information](https://leetcode.com/problems/masking-personal-information)||[:memo:](https://leetcode.com/articles/masking-personal-information/)|47.5%|
|1649|1546|[maximum-number-of-non-overlapping-subarrays-with-sum-equals-target](https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target)|||47.4%|
|738|738|[monotone-increasing-digits](https://leetcode.com/problems/monotone-increasing-digits)||[:memo:](https://leetcode.com/articles/monotone-increasing-digits/)|47.3%|
|1507|1391|[check-if-there-is-a-valid-path-in-a-grid](https://leetcode.com/problems/check-if-there-is-a-valid-path-in-a-grid)|||47.3%|
|1900|1774|[closest-dessert-cost](https://leetcode.com/problems/closest-dessert-cost)|||47.3%|
|2530|2439|[minimize-maximum-of-array](https://leetcode.com/problems/minimize-maximum-of-array)||[:memo:](https://leetcode.com/articles/minimize-maximum-of-array/)|47.3%|
|1020|978|[longest-turbulent-subarray](https://leetcode.com/problems/longest-turbulent-subarray)||[:memo:](https://leetcode.com/articles/longest-turbulent-subarray/)|47.2%|
|1247|1144|[decrease-elements-to-make-array-zigzag](https://leetcode.com/problems/decrease-elements-to-make-array-zigzag)|||47.2%|
|2174|2048|[next-greater-numerically-balanced-number](https://leetcode.com/problems/next-greater-numerically-balanced-number)|||47.2%|
|187|187|[repeated-dna-sequences](https://leetcode.com/problems/repeated-dna-sequences)||[:memo:](https://leetcode.com/articles/repeated-dna-sequences/)|47.1%|
|1990|1878|[get-biggest-three-rhombus-sums-in-a-grid](https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid)|||47.1%|
|375|375|[guess-number-higher-or-lower-ii](https://leetcode.com/problems/guess-number-higher-or-lower-ii)||[:memo:](https://leetcode.com/articles/guess-higher-or-lower-number-ii/)|47.0%|
|2138|2012|[sum-of-beauty-in-the-array](https://leetcode.com/problems/sum-of-beauty-in-the-array)|||47.0%|
|2348|2266|[count-number-of-texts](https://leetcode.com/problems/count-number-of-texts)|||47.0%|
|1355|2216|[minimum-deletions-to-make-array-beautiful](https://leetcode.com/problems/minimum-deletions-to-make-array-beautiful)|||46.9%|
|2646|2583|[kth-largest-sum-in-a-binary-tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree)|||46.9%|
|474|474|[ones-and-zeroes](https://leetcode.com/problems/ones-and-zeroes)||[:memo:](https://leetcode.com/articles/ones-and-zeroes/)|46.8%|
|525|525|[contiguous-array](https://leetcode.com/problems/contiguous-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0525-0525(contiguous-array)/contiguous-array.java)|[:memo:](https://leetcode.com/articles/contiguous-array/)|46.8%|
|658|658|[find-k-closest-elements](https://leetcode.com/problems/find-k-closest-elements)||[:memo:](https://leetcode.com/articles/find-k-closest-elements/)|46.8%|
|1064|1015|[smallest-integer-divisible-by-k](https://leetcode.com/problems/smallest-integer-divisible-by-k)||[:memo:](https://leetcode.com/articles/smallest-integer-divisible-by-k/)|46.8%|
|2483|2365|[task-scheduler-ii](https://leetcode.com/problems/task-scheduler-ii)|||46.8%|
|388|388|[longest-absolute-file-path](https://leetcode.com/problems/longest-absolute-file-path)|||46.7%|
|1087|1027|[longest-arithmetic-subsequence](https://leetcode.com/problems/longest-arithmetic-subsequence)||[:memo:](https://leetcode.com/articles/longest-arithmetic-subsequence/)|46.7%|
|1709|1604|[alert-using-same-key-card-three-or-more-times-in-a-one-hour-period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period)|||46.6%|
|2262|2140|[solving-questions-with-brainpower](https://leetcode.com/problems/solving-questions-with-brainpower)||[:memo:](https://leetcode.com/articles/solving-questions-with-brainpower/)|46.6%|
|2511|2522|[partition-string-into-substrings-with-values-at-most-k](https://leetcode.com/problems/partition-string-into-substrings-with-values-at-most-k)|||46.6%|
|2039|1927|[sum-game](https://leetcode.com/problems/sum-game)|||46.5%|
|2455|2374|[node-with-highest-edge-score](https://leetcode.com/problems/node-with-highest-edge-score)|||46.5%|
|1658|1536|[minimum-swaps-to-arrange-a-binary-grid](https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid)|||46.4%|
|2603|2512|[reward-top-k-students](https://leetcode.com/problems/reward-top-k-students)|||46.4%|
|852|825|[friends-of-appropriate-ages](https://leetcode.com/problems/friends-of-appropriate-ages)||[:memo:](https://leetcode.com/articles/friends-of-appropriate-ages/)|46.3%|
|903|470|[implement-rand10-using-rand7](https://leetcode.com/problems/implement-rand10-using-rand7)||[:memo:](https://leetcode.com/articles/implement-rand10-using-rand7/)|46.3%|
|1103|1033|[moving-stones-until-consecutive](https://leetcode.com/problems/moving-stones-until-consecutive)|||46.3%|
|2129|2001|[number-of-pairs-of-interchangeable-rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles)|||46.3%|
|56|56|[merge-intervals](https://leetcode.com/problems/merge-intervals)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0056-0056(merge-intervals)/merge-intervals.java)|[:memo:](https://leetcode.com/articles/merge-intervals/)|46.2%|
|264|264|[ugly-number-ii](https://leetcode.com/problems/ugly-number-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0264-0264(ugly-number-ii)/ugly-number-ii.java)|[:memo:](https://leetcode.com/articles/ugly-number-ii/)|46.2%|
|416|416|[partition-equal-subset-sum](https://leetcode.com/problems/partition-equal-subset-sum)||[:memo:](https://leetcode.com/articles/partition-equal-subset-sum/)|46.2%|
|827|809|[expressive-words](https://leetcode.com/problems/expressive-words)||[:memo:](https://leetcode.com/articles/expressive-words/)|46.2%|
|1804|1702|[maximum-binary-string-after-change](https://leetcode.com/problems/maximum-binary-string-after-change)|||46.2%|
|1818|1717|[maximum-score-from-removing-substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings)|||46.2%|
|1880|1754|[largest-merge-of-two-strings](https://leetcode.com/problems/largest-merge-of-two-strings)|||46.2%|
|134|134|[gas-station](https://leetcode.com/problems/gas-station)||[:memo:](https://leetcode.com/articles/gas-station/)|46.1%|
|912|528|[random-pick-with-weight](https://leetcode.com/problems/random-pick-with-weight)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0912-0528(random-pick-with-weight)/random-pick-with-weight.java)|[:memo:](https://leetcode.com/articles/random-pick-with-weight/)|46.1%|
|2438|2359|[find-closest-node-to-given-two-nodes](https://leetcode.com/problems/find-closest-node-to-given-two-nodes)||[:memo:](https://leetcode.com/articles/find-closest-node-to-given-two-nodes/)|46.1%|
|2488|2406|[divide-intervals-into-minimum-number-of-groups](https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups)|||46.1%|
|82|82|[remove-duplicates-from-sorted-list-ii](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii)||[:memo:](https://leetcode.com/articles/remove-duplicates-from-sorted-list-ii/)|46.0%|
|150|150|[evaluate-reverse-polish-notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)||[:memo:](https://leetcode.com/articles/evaluate-reverse-polish-notation/)|46.0%|
|162|162|[find-peak-element](https://leetcode.com/problems/find-peak-element)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0162-0162(find-peak-element)/find-peak-element.java)|[:memo:](https://leetcode.com/articles/find-peak-element/)|46.0%|
|390|390|[elimination-game](https://leetcode.com/problems/elimination-game)|||46.0%|
|1436|1311|[get-watched-videos-by-your-friends](https://leetcode.com/problems/get-watched-videos-by-your-friends)|||46.0%|
|1814|1696|[jump-game-vi](https://leetcode.com/problems/jump-game-vi)||[:memo:](https://leetcode.com/articles/jump-game-vi/)|46.0%|
|713|713|[subarray-product-less-than-k](https://leetcode.com/problems/subarray-product-less-than-k)||[:memo:](https://leetcode.com/articles/subarray-product-less-than-k/)|45.9%|
|842|822|[card-flipping-game](https://leetcode.com/problems/card-flipping-game)||[:memo:](https://leetcode.com/articles/card-flipping-game/)|45.9%|
|1140|1054|[distant-barcodes](https://leetcode.com/problems/distant-barcodes)|||45.9%|
|2541|2443|[sum-of-number-and-its-reverse](https://leetcode.com/problems/sum-of-number-and-its-reverse)|||45.8%|
|16|16|[3sum-closest](https://leetcode.com/problems/3sum-closest)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0016-0016(3sum-closest)/3sum-closest.java)|[:memo:](https://leetcode.com/articles/3sum-closest/)|45.7%|
|494|494|[target-sum](https://leetcode.com/problems/target-sum)||[:memo:](https://leetcode.com/articles/target-sum/)|45.7%|
|1333|2191|[sort-the-jumbled-numbers](https://leetcode.com/problems/sort-the-jumbled-numbers)|||45.7%|
|1962|1834|[single-threaded-cpu](https://leetcode.com/problems/single-threaded-cpu)||[:memo:](https://leetcode.com/articles/single-threaded-cpu/)|45.7%|
|139|139|[word-break](https://leetcode.com/problems/word-break)||[:memo:](https://leetcode.com/articles/word-break/)|45.6%|
|2358|2270|[number-of-ways-to-split-array](https://leetcode.com/problems/number-of-ways-to-split-array)|||45.6%|
|2620|2526|[find-consecutive-integers-from-a-data-stream](https://leetcode.com/problems/find-consecutive-integers-from-a-data-stream)|||45.6%|
|313|313|[super-ugly-number](https://leetcode.com/problems/super-ugly-number)|||45.5%|
|2044|1915|[number-of-wonderful-substrings](https://leetcode.com/problems/number-of-wonderful-substrings)|||45.5%|
|2080|1958|[check-if-move-is-legal](https://leetcode.com/problems/check-if-move-is-legal)|||45.5%|
|2310|2208|[minimum-operations-to-halve-array-sum](https://leetcode.com/problems/minimum-operations-to-halve-array-sum)|||45.5%|
|92|92|[reverse-linked-list-ii](https://leetcode.com/problems/reverse-linked-list-ii)||[:memo:](https://leetcode.com/articles/reverse-linked-list-ii/)|45.4%|
|207|207|[course-schedule](https://leetcode.com/problems/course-schedule)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0207-0207(course-schedule)/course-schedule.java)|[:memo:](https://leetcode.com/articles/course-schedule/)|45.4%|
|1636|1513|[number-of-substrings-with-only-1s](https://leetcode.com/problems/number-of-substrings-with-only-1s)|||45.4%|
|2434|2349|[design-a-number-container-system](https://leetcode.com/problems/design-a-number-container-system)|||45.4%|
|229|229|[majority-element-ii](https://leetcode.com/problems/majority-element-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0229-0229(majority-element-ii)/majority-element-ii.java)|[:memo:](https://leetcode.com/articles/majority-element-ii/)|45.3%|
|959|923|[3sum-with-multiplicity](https://leetcode.com/problems/3sum-with-multiplicity)||[:memo:](https://leetcode.com/articles/3sum-with-multiplicity/)|45.3%|
|2164|2054|[two-best-non-overlapping-events](https://leetcode.com/problems/two-best-non-overlapping-events)|||45.3%|
|54|54|[spiral-matrix](https://leetcode.com/problems/spiral-matrix)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0054-0054(spiral-matrix)/spiral-matrix.java)|[:memo:](https://leetcode.com/articles/spiral-matrix/)|45.2%|
|223|223|[rectangle-area](https://leetcode.com/problems/rectangle-area)||[:memo:](https://leetcode.com/articles/rectangle-area/)|45.2%|
|316|316|[remove-duplicate-letters](https://leetcode.com/problems/remove-duplicate-letters)||[:memo:](https://leetcode.com/articles/remove-duplicate-letters/)|45.2%|
|209|209|[minimum-size-subarray-sum](https://leetcode.com/problems/minimum-size-subarray-sum)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0209-0209(minimum-size-subarray-sum)/minimum-size-subarray-sum.java)|[:memo:](https://leetcode.com/articles/minimum-size-subarray-sum/)|45.1%|
|221|221|[maximal-square](https://leetcode.com/problems/maximal-square)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0221-0221(maximal-square)/maximal-square.java)|[:memo:](https://leetcode.com/articles/maximal-square/)|45.1%|
|393|393|[utf-8-validation](https://leetcode.com/problems/utf-8-validation)||[:memo:](https://leetcode.com/articles/utf-8-validation/)|45.1%|
|878|848|[shifting-letters](https://leetcode.com/problems/shifting-letters)||[:memo:](https://leetcode.com/articles/shifting-letters/)|45.1%|
|945|909|[snakes-and-ladders](https://leetcode.com/problems/snakes-and-ladders)||[:memo:](https://leetcode.com/articles/snakes-and-ladders/)|45.1%|
|6|6|[zigzag-conversion](https://leetcode.com/problems/zigzag-conversion)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0006-0006(zigzag-conversion)/zigzag-conversion.java)|[:memo:](https://leetcode.com/articles/zigzag-conversion/)|45.0%|
|1261|1156|[swap-for-longest-repeated-character-substring](https://leetcode.com/problems/swap-for-longest-repeated-character-substring)|||45.0%|
|1621|1498|[number-of-subsequences-that-satisfy-the-given-sum-condition](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition)||[:memo:](https://leetcode.com/articles/number-of-subsequence-that-satisfy-the-given-sum-condition/)|45.0%|
|2408|2327|[number-of-people-aware-of-a-secret](https://leetcode.com/problems/number-of-people-aware-of-a-secret)|||45.0%|
|542|542|[01-matrix](https://leetcode.com/problems/01-matrix)||[:memo:](https://leetcode.com/articles/01-matrix/)|44.9%|
|853|826|[most-profit-assigning-work](https://leetcode.com/problems/most-profit-assigning-work)||[:memo:](https://leetcode.com/articles/most-profit-assigning-work/)|44.9%|
|395|395|[longest-substring-with-at-least-k-repeating-characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters)||[:memo:](https://leetcode.com/articles/longest-substring-with-at-least-k-repeating-characters/)|44.8%|
|1171|1091|[shortest-path-in-binary-matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix)||[:memo:](https://leetcode.com/articles/shortest-path-in-a-binary-matrix/)|44.8%|
|2155|2028|[find-missing-observations](https://leetcode.com/problems/find-missing-observations)|||44.8%|
|2191|2086|[minimum-number-of-food-buckets-to-feed-the-hamsters](https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters)|||44.8%|
|2006|1894|[find-the-student-that-will-replace-the-chalk](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk)|||44.7%|
|2033|1904|[the-number-of-full-rounds-you-have-played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played)|||44.7%|
|331|331|[verify-preorder-serialization-of-a-binary-tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree)||[:memo:](https://leetcode.com/articles/verify-preorder-serialization-of-a-binary-tree/)|44.6%|
|2165|2055|[plates-between-candles](https://leetcode.com/problems/plates-between-candles)|||44.6%|
|735|735|[asteroid-collision](https://leetcode.com/problems/asteroid-collision)||[:memo:](https://leetcode.com/articles/asteroid-collision/)|44.5%|
|1379|1253|[reconstruct-a-2-row-binary-matrix](https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix)|||44.5%|
|2113|1985|[find-the-kth-largest-integer-in-the-array](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array)|||44.5%|
|567|567|[permutation-in-string](https://leetcode.com/problems/permutation-in-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0567-0567(permutation-in-string)/permutation-in-string.java)|[:memo:](https://leetcode.com/articles/short-permutation-in-a-long-string/)|44.3%|
|576|576|[out-of-boundary-paths](https://leetcode.com/problems/out-of-boundary-paths)||[:memo:](https://leetcode.com/articles/out-of-boundary-paths/)|44.3%|
|1690|1567|[maximum-length-of-subarray-with-positive-product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product)|||44.1%|
|1850|1750|[minimum-length-of-string-after-deleting-similar-ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends)|||44.1%|
|211|211|[design-add-and-search-words-data-structure](https://leetcode.com/problems/design-add-and-search-words-data-structure)||[:memo:](https://leetcode.com/articles/add-and-search-word/)|44.0%|
|1501|1401|[circle-and-rectangle-overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping)|||44.0%|
|2104|1993|[operations-on-tree](https://leetcode.com/problems/operations-on-tree)|||44.0%|
|593|593|[valid-square](https://leetcode.com/problems/valid-square)||[:memo:](https://leetcode.com/articles/valid-square/)|43.9%|
|1470|1348|[tweet-counts-per-frequency](https://leetcode.com/problems/tweet-counts-per-frequency)|||43.9%|
|2123|1996|[the-number-of-weak-characters-in-the-game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game)||[:memo:](https://leetcode.com/articles/the-number-of-weak-characters-in-the-game/)|43.9%|
|1484|1367|[linked-list-in-binary-tree](https://leetcode.com/problems/linked-list-in-binary-tree)|||43.8%|
|2034|1906|[minimum-absolute-difference-queries](https://leetcode.com/problems/minimum-absolute-difference-queries)|||43.8%|
|2665|2594|[minimum-time-to-repair-cars](https://leetcode.com/problems/minimum-time-to-repair-cars)|||43.8%|
|940|904|[fruit-into-baskets](https://leetcode.com/problems/fruit-into-baskets)||[:memo:](https://leetcode.com/articles/fruit-into-baskets/)|43.7%|
|1010|970|[powerful-integers](https://leetcode.com/problems/powerful-integers)||[:memo:](https://leetcode.com/articles/powerful-integers/)|43.7%|
|1232|1300|[sum-of-mutated-array-closest-to-target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target)|||43.7%|
|1721|1599|[maximum-profit-of-operating-a-centennial-wheel](https://leetcode.com/problems/maximum-profit-of-operating-a-centennial-wheel)|||43.7%|
|2145|2017|[grid-game](https://leetcode.com/problems/grid-game)|||43.7%|
|2240|2121|[intervals-between-identical-elements](https://leetcode.com/problems/intervals-between-identical-elements)|||43.7%|
|2543|2456|[most-popular-video-creator](https://leetcode.com/problems/most-popular-video-creator)|||43.7%|
|560|560|[subarray-sum-equals-k](https://leetcode.com/problems/subarray-sum-equals-k)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0560-0560(subarray-sum-equals-k)/subarray-sum-equals-k.java)|[:memo:](https://leetcode.com/articles/subarray-sum-equals-k/)|43.6%|
|826|808|[soup-servings](https://leetcode.com/problems/soup-servings)||[:memo:](https://leetcode.com/articles/soup-servings/)|43.6%|
|2118|2008|[maximum-earnings-from-taxi](https://leetcode.com/problems/maximum-earnings-from-taxi)|||43.6%|
|2616|2530|[maximal-score-after-applying-k-operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations)|||43.6%|
|640|640|[solve-the-equation](https://leetcode.com/problems/solve-the-equation)||[:memo:](https://leetcode.com/articles/solve-the-equation/)|43.4%|
|885|855|[exam-room](https://leetcode.com/problems/exam-room)||[:memo:](https://leetcode.com/articles/exam-room/)|43.4%|
|1183|1093|[statistics-from-a-large-sample](https://leetcode.com/problems/statistics-from-a-large-sample)|||43.3%|
|790|775|[global-and-local-inversions](https://leetcode.com/problems/global-and-local-inversions)||[:memo:](https://leetcode.com/articles/global-and-local-inversions/)|43.2%|
|1026|984|[string-without-aaa-or-bbb](https://leetcode.com/problems/string-without-aaa-or-bbb)||[:memo:](https://leetcode.com/articles/string-without-aaa-or-bbb/)|43.2%|
|1267|1171|[remove-zero-sum-consecutive-nodes-from-linked-list](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list)|||43.2%|
|1631|1524|[number-of-sub-arrays-with-odd-sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum)|||43.2%|
|2342|2256|[minimum-average-difference](https://leetcode.com/problems/minimum-average-difference)||[:memo:](https://leetcode.com/articles/minimum-average-difference/)|43.1%|
|673|673|[number-of-longest-increasing-subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence)||[:memo:](https://leetcode.com/articles/number-of-longest-increasing-subsequence/)|43.0%|
|954|918|[maximum-sum-circular-subarray](https://leetcode.com/problems/maximum-sum-circular-subarray)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0954-0918(maximum-sum-circular-subarray)/maximum-sum-circular-subarray.java)|[:memo:](https://leetcode.com/articles/maximum-sum-circular-subarray/)|43.0%|
|1684|1562|[find-latest-group-of-size-m](https://leetcode.com/problems/find-latest-group-of-size-m)|||42.9%|
|2066|1936|[add-minimum-number-of-rungs](https://leetcode.com/problems/add-minimum-number-of-rungs)|||42.9%|
|2725|2611|[mice-and-cheese](https://leetcode.com/problems/mice-and-cheese)|||42.9%|
|1994|1864|[minimum-number-of-swaps-to-make-the-binary-string-alternating](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating)|||42.8%|
|334|334|[increasing-triplet-subsequence](https://leetcode.com/problems/increasing-triplet-subsequence)||[:memo:](https://leetcode.com/articles/increasing-triplet-subsequence/)|42.7%|
|662|662|[maximum-width-of-binary-tree](https://leetcode.com/problems/maximum-width-of-binary-tree)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0662-0662(maximum-width-of-binary-tree)/maximum-width-of-binary-tree.java)|[:memo:](https://leetcode.com/articles/maximum-width-of-binary-tree/)|42.7%|
|755|754|[reach-a-number](https://leetcode.com/problems/reach-a-number)||[:memo:](https://leetcode.com/articles/reach-a-number/)|42.7%|
|2211|2090|[k-radius-subarray-averages](https://leetcode.com/problems/k-radius-subarray-averages)||[:memo:](https://leetcode.com/articles/k-radius-subarray-averages/)|42.7%|
|2256|2135|[count-words-obtained-after-adding-a-letter](https://leetcode.com/problems/count-words-obtained-after-adding-a-letter)|||42.7%|
|1911|1785|[minimum-elements-to-add-to-form-a-given-sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum)|||42.6%|
|2509|2429|[minimize-xor](https://leetcode.com/problems/minimize-xor)|||42.6%|
|201|201|[bitwise-and-of-numbers-range](https://leetcode.com/problems/bitwise-and-of-numbers-range)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0201-0201(bitwise-and-of-numbers-range)/bitwise-and-of-numbers-range.java)|[:memo:](https://leetcode.com/articles/bitwise-and-of-numbers-range/)|42.5%|
|227|227|[basic-calculator-ii](https://leetcode.com/problems/basic-calculator-ii)||[:memo:](https://leetcode.com/articles/basic-calculator-ii/)|42.5%|
|2317|2211|[count-collisions-on-a-road](https://leetcode.com/problems/count-collisions-on-a-road)|||42.4%|
|172|172|[factorial-trailing-zeroes](https://leetcode.com/problems/factorial-trailing-zeroes)||[:memo:](https://leetcode.com/articles/factorial-trailing-zeroes/)|42.3%|
|1725|1621|[number-of-sets-of-k-non-overlapping-line-segments](https://leetcode.com/problems/number-of-sets-of-k-non-overlapping-line-segments)|||42.3%|
|2081|1959|[minimum-total-space-wasted-with-k-resizing-operations](https://leetcode.com/problems/minimum-total-space-wasted-with-k-resizing-operations)|||42.3%|
|2206|2101|[detonate-the-maximum-bombs](https://leetcode.com/problems/detonate-the-maximum-bombs)|||42.3%|
|322|322|[coin-change](https://leetcode.com/problems/coin-change)||[:memo:](https://leetcode.com/articles/coin-change/)|42.2%|
|1925|1814|[count-nice-pairs-in-an-array](https://leetcode.com/problems/count-nice-pairs-in-an-array)|||42.1%|
|2290|2171|[removing-minimum-number-of-magic-beans](https://leetcode.com/problems/removing-minimum-number-of-magic-beans)|||42.1%|
|2562|2466|[count-ways-to-build-good-strings](https://leetcode.com/problems/count-ways-to-build-good-strings)||[:memo:](https://leetcode.com/articles/count-ways-to-build-good-strings/)|42.1%|
|34|34|[find-first-and-last-position-of-element-in-sorted-array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0034-0034(find-first-and-last-position-of-element-in-sorted-array)/find-first-and-last-position-of-element-in-sorted-array.java)|[:memo:](https://leetcode.com/articles/find-first-and-last-position-of-element-in-sorted-array/)|42.0%|
|1834|1733|[minimum-number-of-people-to-teach](https://leetcode.com/problems/minimum-number-of-people-to-teach)|||41.9%|
|2498|2411|[smallest-subarrays-with-maximum-bitwise-or](https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or)|||41.7%|
|368|368|[largest-divisible-subset](https://leetcode.com/problems/largest-divisible-subset)||[:memo:](https://leetcode.com/articles/largest-divisible-subset/)|41.6%|
|1288|1186|[maximum-subarray-sum-with-one-deletion](https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion)|||41.5%|
|2250|2146|[k-highest-ranked-items-within-a-price-range](https://leetcode.com/problems/k-highest-ranked-items-within-a-price-range)|||41.5%|
|795|779|[k-th-symbol-in-grammar](https://leetcode.com/problems/k-th-symbol-in-grammar)||[:memo:](https://leetcode.com/articles/k-th-symbol-in-grammar/)|41.4%|
|1529|1432|[max-difference-you-can-get-from-changing-an-integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer)|||41.4%|
|2422|2343|[query-kth-smallest-trimmed-number](https://leetcode.com/problems/query-kth-smallest-trimmed-number)|||41.4%|
|19|19|[remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list)||[:memo:](https://leetcode.com/articles/remove-nth-node-from-end-of-list/)|41.3%|
|532|532|[k-diff-pairs-in-an-array](https://leetcode.com/problems/k-diff-pairs-in-an-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0532-0532(k-diff-pairs-in-an-array)/k-diff-pairs-in-an-array.java)|[:memo:](https://leetcode.com/articles/k-diff-pairs-in-an-array/)|41.3%|
|396|396|[rotate-function](https://leetcode.com/problems/rotate-function)|||41.2%|
|1284|1390|[four-divisors](https://leetcode.com/problems/four-divisors)|||41.2%|
|2027|1898|[maximum-number-of-removable-characters](https://leetcode.com/problems/maximum-number-of-removable-characters)|||41.2%|
|2392|2300|[successful-pairs-of-spells-and-potions](https://leetcode.com/problems/successful-pairs-of-spells-and-potions)||[:memo:](https://leetcode.com/articles/successful-pairs-of-spells-and-potions/)|41.2%|
|213|213|[house-robber-ii](https://leetcode.com/problems/house-robber-ii)||[:memo:](https://leetcode.com/articles/house-robber-ii/)|41.1%|
|1487|1386|[cinema-seat-allocation](https://leetcode.com/problems/cinema-seat-allocation)|||41.0%|
|2329|2233|[maximum-product-after-k-increments](https://leetcode.com/problems/maximum-product-after-k-increments)|||41.0%|
|2448|2364|[count-number-of-bad-pairs](https://leetcode.com/problems/count-number-of-bad-pairs)|||41.0%|
|1575|1465|[maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts)||[:memo:](https://leetcode.com/articles/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/)|40.9%|
|2054|1942|[the-number-of-the-smallest-unoccupied-chair](https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair)|||40.8%|
|2567|2476|[closest-nodes-queries-in-a-binary-search-tree](https://leetcode.com/problems/closest-nodes-queries-in-a-binary-search-tree)|||40.8%|
|146|146|[lru-cache](https://leetcode.com/problems/lru-cache)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0146-0146(lru-cache)/lru-cache.java)|[:memo:](https://leetcode.com/articles/lru-cache/)|40.7%|
|307|307|[range-sum-query-mutable](https://leetcode.com/problems/range-sum-query-mutable)||[:memo:](https://leetcode.com/articles/range-sum-query-mutable/)|40.7%|
|71|71|[simplify-path](https://leetcode.com/problems/simplify-path)||[:memo:](https://leetcode.com/articles/simplify-path/)|40.6%|
|522|522|[longest-uncommon-subsequence-ii](https://leetcode.com/problems/longest-uncommon-subsequence-ii)||[:memo:](https://leetcode.com/articles/longest-uncommon-subsequence-ii/)|40.6%|
|2117|2007|[find-original-array-from-doubled-array](https://leetcode.com/problems/find-original-array-from-doubled-array)||[:memo:](https://leetcode.com/articles/find-original-array-from-doubled-array/)|40.6%|
|2397|2320|[count-number-of-ways-to-place-houses](https://leetcode.com/problems/count-number-of-ways-to-place-houses)|||40.6%|
|2632|2546|[apply-bitwise-operations-to-make-strings-equal](https://leetcode.com/problems/apply-bitwise-operations-to-make-strings-equal)|||40.6%|
|2|2|[add-two-numbers](https://leetcode.com/problems/add-two-numbers)||[:memo:](https://leetcode.com/articles/add-two-numbers/)|40.5%|
|687|687|[longest-univalue-path](https://leetcode.com/problems/longest-univalue-path)||[:memo:](https://leetcode.com/articles/longest-univalue-path/)|40.5%|
|2690|2560|[house-robber-iv](https://leetcode.com/problems/house-robber-iv)|||40.4%|
|79|79|[word-search](https://leetcode.com/problems/word-search)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0079-0079(word-search)/word-search.java)|[:memo:](https://leetcode.com/articles/word-search/)|40.3%|
|2050|1922|[count-good-numbers](https://leetcode.com/problems/count-good-numbers)|||40.3%|
|473|473|[matchsticks-to-square](https://leetcode.com/problems/matchsticks-to-square)||[:memo:](https://leetcode.com/articles/matchsticks-to-square/)|40.2%|
|875|845|[longest-mountain-in-array](https://leetcode.com/problems/longest-mountain-in-array)||[:memo:](https://leetcode.com/articles/longest-mountain-in-array/)|40.2%|
|1699|1577|[number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers)|||40.2%|
|2443|2369|[check-if-there-is-a-valid-partition-for-the-array](https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array)|||40.2%|
|913|519|[random-flip-matrix](https://leetcode.com/problems/random-flip-matrix)||[:memo:](https://leetcode.com/articles/random-flip-matrix/)|40.1%|
|2266|2162|[minimum-cost-to-set-cooking-time](https://leetcode.com/problems/minimum-cost-to-set-cooking-time)|||40.1%|
|45|45|[jump-game-ii](https://leetcode.com/problems/jump-game-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0045-0045(jump-game-ii)/jump-game-ii.java)|[:memo:](https://leetcode.com/articles/jump-game-ii/)|39.9%|
|698|698|[partition-to-k-equal-sum-subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets)||[:memo:](https://leetcode.com/articles/partition-to-k-equal-sum-subsets/)|39.8%|
|1275|1361|[validate-binary-tree-nodes](https://leetcode.com/problems/validate-binary-tree-nodes)|||39.7%|
|2655|2587|[rearrange-array-to-maximize-prefix-score](https://leetcode.com/problems/rearrange-array-to-maximize-prefix-score)|||39.7%|
|915|478|[generate-random-point-in-a-circle](https://leetcode.com/problems/generate-random-point-in-a-circle)||[:memo:](https://leetcode.com/articles/generate-random-point-in-a-circle/)|39.6%|
|63|63|[unique-paths-ii](https://leetcode.com/problems/unique-paths-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0063-0063(unique-paths-ii)/unique-paths-ii.java)|[:memo:](https://leetcode.com/articles/unique-paths-ii/)|39.5%|
|189|189|[rotate-array](https://leetcode.com/problems/rotate-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0189-0189(rotate-array)/rotate-array.java)|[:memo:](https://leetcode.com/articles/rotate-array/)|39.5%|
|1966|1838|[frequency-of-the-most-frequent-element](https://leetcode.com/problems/frequency-of-the-most-frequent-element)|||39.5%|
|2012|1882|[process-tasks-using-servers](https://leetcode.com/problems/process-tasks-using-servers)|||39.5%|
|914|497|[random-point-in-non-overlapping-rectangles](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles)||[:memo:](https://leetcode.com/articles/random-point-in-non-overlapping-rectangles/)|39.4%|
|2084|1953|[maximum-number-of-weeks-for-which-you-can-work](https://leetcode.com/problems/maximum-number-of-weeks-for-which-you-can-work)|||39.4%|
|2586|2501|[longest-square-streak-in-an-array](https://leetcode.com/problems/longest-square-streak-in-an-array)|||39.4%|
|43|43|[multiply-strings](https://leetcode.com/problems/multiply-strings)||[:memo:](https://leetcode.com/articles/multiply-strings/)|39.2%|
|2294|2187|[minimum-time-to-complete-trips](https://leetcode.com/problems/minimum-time-to-complete-trips)||[:memo:](https://leetcode.com/articles/minimum-time-to-complete-trips/)|39.2%|
|33|33|[search-in-rotated-sorted-array](https://leetcode.com/problems/search-in-rotated-sorted-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0033-0033(search-in-rotated-sorted-array)/search-in-rotated-sorted-array.java)|[:memo:](https://leetcode.com/articles/search-in-rotated-sorted-array/)|39.1%|
|57|57|[insert-interval](https://leetcode.com/problems/insert-interval)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0057-0057(insert-interval)/insert-interval.java)|[:memo:](https://leetcode.com/articles/insert-intervals/)|39.1%|
|906|874|[walking-robot-simulation](https://leetcode.com/problems/walking-robot-simulation)||[:memo:](https://leetcode.com/articles/walking-robot-simulation/)|39.1%|
|991|954|[array-of-doubled-pairs](https://leetcode.com/problems/array-of-doubled-pairs)||[:memo:](https://leetcode.com/articles/array-of-doubled-pairs/)|39.1%|
|1912|1786|[number-of-restricted-paths-from-first-to-last-node](https://leetcode.com/problems/number-of-restricted-paths-from-first-to-last-node)|||39.1%|
|2661|2598|[smallest-missing-non-negative-integer-after-operations](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations)|||39.1%|
|994|957|[prison-cells-after-n-days](https://leetcode.com/problems/prison-cells-after-n-days)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0994-0957(prison-cells-after-n-days)/prison-cells-after-n-days.java)|[:memo:](https://leetcode.com/articles/prison-cells-after-n-days/)|39.0%|
|1620|1497|[check-if-array-pairs-are-divisible-by-k](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k)|||39.0%|
|2352|2241|[design-an-atm-machine](https://leetcode.com/problems/design-an-atm-machine)|||39.0%|
|55|55|[jump-game](https://leetcode.com/problems/jump-game)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0055-0055(jump-game)/jump-game.java)|[:memo:](https://leetcode.com/articles/jump-game/)|38.9%|
|2017|1888|[minimum-number-of-flips-to-make-the-binary-string-alternating](https://leetcode.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating)|||38.9%|
|2529|2438|[range-product-queries-of-powers](https://leetcode.com/problems/range-product-queries-of-powers)|||38.9%|
|2000|1870|[minimum-speed-to-arrive-on-time](https://leetcode.com/problems/minimum-speed-to-arrive-on-time)|||38.8%|
|467|467|[unique-substrings-in-wraparound-string](https://leetcode.com/problems/unique-substrings-in-wraparound-string)|||38.7%|
|1793|1674|[minimum-moves-to-make-array-complementary](https://leetcode.com/problems/minimum-moves-to-make-array-complementary)|||38.7%|
|310|310|[minimum-height-trees](https://leetcode.com/problems/minimum-height-trees)||[:memo:](https://leetcode.com/articles/minimum-height-trees/)|38.6%|
|870|840|[magic-squares-in-grid](https://leetcode.com/problems/magic-squares-in-grid)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0870-0840(magic-squares-in-grid)/magic-squares-in-grid.java)|[:memo:](https://leetcode.com/articles/magic-squares-in-grid/)|38.6%|
|1294|2080|[range-frequency-queries](https://leetcode.com/problems/range-frequency-queries)|||38.6%|
|2636|2542|[maximum-subsequence-score](https://leetcode.com/problems/maximum-subsequence-score)||[:memo:](https://leetcode.com/articles/maximum-subsequence-score/)|38.5%|
|274|274|[h-index](https://leetcode.com/problems/h-index)||[:memo:](https://leetcode.com/articles/h-index/)|38.4%|
|872|842|[split-array-into-fibonacci-sequence](https://leetcode.com/problems/split-array-into-fibonacci-sequence)||[:memo:](https://leetcode.com/articles/split-array-into-fibonacci-sequence/)|38.4%|
|2520|2434|[using-a-robot-to-print-the-lexicographically-smallest-string](https://leetcode.com/problems/using-a-robot-to-print-the-lexicographically-smallest-string)|||38.4%|
|373|373|[find-k-pairs-with-smallest-sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums)||[:memo:](https://leetcode.com/articles/find-k-pairs-with-smallest-sums/)|38.3%|
|722|722|[remove-comments](https://leetcode.com/problems/remove-comments)||[:memo:](https://leetcode.com/articles/remove-comments/)|38.3%|
|2557|2470|[number-of-subarrays-with-lcm-equal-to-k](https://leetcode.com/problems/number-of-subarrays-with-lcm-equal-to-k)|||38.3%|
|2590|2497|[maximum-star-sum-of-a-graph](https://leetcode.com/problems/maximum-star-sum-of-a-graph)|||38.3%|
|1281|1177|[can-make-palindrome-from-substring](https://leetcode.com/problems/can-make-palindrome-from-substring)|||38.1%|
|1824|1705|[maximum-number-of-eaten-apples](https://leetcode.com/problems/maximum-number-of-eaten-apples)||[:memo:](https://leetcode.com/articles/maximum-number-of-eaten-apples/)|38.0%|
|365|365|[water-and-jug-problem](https://leetcode.com/problems/water-and-jug-problem)|||37.9%|
|1985|1856|[maximum-subarray-min-product](https://leetcode.com/problems/maximum-subarray-min-product)|||37.9%|
|2548|2453|[destroy-sequential-targets](https://leetcode.com/problems/destroy-sequential-targets)|||37.8%|
|31|31|[next-permutation](https://leetcode.com/problems/next-permutation)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0031-0031(next-permutation)/next-permutation.java)|[:memo:](https://leetcode.com/articles/next-permutation/)|37.7%|
|1726|1620|[coordinate-with-maximum-network-quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality)|||37.7%|
|2712|2576|[find-the-maximum-number-of-marked-indices](https://leetcode.com/problems/find-the-maximum-number-of-marked-indices)|||37.7%|
|275|275|[h-index-ii](https://leetcode.com/problems/h-index-ii)||[:memo:](https://leetcode.com/articles/h-index-ii/)|37.6%|
|1776|1658|[minimum-operations-to-reduce-x-to-zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero)||[:memo:](https://leetcode.com/articles/minimum-operations-to-reduce-x-to-zero/)|37.6%|
|2444|2370|[longest-ideal-subsequence](https://leetcode.com/problems/longest-ideal-subsequence)|||37.6%|
|2504|2420|[find-all-good-indices](https://leetcode.com/problems/find-all-good-indices)|||37.6%|
|97|97|[interleaving-string](https://leetcode.com/problems/interleaving-string)||[:memo:](https://leetcode.com/articles/interleaving-strings/)|37.4%|
|355|355|[design-twitter](https://leetcode.com/problems/design-twitter)|||37.4%|
|2049|1921|[eliminate-maximum-number-of-monsters](https://leetcode.com/problems/eliminate-maximum-number-of-monsters)|||37.4%|
|2553|2462|[total-cost-to-hire-k-workers](https://leetcode.com/problems/total-cost-to-hire-k-workers)||[:memo:](https://leetcode.com/articles/total-cost-to-hire-k-workers/)|37.4%|
|934|898|[bitwise-ors-of-subarrays](https://leetcode.com/problems/bitwise-ors-of-subarrays)||[:memo:](https://leetcode.com/articles/bitwise-ors-of-subarrays/)|37.3%|
|1679|1574|[shortest-subarray-to-be-removed-to-make-array-sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted)|||37.3%|
|1695|1589|[maximum-sum-obtained-of-any-permutation](https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation)|||37.3%|
|1351|1234|[replace-the-substring-for-balanced-string](https://leetcode.com/problems/replace-the-substring-for-balanced-string)|||37.2%|
|2011|1881|[maximum-value-after-insertion](https://leetcode.com/problems/maximum-value-after-insertion)|||37.2%|
|803|787|[cheapest-flights-within-k-stops](https://leetcode.com/problems/cheapest-flights-within-k-stops)||[:memo:](https://leetcode.com/articles/cheapest-flights-within-k-stops/)|37.1%|
|1249|1146|[snapshot-array](https://leetcode.com/problems/snapshot-array)|||37.1%|
|385|385|[mini-parser](https://leetcode.com/problems/mini-parser)|||37.0%|
|2249|2145|[count-the-hidden-sequences](https://leetcode.com/problems/count-the-hidden-sequences)|||37.0%|
|2395|2311|[longest-binary-subsequence-less-than-or-equal-to-k](https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k)|||37.0%|
|2610|2523|[closest-prime-numbers-in-range](https://leetcode.com/problems/closest-prime-numbers-in-range)|||37.0%|
|130|130|[surrounded-regions](https://leetcode.com/problems/surrounded-regions)||[:memo:](https://leetcode.com/articles/surrounded-regions/)|36.9%|
|2544|2457|[minimum-addition-to-make-integer-beautiful](https://leetcode.com/problems/minimum-addition-to-make-integer-beautiful)|||36.9%|
|793|777|[swap-adjacent-in-lr-string](https://leetcode.com/problems/swap-adjacent-in-lr-string)||[:memo:](https://leetcode.com/articles/swap-adjacent-in-lr-string/)|36.8%|
|1335|2226|[maximum-candies-allocated-to-k-children](https://leetcode.com/problems/maximum-candies-allocated-to-k-children)|||36.8%|
|2716|2601|[prime-subtraction-operation](https://leetcode.com/problems/prime-subtraction-operation)|||36.8%|
|1573|1477|[find-two-non-overlapping-sub-arrays-each-with-target-sum](https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum)|||36.7%|
|475|475|[heaters](https://leetcode.com/problems/heaters)|||36.6%|
|2124|1997|[first-day-where-you-have-been-in-all-the-rooms](https://leetcode.com/problems/first-day-where-you-have-been-in-all-the-rooms)|||36.5%|
|581|581|[shortest-unsorted-continuous-subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0581-0581(shortest-unsorted-continuous-subarray)/shortest-unsorted-continuous-subarray.java)|[:memo:](https://leetcode.com/articles/shortest-unsorted-continous-subarray/)|36.4%|
|1148|1073|[adding-two-negabinary-numbers](https://leetcode.com/problems/adding-two-negabinary-numbers)|||36.3%|
|372|372|[super-pow](https://leetcode.com/problems/super-pow)|||36.2%|
|867|837|[new-21-game](https://leetcode.com/problems/new-21-game)||[:memo:](https://leetcode.com/articles/new-21-game/)|36.2%|
|1611|1487|[making-file-names-unique](https://leetcode.com/problems/making-file-names-unique)|||36.2%|
|61|61|[rotate-list](https://leetcode.com/problems/rotate-list)||[:memo:](https://leetcode.com/articles/rotate-list/)|36.1%|
|2067|1937|[maximum-number-of-points-with-cost](https://leetcode.com/problems/maximum-number-of-points-with-cost)||[:memo:](https://leetcode.com/articles/maximum-number-of-points-with-cost/)|36.0%|
|18|18|[4sum](https://leetcode.com/problems/4sum)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0018-0018(4sum)/4sum.java)|[:memo:](https://leetcode.com/articles/4sum/)|35.9%|
|165|165|[compare-version-numbers](https://leetcode.com/problems/compare-version-numbers)||[:memo:](https://leetcode.com/articles/compare-version-numbers/)|35.8%|
|81|81|[search-in-rotated-sorted-array-ii](https://leetcode.com/problems/search-in-rotated-sorted-array-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0081-0081(search-in-rotated-sorted-array-ii)/search-in-rotated-sorted-array-ii.java)|[:memo:](https://leetcode.com/articles/search-in-rotated-sorted-array-ii/)|35.7%|
|943|907|[sum-of-subarray-minimums](https://leetcode.com/problems/sum-of-subarray-minimums)||[:memo:](https://leetcode.com/articles/sum-of-subarray-minimums/)|35.7%|
|1859|1737|[change-minimum-characters-to-satisfy-one-of-three-conditions](https://leetcode.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions)|||35.4%|
|2465|2381|[shifting-letters-ii](https://leetcode.com/problems/shifting-letters-ii)|||35.4%|
|946|910|[smallest-range-ii](https://leetcode.com/problems/smallest-range-ii)||[:memo:](https://leetcode.com/articles/smallest-range-ii/)|35.3%|
|397|397|[integer-replacement](https://leetcode.com/problems/integer-replacement)|||35.2%|
|2363|2245|[maximum-trailing-zeros-in-a-cornered-path](https://leetcode.com/problems/maximum-trailing-zeros-in-a-cornered-path)|||35.2%|
|986|949|[largest-time-for-given-digits](https://leetcode.com/problems/largest-time-for-given-digits)||[:memo:](https://leetcode.com/articles/largest-time-for-given-digits/)|35.1%|
|810|794|[valid-tic-tac-toe-state](https://leetcode.com/problems/valid-tic-tac-toe-state)||[:memo:](https://leetcode.com/articles/valid-tic-tac-toe-state/)|35.0%|
|2651|2580|[count-ways-to-group-overlapping-ranges](https://leetcode.com/problems/count-ways-to-group-overlapping-ranges)|||35.0%|
|2753|2654|[minimum-number-of-operations-to-make-all-array-elements-equal-to-1](https://leetcode.com/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1)|||35.0%|
|152|152|[maximum-product-subarray](https://leetcode.com/problems/maximum-product-subarray)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0152-0152(maximum-product-subarray)/maximum-product-subarray.java)|[:memo:](https://leetcode.com/articles/maximum-product-subarray/)|34.9%|
|2077|1946|[largest-number-after-mutating-substring](https://leetcode.com/problems/largest-number-after-mutating-substring)|||34.9%|
|2718|2602|[minimum-operations-to-make-all-array-elements-equal](https://leetcode.com/problems/minimum-operations-to-make-all-array-elements-equal)|||34.8%|
|179|179|[largest-number](https://leetcode.com/problems/largest-number)||[:memo:](https://leetcode.com/articles/largest-number/)|34.7%|
|992|955|[delete-columns-to-make-sorted-ii](https://leetcode.com/problems/delete-columns-to-make-sorted-ii)||[:memo:](https://leetcode.com/articles/delete-columns-to-make-sorted-ii/)|34.7%|
|1219|1124|[longest-well-performing-interval](https://leetcode.com/problems/longest-well-performing-interval)|||34.6%|
|2429|2353|[design-a-food-rating-system](https://leetcode.com/problems/design-a-food-rating-system)|||34.6%|
|2552|2461|[maximum-sum-of-distinct-subarrays-with-length-k](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k)|||34.4%|
|633|633|[sum-of-square-numbers](https://leetcode.com/problems/sum-of-square-numbers)||[:memo:](https://leetcode.com/articles/sum-of-square-numbers/)|34.3%|
|2100|1969|[minimum-non-zero-product-of-the-array-elements](https://leetcode.com/problems/minimum-non-zero-product-of-the-array-elements)|||34.3%|
|400|400|[nth-digit](https://leetcode.com/problems/nth-digit)|||34.2%|
|686|686|[repeated-string-match](https://leetcode.com/problems/repeated-string-match)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0686-0686(repeated-string-match)/repeated-string-match.java)|[:memo:](https://leetcode.com/articles/repeated-string-match/)|34.2%|
|678|678|[valid-parenthesis-string](https://leetcode.com/problems/valid-parenthesis-string)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0678-0678(valid-parenthesis-string)/valid-parenthesis-string.java)|[:memo:](https://leetcode.com/articles/valid-parenthesis-string/)|34.1%|
|2333|2250|[count-number-of-rectangles-containing-each-point](https://leetcode.com/problems/count-number-of-rectangles-containing-each-point)|||34.1%|
|556|556|[next-greater-element-iii](https://leetcode.com/problems/next-greater-element-iii)||[:memo:](https://leetcode.com/articles/next-greater-element-iii/)|34.0%|
|1375|2217|[find-palindrome-with-fixed-length](https://leetcode.com/problems/find-palindrome-with-fixed-length)|||33.9%|
|2599|2516|[take-k-of-each-character-from-left-and-right](https://leetcode.com/problems/take-k-of-each-character-from-left-and-right)|||33.9%|
|3|3|[longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)||[:memo:](https://leetcode.com/articles/longest-substring-without-repeating-characters/)|33.8%|
|2700|2564|[substring-xor-queries](https://leetcode.com/problems/substring-xor-queries)|||33.6%|
|1647|1540|[can-convert-string-in-k-moves](https://leetcode.com/problems/can-convert-string-in-k-moves)|||33.5%|
|324|324|[wiggle-sort-ii](https://leetcode.com/problems/wiggle-sort-ii)|||33.4%|
|1976|1849|[splitting-a-string-into-descending-consecutive-values](https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values)|||33.4%|
|2309|2207|[maximize-number-of-subsequences-in-a-string](https://leetcode.com/problems/maximize-number-of-subsequences-in-a-string)|||33.4%|
|50|50|[powx-n](https://leetcode.com/problems/powx-n)||[:memo:](https://leetcode.com/articles/powx-n/)|33.1%|
|151|151|[reverse-words-in-a-string](https://leetcode.com/problems/reverse-words-in-a-string)||[:memo:](https://leetcode.com/articles/reverse-words-in-a-string/)|33.1%|
|204|204|[count-primes](https://leetcode.com/problems/count-primes)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0204-0204(count-primes)/count-primes.java)|[:memo:](https://leetcode.com/articles/count-primes/)|33.1%|
|1716|1594|[maximum-non-negative-product-in-a-matrix](https://leetcode.com/problems/maximum-non-negative-product-in-a-matrix)|||33.1%|
|1872|1744|[can-you-eat-your-favorite-candy-on-your-favorite-day](https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day)|||33.1%|
|1923|1813|[sentence-similarity-iii](https://leetcode.com/problems/sentence-similarity-iii)|||33.1%|
|2289|2170|[minimum-operations-to-make-the-array-alternating](https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating)|||33.1%|
|2477|2400|[number-of-ways-to-reach-a-position-after-exactly-k-steps](https://leetcode.com/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps)|||33.1%|
|2359|2271|[maximum-white-tiles-covered-by-a-carpet](https://leetcode.com/problems/maximum-white-tiles-covered-by-a-carpet)|||33.0%|
|2114|1986|[minimum-number-of-work-sessions-to-finish-the-tasks](https://leetcode.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks)|||32.9%|
|91|91|[decode-ways](https://leetcode.com/problems/decode-ways)||[:memo:](https://leetcode.com/articles/decode-ways/)|32.8%|
|15|15|[3sum](https://leetcode.com/problems/3sum)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0015-0015(3sum)/3sum.java)|[:memo:](https://leetcode.com/articles/3sum/)|32.7%|
|457|457|[circular-array-loop](https://leetcode.com/problems/circular-array-loop)|||32.7%|
|1831|1712|[ways-to-split-array-into-three-subarrays](https://leetcode.com/problems/ways-to-split-array-into-three-subarrays)||[:memo:](https://leetcode.com/articles/ways-to-split-array-into-three-subarrays/)|32.7%|
|2670|2607|[make-k-subarray-sums-equal](https://leetcode.com/problems/make-k-subarray-sums-equal)|||32.6%|
|1478|1353|[maximum-number-of-events-that-can-be-attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended)|||32.5%|
|1678|1573|[number-of-ways-to-split-a-string](https://leetcode.com/problems/number-of-ways-to-split-a-string)|||32.5%|
|5|5|[longest-palindromic-substring](https://leetcode.com/problems/longest-palindromic-substring)||[:memo:](https://leetcode.com/articles/longest-palindromic-substring/)|32.4%|
|456|456|[132-pattern](https://leetcode.com/problems/132-pattern)||[:memo:](https://leetcode.com/articles/132-pattern/)|32.4%|
|1929|1802|[maximum-value-at-a-given-index-in-a-bounded-array](https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array)||[:memo:](https://leetcode.com/articles/maximum-value-at-a-given-index-in-a-bounded-array/)|32.4%|
|2108|1981|[minimize-the-difference-between-target-and-chosen-elements](https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements)|||32.4%|
|2686|2662|[minimum-cost-of-a-path-with-special-roads](https://leetcode.com/problems/minimum-cost-of-a-path-with-special-roads)|||32.2%|
|2699|2563|[count-the-number-of-fair-pairs](https://leetcode.com/problems/count-the-number-of-fair-pairs)|||32.2%|
|98|98|[validate-binary-search-tree](https://leetcode.com/problems/validate-binary-search-tree)||[:memo:](https://leetcode.com/articles/validate-binary-search-tree/)|32.0%|
|2285|2166|[design-bitset](https://leetcode.com/problems/design-bitset)|||31.7%|
|2475|2384|[largest-palindromic-number](https://leetcode.com/problems/largest-palindromic-number)|||31.4%|
|2713|2575|[find-the-divisibility-array-of-a-string](https://leetcode.com/problems/find-the-divisibility-array-of-a-string)|||31.3%|
|1272|1169|[invalid-transactions](https://leetcode.com/problems/invalid-transactions)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/1272-1169(invalid-transactions)/invalid-transactions.java)||31.2%|
|1739|1616|[split-two-strings-to-make-palindrome](https://leetcode.com/problems/split-two-strings-to-make-palindrome)|||31.2%|
|306|306|[additive-number](https://leetcode.com/problems/additive-number)|||31.1%|
|2604|2541|[minimum-operations-to-make-array-equal-ii](https://leetcode.com/problems/minimum-operations-to-make-array-equal-ii)|||31.0%|
|2221|2116|[check-if-a-parentheses-string-can-be-valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid)|||30.9%|
|2673|2555|[maximize-win-from-two-segments](https://leetcode.com/problems/maximize-win-from-two-segments)|||30.9%|
|402|402|[remove-k-digits](https://leetcode.com/problems/remove-k-digits)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0402-0402(remove-k-digits)/remove-k-digits.java)|[:memo:](https://leetcode.com/articles/remove-k-digits/)|30.6%|
|2090|1976|[number-of-ways-to-arrive-at-destination](https://leetcode.com/problems/number-of-ways-to-arrive-at-destination)|||30.6%|
|1946|1818|[minimum-absolute-sum-difference](https://leetcode.com/problems/minimum-absolute-sum-difference)|||30.5%|
|2751|2653|[sliding-subarray-beauty](https://leetcode.com/problems/sliding-subarray-beauty)|||30.5%|
|1771|1648|[sell-diminishing-valued-colored-balls](https://leetcode.com/problems/sell-diminishing-valued-colored-balls)|||30.4%|
|2720|2616|[minimize-the-maximum-difference-of-pairs](https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs)|||30.1%|
|464|464|[can-i-win](https://leetcode.com/problems/can-i-win)|||29.7%|
|2721|2615|[sum-of-distances](https://leetcode.com/problems/sum-of-distances)|||29.4%|
|1830|1711|[count-good-meals](https://leetcode.com/problems/count-good-meals)|||29.3%|
|1757|1654|[minimum-jumps-to-reach-home](https://leetcode.com/problems/minimum-jumps-to-reach-home)|||29.2%|
|2696|2597|[the-number-of-beautiful-subsets](https://leetcode.com/problems/the-number-of-beautiful-subsets)|||29.2%|
|1307|1201|[ugly-number-iii](https://leetcode.com/problems/ugly-number-iii)|||28.9%|
|523|523|[continuous-subarray-sum](https://leetcode.com/problems/continuous-subarray-sum)||[:memo:](https://leetcode.com/articles/continuous-subarray-sum/)|28.5%|
|916|880|[decoded-string-at-index](https://leetcode.com/problems/decoded-string-at-index)||[:memo:](https://leetcode.com/articles/decoded-string-at-index/)|28.3%|
|2641|2556|[disconnect-path-in-a-binary-matrix-by-at-most-one-flip](https://leetcode.com/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip)|||28.2%|
|2373|2288|[apply-discount-to-prices](https://leetcode.com/problems/apply-discount-to-prices)|||28.1%|
|1694|1590|[make-sum-divisible-by-p](https://leetcode.com/problems/make-sum-divisible-by-p)|||27.9%|
|838|707|[design-linked-list](https://leetcode.com/problems/design-linked-list)||[:memo:](https://leetcode.com/articles/design-linked-list/)|27.7%|
|7|7|[reverse-integer](https://leetcode.com/problems/reverse-integer)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0007-0007(reverse-integer)/reverse-integer.java)|[:memo:](https://leetcode.com/articles/reverse-integer/)|27.5%|
|2156|2029|[stone-game-ix](https://leetcode.com/problems/stone-game-ix)|||26.7%|
|468|468|[validate-ip-address](https://leetcode.com/problems/validate-ip-address)||[:memo:](https://leetcode.com/articles/validate-ip-address/)|26.6%|
|2680|2550|[count-collisions-of-monkeys-on-a-polygon](https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon)|||26.6%|
|1612|1488|[avoid-flood-in-the-city](https://leetcode.com/problems/avoid-flood-in-the-city)|||26.5%|
|2628|2513|[minimize-the-maximum-of-two-arrays](https://leetcode.com/problems/minimize-the-maximum-of-two-arrays)|||26.5%|
|1334|2310|[sum-of-numbers-with-units-digit-k](https://leetcode.com/problems/sum-of-numbers-with-units-digit-k)|||25.8%|
|897|866|[prime-palindrome](https://leetcode.com/problems/prime-palindrome)||[:memo:](https://leetcode.com/articles/prime-palindrome/)|25.7%|
|2615|2531|[make-number-of-distinct-characters-equal](https://leetcode.com/problems/make-number-of-distinct-characters-equal)|||25.6%|
|2418|2333|[minimum-sum-of-squared-difference](https://leetcode.com/problems/minimum-sum-of-squared-difference)|||25.4%|
|2778|2671|[frequency-tracker](https://leetcode.com/problems/frequency-tracker)|||25.3%|
|2305|2195|[append-k-integers-with-minimal-sum](https://leetcode.com/problems/append-k-integers-with-minimal-sum)|||25.0%|
|2001|1871|[jump-game-vii](https://leetcode.com/problems/jump-game-vii)|||24.9%|
|2367|2280|[minimum-lines-to-represent-a-line-chart](https://leetcode.com/problems/minimum-lines-to-represent-a-line-chart)|||24.6%|
|166|166|[fraction-to-recurring-decimal](https://leetcode.com/problems/fraction-to-recurring-decimal)||[:memo:](https://leetcode.com/articles/fraction-to-recurring-decimal/)|24.4%|
|665|665|[non-decreasing-array](https://leetcode.com/problems/non-decreasing-array)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0665-0665(non-decreasing-array)/non-decreasing-array.java)|[:memo:](https://leetcode.com/articles/non-decreasing-array/)|24.3%|
|2417|2332|[the-latest-time-to-catch-a-bus](https://leetcode.com/problems/the-latest-time-to-catch-a-bus)|||23.8%|
|1299|1191|[k-concatenation-maximum-sum](https://leetcode.com/problems/k-concatenation-maximum-sum)|||23.7%|
|2178|2069|[walking-robot-simulation-ii](https://leetcode.com/problems/walking-robot-simulation-ii)|||23.6%|
|1346|2202|[maximize-the-topmost-element-after-k-moves](https://leetcode.com/problems/maximize-the-topmost-element-after-k-moves)|||22.8%|
|2374|2289|[steps-to-make-array-non-decreasing](https://leetcode.com/problems/steps-to-make-array-non-decreasing)|||20.9%|
|2709|2572|[count-the-number-of-square-free-subsets](https://leetcode.com/problems/count-the-number-of-square-free-subsets)|||20.9%|
|29|29|[divide-two-integers](https://leetcode.com/problems/divide-two-integers)||[:memo:](https://leetcode.com/articles/divide-integers/)|17.1%|
|8|8|[string-to-integer-atoi](https://leetcode.com/problems/string-to-integer-atoi)||[:memo:](https://leetcode.com/articles/string-to-integer/)|16.6%|
|1022|980|[unique-paths-iii](https://leetcode.com/problems/unique-paths-iii)||[:memo:](https://leetcode.com/articles/unique-paths-iii/)|81.7%|
|1503|1402|[reducing-dishes](https://leetcode.com/problems/reducing-dishes)||[:memo:](https://leetcode.com/articles/reducing-dishes/)|76.8%|
|1093|1028|[recover-a-tree-from-preorder-traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal)|||73.2%|
|2257|2136|[earliest-possible-day-of-full-bloom](https://leetcode.com/problems/earliest-possible-day-of-full-bloom)||[:memo:](https://leetcode.com/articles/earliest-possible-day-of-full-bloom/)|73.1%|
|1381|1255|[maximum-score-words-formed-by-letters](https://leetcode.com/problems/maximum-score-words-formed-by-letters)|||72.3%|
|1409|1284|[minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix](https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix)||[:memo:](https://leetcode.com/articles/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/)|71.9%|
|52|52|[n-queens-ii](https://leetcode.com/problems/n-queens-ii)||[:memo:](https://leetcode.com/articles/n-queens-ii/)|71.7%|
|732|732|[my-calendar-iii](https://leetcode.com/problems/my-calendar-iii)||[:memo:](https://leetcode.com/articles/my-calendar-iii/)|71.6%|
|1145|1074|[number-of-submatrices-that-sum-to-target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target)||[:memo:](https://leetcode.com/articles/number-of-submatrices-that-sum-to-target/)|69.5%|
|1559|1463|[cherry-pickup-ii](https://leetcode.com/problems/cherry-pickup-ii)||[:memo:](https://leetcode.com/articles/cherry-pickup-ii/)|69.5%|
|1437|1312|[minimum-insertion-steps-to-make-a-string-palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome)||[:memo:](https://leetcode.com/articles/minimum-insertion-steps-to-make-a-string-palindrome/)|69.0%|
|1305|1944|[number-of-visible-people-in-a-queue](https://leetcode.com/problems/number-of-visible-people-in-a-queue)|||68.9%|
|1633|1526|[minimum-number-of-increments-on-subarrays-to-form-a-target-array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array)|||68.9%|
|2435|2350|[shortest-impossible-sequence-of-rolls](https://leetcode.com/problems/shortest-impossible-sequence-of-rolls)|||68.0%|
|931|895|[maximum-frequency-stack](https://leetcode.com/problems/maximum-frequency-stack)||[:memo:](https://leetcode.com/articles/maximum-frequency-stack/)|66.6%|
|935|899|[orderly-queue](https://leetcode.com/problems/orderly-queue)||[:memo:](https://leetcode.com/articles/orderly-queue/)|66.2%|
|1740|1617|[count-subtrees-with-max-distance-between-cities](https://leetcode.com/problems/count-subtrees-with-max-distance-between-cities)|||65.8%|
|2207|2102|[sequentially-ordinal-rank-tracker](https://leetcode.com/problems/sequentially-ordinal-rank-tracker)|||65.6%|
|1701|1579|[remove-max-number-of-edges-to-keep-graph-fully-traversable](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable)||[:memo:](https://leetcode.com/articles/remove-max-number-of-edges-to-keep-graph-fully-traversable/)|65.5%|
|51|51|[n-queens](https://leetcode.com/problems/n-queens)||[:memo:](https://leetcode.com/articles/n-queens/)|64.4%|
|787|773|[sliding-puzzle](https://leetcode.com/problems/sliding-puzzle)||[:memo:](https://leetcode.com/articles/sliding-puzzle/)|64.1%|
|1555|1444|[number-of-ways-of-cutting-a-pizza](https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza)||[:memo:](https://leetcode.com/articles/number-of-ways-of-cutting-a-pizza/)|63.8%|
|1188|1096|[brace-expansion-ii](https://leetcode.com/problems/brace-expansion-ii)|||63.5%|
|2539|2449|[minimum-number-of-operations-to-make-arrays-similar](https://leetcode.com/problems/minimum-number-of-operations-to-make-arrays-similar)|||63.4%|
|1732|1611|[minimum-one-bit-operations-to-make-integers-zero](https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero)|||63.3%|
|1815|1697|[checking-existence-of-edge-length-limited-paths](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths)||[:memo:](https://leetcode.com/articles/checking-existence-of-edge-length-limited-paths/)|63.1%|
|2193|2088|[count-fertile-pyramids-in-a-land](https://leetcode.com/problems/count-fertile-pyramids-in-a-land)|||63.0%|
|1535|1420|[build-array-where-you-can-find-the-maximum-exactly-k-comparisons](https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons)|||62.9%|
|973|936|[stamping-the-sequence](https://leetcode.com/problems/stamping-the-sequence)||[:memo:](https://leetcode.com/articles/stamping-the-sequence/)|62.8%|
|458|458|[poor-pigs](https://leetcode.com/problems/poor-pigs)||[:memo:](https://leetcode.com/articles/poor-pigs/)|62.6%|
|1527|1411|[number-of-ways-to-paint-n-3-grid](https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid)|||62.6%|
|1461|1359|[count-all-valid-pickup-and-delivery-options](https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options)||[:memo:](https://leetcode.com/articles/count-all-valid-pickup-and-delivery-options/)|62.4%|
|1466|1340|[jump-game-v](https://leetcode.com/problems/jump-game-v)|||62.3%|
|2527|2444|[count-subarrays-with-fixed-bounds](https://leetcode.com/problems/count-subarrays-with-fixed-bounds)||[:memo:](https://leetcode.com/articles/count-subarrays-with-fixed-bounds/)|61.9%|
|1393|2218|[maximum-value-of-k-coins-from-piles](https://leetcode.com/problems/maximum-value-of-k-coins-from-piles)||[:memo:](https://leetcode.com/articles/maximum-value-of-k-coins-from-piles/)|61.8%|
|1485|1368|[minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid)|||61.6%|
|1550|1439|[find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows)|||61.5%|
|1583|1473|[paint-house-iii](https://leetcode.com/problems/paint-house-iii)||[:memo:](https://leetcode.com/articles/paint-house-iii/)|61.5%|
|632|632|[smallest-range-covering-elements-from-k-lists](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists)||[:memo:](https://leetcode.com/articles/smallest-range/)|61.1%|
|877|847|[shortest-path-visiting-all-nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes)||[:memo:](https://leetcode.com/articles/shortest-path-visiting-all-nodes/)|60.8%|
|1403|1278|[palindrome-partitioning-iii](https://leetcode.com/problems/palindrome-partitioning-iii)|||60.8%|
|1337|1206|[design-skiplist](https://leetcode.com/problems/design-skiplist)|||60.5%|
|1963|1835|[find-xor-sum-of-all-pairs-bitwise-and](https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and)|||60.5%|
|1577|1467|[probability-of-a-two-boxes-having-the-same-number-of-distinct-balls](https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls)|||60.4%|
|763|761|[special-binary-string](https://leetcode.com/problems/special-binary-string)||[:memo:](https://leetcode.com/articles/special-binary-string/)|60.3%|
|1332|1220|[count-vowels-permutation](https://leetcode.com/problems/count-vowels-permutation)||[:memo:](https://leetcode.com/articles/count-vowels-permutation/)|60.1%|
|1617|1510|[stone-game-iv](https://leetcode.com/problems/stone-game-iv)||[:memo:](https://leetcode.com/articles/stone-game-iv/)|60.1%|
|794|778|[swim-in-rising-water](https://leetcode.com/problems/swim-in-rising-water)||[:memo:](https://leetcode.com/articles/swim-in-rising-water/)|59.8%|
|352|352|[data-stream-as-disjoint-intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals)||[:memo:](https://leetcode.com/articles/data-stream-as-disjoint-intervals/)|59.7%|
|1424|1298|[maximum-candies-you-can-get-from-boxes](https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes)|||59.7%|
|2472|2392|[build-a-matrix-with-conditions](https://leetcode.com/problems/build-a-matrix-with-conditions)|||59.5%|
|1443|1320|[minimum-distance-to-type-a-word-using-two-fingers](https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers)|||59.4%|
|1522|1406|[stone-game-iii](https://leetcode.com/problems/stone-game-iii)||[:memo:](https://leetcode.com/articles/stone-game-iii/)|59.4%|
|42|42|[trapping-rain-water](https://leetcode.com/problems/trapping-rain-water)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0042-0042(trapping-rain-water)/trapping-rain-water.java)|[:memo:](https://leetcode.com/articles/trapping-rain-water/)|59.3%|
|2648|2585|[number-of-ways-to-earn-points](https://leetcode.com/problems/number-of-ways-to-earn-points)|||59.2%|
|863|834|[sum-of-distances-in-tree](https://leetcode.com/problems/sum-of-distances-in-tree)||[:memo:](https://leetcode.com/articles/sum-of-distances-in-tree/)|59.1%|
|1251|1147|[longest-chunked-palindrome-decomposition](https://leetcode.com/problems/longest-chunked-palindrome-decomposition)|||59.1%|
|2176|2050|[parallel-courses-iii](https://leetcode.com/problems/parallel-courses-iii)|||59.1%|
|1372|1250|[check-if-it-is-a-good-array](https://leetcode.com/problems/check-if-it-is-a-good-array)|||58.9%|
|2096|1964|[find-the-longest-valid-obstacle-course-at-each-position](https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position)||[:memo:](https://leetcode.com/articles/find-the-longest-valid-obstacle-course-at-each-position/)|58.9%|
|1696|1591|[strange-printer-ii](https://leetcode.com/problems/strange-printer-ii)|||58.6%|
|1197|1106|[parsing-a-boolean-expression](https://leetcode.com/problems/parsing-a-boolean-expression)|||58.4%|
|1224|1289|[minimum-falling-path-sum-ii](https://leetcode.com/problems/minimum-falling-path-sum-ii)|||58.4%|
|1457|1335|[minimum-difficulty-of-a-job-schedule](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule)||[:memo:](https://leetcode.com/articles/minimum-difficulty-of-a-job-schedule/)|58.4%|
|1170|1092|[shortest-common-supersequence](https://leetcode.com/problems/shortest-common-supersequence)|||58.0%|
|37|37|[sudoku-solver](https://leetcode.com/problems/sudoku-solver)||[:memo:](https://leetcode.com/articles/sudoku-solver/)|57.9%|
|939|903|[valid-permutations-for-di-sequence](https://leetcode.com/problems/valid-permutations-for-di-sequence)||[:memo:](https://leetcode.com/articles/valid-permutations-for-di-sequence/)|57.6%|
|1024|982|[triples-with-bitwise-and-equal-to-zero](https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero)|||57.5%|
|2505|2421|[number-of-good-paths](https://leetcode.com/problems/number-of-good-paths)||[:memo:](https://leetcode.com/articles/number-of-good-paths/)|57.3%|
|1000|960|[delete-columns-to-make-sorted-iii](https://leetcode.com/problems/delete-columns-to-make-sorted-iii)||[:memo:](https://leetcode.com/articles/delete-columns-to-make-sorted-iii/)|57.2%|
|1851|1751|[maximum-number-of-events-that-can-be-attended-ii](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii)|||57.2%|
|2061|1931|[painting-a-grid-with-three-different-colors](https://leetcode.com/problems/painting-a-grid-with-three-different-colors)|||57.2%|
|312|312|[burst-balloons](https://leetcode.com/problems/burst-balloons)||[:memo:](https://leetcode.com/articles/burst-balloons/)|57.1%|
|1669|1547|[minimum-cost-to-cut-a-stick](https://leetcode.com/problems/minimum-cost-to-cut-a-stick)||[:memo:](https://leetcode.com/articles/minimum-cost-to-cut-a-stick/)|56.9%|
|1680|1575|[count-all-possible-routes](https://leetcode.com/problems/count-all-possible-routes)||[:memo:](https://leetcode.com/articles/count-all-possible-routes/)|56.8%|
|2189|2065|[maximum-path-quality-of-a-graph](https://leetcode.com/problems/maximum-path-quality-of-a-graph)|||56.8%|
|2597|2509|[cycle-length-queries-in-a-tree](https://leetcode.com/problems/cycle-length-queries-in-a-tree)|||56.7%|
|2678|2642|[design-graph-with-shortest-path-calculator](https://leetcode.com/problems/design-graph-with-shortest-path-calculator)|||56.7%|
|770|765|[couples-holding-hands](https://leetcode.com/problems/couples-holding-hands)||[:memo:](https://leetcode.com/articles/couples-holding-hands/)|56.6%|
|2423|2344|[minimum-deletions-to-make-array-divisible](https://leetcode.com/problems/minimum-deletions-to-make-array-divisible)|||56.6%|
|1784|1665|[minimum-initial-energy-to-finish-tasks](https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks)|||56.4%|
|2340|2262|[total-appeal-of-a-string](https://leetcode.com/problems/total-appeal-of-a-string)|||56.4%|
|2079|1948|[delete-duplicate-folders-in-system](https://leetcode.com/problems/delete-duplicate-folders-in-system)|||56.2%|
|828|810|[chalkboard-xor-game](https://leetcode.com/problems/chalkboard-xor-game)||[:memo:](https://leetcode.com/articles/chalkboard-xor-game/)|56.1%|
|2404|2318|[number-of-distinct-roll-sequences](https://leetcode.com/problems/number-of-distinct-roll-sequences)|||56.1%|
|754|753|[cracking-the-safe](https://leetcode.com/problems/cracking-the-safe)||[:memo:](https://leetcode.com/articles/cracking-the-safe/)|55.9%|
|1348|2321|[maximum-score-of-spliced-array](https://leetcode.com/problems/maximum-score-of-spliced-array)|||55.8%|
|1996|1866|[number-of-ways-to-rearrange-sticks-with-k-sticks-visible](https://leetcode.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible)|||55.8%|
|1571|1478|[allocate-mailboxes](https://leetcode.com/problems/allocate-mailboxes)|||55.6%|
|2364|2246|[longest-path-with-different-adjacent-characters](https://leetcode.com/problems/longest-path-with-different-adjacent-characters)||[:memo:](https://leetcode.com/articles/longest-path-with-different-adjacent-characters/)|55.6%|
|297|297|[serialize-and-deserialize-binary-tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree)||[:memo:](https://leetcode.com/articles/serialize-and-deserialize-binary-tree/)|55.5%|
|2140|2014|[longest-subsequence-repeated-k-times](https://leetcode.com/problems/longest-subsequence-repeated-k-times)|||55.4%|
|781|770|[basic-calculator-iv](https://leetcode.com/problems/basic-calculator-iv)||[:memo:](https://leetcode.com/articles/basic-calculator-iv/)|55.3%|
|25|25|[reverse-nodes-in-k-group](https://leetcode.com/problems/reverse-nodes-in-k-group)||[:memo:](https://leetcode.com/articles/reverse-nodes-in-k-group/)|54.9%|
|2166|2056|[number-of-valid-move-combinations-on-chessboard](https://leetcode.com/problems/number-of-valid-move-combinations-on-chessboard)|||54.9%|
|1034|992|[subarrays-with-k-different-integers](https://leetcode.com/problems/subarrays-with-k-different-integers)||[:memo:](https://leetcode.com/articles/subarrays-with-k-different-integers/)|54.7%|
|1300|1192|[critical-connections-in-a-network](https://leetcode.com/problems/critical-connections-in-a-network)||[:memo:](https://leetcode.com/articles/critical-connections-in-a-network/)|54.7%|
|1367|1691|[maximum-height-by-stacking-cuboids](https://leetcode.com/problems/maximum-height-by-stacking-cuboids)|||54.7%|
|72|72|[edit-distance](https://leetcode.com/problems/edit-distance)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0072-0072(edit-distance)/edit-distance.java)|[:memo:](https://leetcode.com/articles/edit-distance/)|54.5%|
|1794|1675|[minimize-deviation-in-array](https://leetcode.com/problems/minimize-deviation-in-array)||[:memo:](https://leetcode.com/articles/minimize-deviation-in-array/)|54.5%|
|869|839|[similar-string-groups](https://leetcode.com/problems/similar-string-groups)||[:memo:](https://leetcode.com/articles/similar-string-groups/)|54.4%|
|1361|1240|[tiling-a-rectangle-with-the-fewest-squares](https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares)|||54.0%|
|1744|1639|[number-of-ways-to-form-a-target-string-given-a-dictionary](https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary)||[:memo:](https://leetcode.com/articles/number-of-ways-to-form-a-target-string-given-a-dictionary/)|54.0%|
|880|850|[rectangle-area-ii](https://leetcode.com/problems/rectangle-area-ii)||[:memo:](https://leetcode.com/articles/rectangle-area-ii/)|53.9%|
|2008|1896|[minimum-cost-to-change-the-final-value-of-expression](https://leetcode.com/problems/minimum-cost-to-change-the-final-value-of-expression)|||53.9%|
|2531|2440|[create-components-with-same-value](https://leetcode.com/problems/create-components-with-same-value)|||53.8%|
|1918|1793|[maximum-score-of-a-good-subarray](https://leetcode.com/problems/maximum-score-of-a-good-subarray)|||53.6%|
|410|410|[split-array-largest-sum](https://leetcode.com/problems/split-array-largest-sum)||[:memo:](https://leetcode.com/articles/split-array-largest-sum/)|53.5%|
|1902|1776|[car-fleet-ii](https://leetcode.com/problems/car-fleet-ii)|||53.5%|
|1352|1235|[maximum-profit-in-job-scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling)||[:memo:](https://leetcode.com/articles/maximum-profit-in-job-scheduling/)|53.4%|
|2198|2076|[process-restricted-friend-requests](https://leetcode.com/problems/process-restricted-friend-requests)|||53.2%|
|779|768|[max-chunks-to-make-sorted-ii](https://leetcode.com/problems/max-chunks-to-make-sorted-ii)||[:memo:](https://leetcode.com/articles/max-chunks-to-make-sorted-ii/)|52.8%|
|2002|1872|[stone-game-viii](https://leetcode.com/problems/stone-game-viii)|||52.6%|
|329|329|[longest-increasing-path-in-a-matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix)||[:memo:](https://leetcode.com/articles/longest-increasing-path-in-a-matrix/)|52.5%|
|2681|2551|[put-marbles-in-bags](https://leetcode.com/problems/put-marbles-in-bags)||[:memo:](https://leetcode.com/articles/put-marbles-in-bags/)|52.5%|
|1613|1489|[find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree)|||52.4%|
|2394|2302|[count-subarrays-with-score-less-than-k](https://leetcode.com/problems/count-subarrays-with-score-less-than-k)|||52.3%|
|726|726|[number-of-atoms](https://leetcode.com/problems/number-of-atoms)||[:memo:](https://leetcode.com/articles/number-of-atoms/)|52.2%|
|887|857|[minimum-cost-to-hire-k-workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers)||[:memo:](https://leetcode.com/articles/minimum-cost-to-hire-k-workers/)|52.2%|
|1986|1857|[largest-color-value-in-a-directed-graph](https://leetcode.com/problems/largest-color-value-in-a-directed-graph)||[:memo:](https://leetcode.com/articles/largest-color-value-in-a-directed-graph/)|52.2%|
|587|587|[erect-the-fence](https://leetcode.com/problems/erect-the-fence)||[:memo:](https://leetcode.com/articles/erect-the-fence/)|52.1%|
|2642|2532|[time-to-cross-a-bridge](https://leetcode.com/problems/time-to-cross-a-bridge)|||52.1%|
|1861|1739|[building-boxes](https://leetcode.com/problems/building-boxes)|||52.0%|
|2115|1987|[number-of-unique-good-subsequences](https://leetcode.com/problems/number-of-unique-good-subsequences)|||51.9%|
|736|736|[parse-lisp-expression](https://leetcode.com/problems/parse-lisp-expression)||[:memo:](https://leetcode.com/articles/parse-lisp-expression/)|51.6%|
|855|828|[count-unique-characters-of-all-substrings-of-a-given-string](https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string)||[:memo:](https://leetcode.com/articles/unique-letter-string/)|51.6%|
|1097|1032|[stream-of-characters](https://leetcode.com/problems/stream-of-characters)||[:memo:](https://leetcode.com/articles/stream-of-characters/)|51.6%|
|798|782|[transform-to-chessboard](https://leetcode.com/problems/transform-to-chessboard)||[:memo:](https://leetcode.com/articles/transform-to-chessboard/)|51.5%|
|295|295|[find-median-from-data-stream](https://leetcode.com/problems/find-median-from-data-stream)||[:memo:](https://leetcode.com/articles/find-median-from-data-stream/)|51.4%|
|668|668|[kth-smallest-number-in-multiplication-table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table)||[:memo:](https://leetcode.com/articles/kth-smallest-number-in-multiplication-table/)|51.4%|
|1356|2193|[minimum-number-of-moves-to-make-palindrome](https://leetcode.com/problems/minimum-number-of-moves-to-make-palindrome)|||51.2%|
|1037|995|[minimum-number-of-k-consecutive-bit-flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips)||[:memo:](https://leetcode.com/articles/minimum-number-of-k-consecutive-bit-flips/)|51.1%|
|1309|1203|[sort-items-by-groups-respecting-dependencies](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies)|||51.1%|
|1723|1601|[maximum-number-of-achievable-transfer-requests](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests)|||51.1%|
|2334|2251|[number-of-flowers-in-full-bloom](https://leetcode.com/problems/number-of-flowers-in-full-bloom)|||51.1%|
|2086|1955|[count-number-of-special-subsequences](https://leetcode.com/problems/count-number-of-special-subsequences)|||51.0%|
|750|749|[contain-virus](https://leetcode.com/problems/contain-virus)||[:memo:](https://leetcode.com/articles/contain-virus/)|50.9%|
|956|920|[number-of-music-playlists](https://leetcode.com/problems/number-of-music-playlists)||[:memo:](https://leetcode.com/articles/number-of-music-playlists/)|50.7%|
|2400|2322|[minimum-score-after-removals-on-a-tree](https://leetcode.com/problems/minimum-score-after-removals-on-a-tree)|||50.7%|
|2439|2360|[longest-cycle-in-a-graph](https://leetcode.com/problems/longest-cycle-in-a-graph)||[:memo:](https://leetcode.com/articles/longest-cycle-in-a-graph/)|50.7%|
|2028|1900|[the-earliest-and-latest-rounds-where-players-compete](https://leetcode.com/problems/the-earliest-and-latest-rounds-where-players-compete)|||50.6%|
|814|798|[smallest-rotation-with-highest-score](https://leetcode.com/problems/smallest-rotation-with-highest-score)||[:memo:](https://leetcode.com/articles/smallest-rotation-with-highest-score/)|50.4%|
|1489|1388|[pizza-with-3n-slices](https://leetcode.com/problems/pizza-with-3n-slices)|||50.4%|
|23|23|[merge-k-sorted-lists](https://leetcode.com/problems/merge-k-sorted-lists)||[:memo:](https://leetcode.com/articles/merge-k-sorted-list/)|50.0%|
|918|882|[reachable-nodes-in-subdivided-graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph)||[:memo:](https://leetcode.com/articles/reachable-nodes-in-subdivided-graph/)|50.0%|
|1836|1735|[count-ways-to-make-array-with-product](https://leetcode.com/problems/count-ways-to-make-array-with-product)|||50.0%|
|472|472|[concatenated-words](https://leetcode.com/problems/concatenated-words)||[:memo:](https://leetcode.com/articles/concatenated-words/)|49.9%|
|502|502|[ipo](https://leetcode.com/problems/ipo)||[:memo:](https://leetcode.com/articles/ipo/)|49.8%|
|2375|2290|[minimum-obstacle-removal-to-reach-corner](https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner)|||49.8%|
|1244|1316|[distinct-echo-substrings](https://leetcode.com/problems/distinct-echo-substrings)|||49.6%|
|911|879|[profitable-schemes](https://leetcode.com/problems/profitable-schemes)||[:memo:](https://leetcode.com/articles/profitable-schemes/)|49.5%|
|2101|1970|[last-day-where-you-can-still-cross](https://leetcode.com/problems/last-day-where-you-can-still-cross)||[:memo:](https://leetcode.com/articles/last-day-where-you-can-still-cross/)|49.5%|
|1637|1531|[string-compression-ii](https://leetcode.com/problems/string-compression-ii)||[:memo:](https://leetcode.com/articles/string-compression-ii/)|49.4%|
|1322|1210|[minimum-moves-to-reach-target-with-rotations](https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations)|||49.3%|
|1471|1349|[maximum-students-taking-exam](https://leetcode.com/problems/maximum-students-taking-exam)|||49.3%|
|679|679|[24-game](https://leetcode.com/problems/24-game)||[:memo:](https://leetcode.com/articles/24-game/)|49.2%|
|1038|996|[number-of-squareful-arrays](https://leetcode.com/problems/number-of-squareful-arrays)||[:memo:](https://leetcode.com/articles/number-of-squareful-arrays/)|49.2%|
|1313|1916|[count-ways-to-build-rooms-in-an-ant-colony](https://leetcode.com/problems/count-ways-to-build-rooms-in-an-ant-colony)|||49.2%|
|2272|2151|[maximum-good-people-based-on-statements](https://leetcode.com/problems/maximum-good-people-based-on-statements)|||49.2%|
|1389|1263|[minimum-moves-to-move-a-box-to-their-target-location](https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location)|||49.0%|
|689|689|[maximum-sum-of-3-non-overlapping-subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays)||[:memo:](https://leetcode.com/articles/maximum-sum-of-3-non-overlapping-intervals/)|48.9%|
|1517|1416|[restore-the-array](https://leetcode.com/problems/restore-the-array)||[:memo:](https://leetcode.com/articles/restore-the-array/)|48.9%|
|1941|1830|[minimum-number-of-operations-to-make-string-sorted](https://leetcode.com/problems/minimum-number-of-operations-to-make-string-sorted)|||48.9%|
|1376|2312|[selling-pieces-of-wood](https://leetcode.com/problems/selling-pieces-of-wood)|||48.8%|
|2652|2581|[count-number-of-possible-root-nodes](https://leetcode.com/problems/count-number-of-possible-root-nodes)|||48.7%|
|1343|1223|[dice-roll-simulation](https://leetcode.com/problems/dice-roll-simulation)|||48.6%|
|1832|1713|[minimum-operations-to-make-a-subsequence](https://leetcode.com/problems/minimum-operations-to-make-a-subsequence)|||48.5%|
|1499|1383|[maximum-performance-of-a-team](https://leetcode.com/problems/maximum-performance-of-a-team)||[:memo:](https://leetcode.com/articles/maximum-performance-of-a-team/)|48.4%|
|1977|1851|[minimum-interval-to-include-each-query](https://leetcode.com/problems/minimum-interval-to-include-each-query)|||48.3%|
|2291|2172|[maximum-and-sum-of-array](https://leetcode.com/problems/maximum-and-sum-of-array)|||48.3%|
|1004|964|[least-operators-to-express-number](https://leetcode.com/problems/least-operators-to-express-number)||[:memo:](https://leetcode.com/articles/least-operators-to-express-number/)|47.9%|
|2109|1982|[find-array-given-subset-sums](https://leetcode.com/problems/find-array-given-subset-sums)|||47.8%|
|1545|1449|[form-largest-integer-with-digits-that-add-up-to-target](https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target)|||47.7%|
|1692|1569|[number-of-ways-to-reorder-array-to-get-same-bst](https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst)|||47.7%|
|2409|2328|[number-of-increasing-paths-in-a-grid](https://leetcode.com/problems/number-of-increasing-paths-in-a-grid)||[:memo:](https://leetcode.com/articles/number-of-increasing-paths-in-a-grid/)|47.7%|
|2466|2382|[maximum-segment-sum-after-removals](https://leetcode.com/problems/maximum-segment-sum-after-removals)|||47.7%|
|407|407|[trapping-rain-water-ii](https://leetcode.com/problems/trapping-rain-water-ii)|||47.6%|
|1286|1425|[constrained-subsequence-sum](https://leetcode.com/problems/constrained-subsequence-sum)|||47.6%|
|546|546|[remove-boxes](https://leetcode.com/problems/remove-boxes)||[:memo:](https://leetcode.com/articles/remove-boxes/)|47.5%|
|1707|1585|[check-if-string-is-transformable-with-substring-sort-operations](https://leetcode.com/problems/check-if-string-is-transformable-with-substring-sort-operations)|||47.5%|
|2267|2163|[minimum-difference-in-sums-after-removal-of-elements](https://leetcode.com/problems/minimum-difference-in-sums-after-removal-of-elements)|||47.5%|
|1451|1326|[minimum-number-of-taps-to-open-to-water-a-garden](https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden)|||47.4%|
|301|301|[remove-invalid-parentheses](https://leetcode.com/problems/remove-invalid-parentheses)||[:memo:](https://leetcode.com/articles/remove-invalid-parentheses/)|47.2%|
|489|1643|[kth-smallest-instructions](https://leetcode.com/problems/kth-smallest-instructions)|||47.1%|
|2390|2306|[naming-a-company](https://leetcode.com/problems/naming-a-company)||[:memo:](https://leetcode.com/articles/naming-a-company/)|47.1%|
|1220|1125|[smallest-sufficient-team](https://leetcode.com/problems/smallest-sufficient-team)|||47.0%|
|514|514|[freedom-trail](https://leetcode.com/problems/freedom-trail)|||46.9%|
|664|664|[strange-printer](https://leetcode.com/problems/strange-printer)||[:memo:](https://leetcode.com/articles/strange-printer/)|46.9%|
|1447|1345|[jump-game-iv](https://leetcode.com/problems/jump-game-iv)||[:memo:](https://leetcode.com/articles/jump-game-iv/)|46.9%|
|1717|1595|[minimum-cost-to-connect-two-groups-of-points](https://leetcode.com/problems/minimum-cost-to-connect-two-groups-of-points)|||46.9%|
|1569|1458|[max-dot-product-of-two-subsequences](https://leetcode.com/problems/max-dot-product-of-two-subsequences)|||46.8%|
|1907|1803|[count-pairs-with-xor-in-a-range](https://leetcode.com/problems/count-pairs-with-xor-in-a-range)|||46.8%|
|446|446|[arithmetic-slices-ii-subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence)||[:memo:](https://leetcode.com/articles/arithmetic-slices-ii-subsequence/)|46.6%|
|1008|968|[binary-tree-cameras](https://leetcode.com/problems/binary-tree-cameras)||[:memo:](https://leetcode.com/articles/binary-tree-cameras/)|46.6%|
|691|691|[stickers-to-spell-word](https://leetcode.com/problems/stickers-to-spell-word)||[:memo:](https://leetcode.com/articles/stickers-to-spell-word/)|46.4%|
|1223|1627|[graph-connectivity-with-threshold](https://leetcode.com/problems/graph-connectivity-with-threshold)|||46.4%|
|1906|1799|[maximize-score-after-n-operations](https://leetcode.com/problems/maximize-score-after-n-operations)||[:memo:](https://leetcode.com/articles/maximize-score-after-n-operations/)|46.4%|
|239|239|[sliding-window-maximum](https://leetcode.com/problems/sliding-window-maximum)||[:memo:](https://leetcode.com/articles/sliding-window-maximum/)|46.3%|
|1282|1178|[number-of-valid-words-for-each-puzzle](https://leetcode.com/problems/number-of-valid-words-for-each-puzzle)||[:memo:](https://leetcode.com/articles/number-of-valid-words-for-each-puzzle/)|46.3%|
|1691|1568|[minimum-number-of-days-to-disconnect-island](https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island)|||46.3%|
|2430|2354|[number-of-excellent-pairs](https://leetcode.com/problems/number-of-excellent-pairs)|||45.9%|
|123|123|[best-time-to-buy-and-sell-stock-iii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0123-0123(best-time-to-buy-and-sell-stock-iii)/best-time-to-buy-and-sell-stock-iii.java)|[:memo:](https://leetcode.com/articles/best-time-to-buy-and-sell-stock-iii/)|45.6%|
|833|815|[bus-routes](https://leetcode.com/problems/bus-routes)||[:memo:](https://leetcode.com/articles/bus-routes/)|45.6%|
|895|864|[shortest-path-to-get-all-keys](https://leetcode.com/problems/shortest-path-to-get-all-keys)||[:memo:](https://leetcode.com/articles/shortest-path-to-get-all-keys/)|45.5%|
|1290|1187|[make-array-strictly-increasing](https://leetcode.com/problems/make-array-strictly-increasing)|||45.5%|
|1622|1499|[max-value-of-equation](https://leetcode.com/problems/max-value-of-equation)|||45.5%|
|1989|1879|[minimum-xor-sum-of-two-arrays](https://leetcode.com/problems/minimum-xor-sum-of-two-arrays)|||45.5%|
|2119|2009|[minimum-number-of-operations-to-make-array-continuous](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous)|||45.5%|
|140|140|[word-break-ii](https://leetcode.com/problems/word-break-ii)||[:memo:](https://leetcode.com/articles/word-break-ii/)|45.4%|
|2125|1998|[gcd-sort-of-an-array](https://leetcode.com/problems/gcd-sort-of-an-array)|||45.4%|
|1414|1293|[shortest-path-in-a-grid-with-obstacles-elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination)||[:memo:](https://leetcode.com/articles/shortest-path-in-a-grid-with-obstacles-elimination/)|45.3%|
|1029|987|[vertical-order-traversal-of-a-binary-tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree)||[:memo:](https://leetcode.com/articles/vertical-order-traversal-of-a-binary-tree/)|45.2%|
|1871|1745|[palindrome-partitioning-iv](https://leetcode.com/problems/palindrome-partitioning-iv)|||45.2%|
|1826|1707|[maximum-xor-with-an-element-from-array](https://leetcode.com/problems/maximum-xor-with-an-element-from-array)|||45.1%|
|85|85|[maximal-rectangle](https://leetcode.com/problems/maximal-rectangle)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0085-0085(maximal-rectangle)/maximal-rectangle.java)|[:memo:](https://leetcode.com/articles/maximal-rectangle/)|44.9%|
|854|827|[making-a-large-island](https://leetcode.com/problems/making-a-large-island)||[:memo:](https://leetcode.com/articles/making-a-large-island/)|44.9%|
|2563|2468|[split-message-based-on-limit](https://leetcode.com/problems/split-message-based-on-limit)|||44.9%|
|2131|2003|[smallest-missing-genetic-value-in-each-subtree](https://leetcode.com/problems/smallest-missing-genetic-value-in-each-subtree)|||44.8%|
|699|699|[falling-squares](https://leetcode.com/problems/falling-squares)||[:memo:](https://leetcode.com/articles/falling-squares/)|44.7%|
|1508|1392|[longest-happy-prefix](https://leetcode.com/problems/longest-happy-prefix)|||44.7%|
|115|115|[distinct-subsequences](https://leetcode.com/problems/distinct-subsequences)||[:memo:](https://leetcode.com/articles/distinct-subsequences/)|44.6%|
|715|715|[range-module](https://leetcode.com/problems/range-module)||[:memo:](https://leetcode.com/articles/range-module/)|44.6%|
|60|60|[permutation-sequence](https://leetcode.com/problems/permutation-sequence)||[:memo:](https://leetcode.com/articles/permutation-sequence/)|44.5%|
|730|730|[count-different-palindromic-subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences)||[:memo:](https://leetcode.com/articles/count-different-palindromic-subsequences/)|44.5%|
|980|943|[find-the-shortest-superstring](https://leetcode.com/problems/find-the-shortest-superstring)||[:memo:](https://leetcode.com/articles/find-the-shortest-superstring/)|44.3%|
|363|363|[max-sum-of-rectangle-no-larger-than-k](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k)||[:memo:](https://leetcode.com/articles/max-sum-of-rectangle-no-larger-than-k/)|44.0%|
|2494|2416|[sum-of-prefix-scores-of-strings](https://leetcode.com/problems/sum-of-prefix-scores-of-strings)|||43.9%|
|759|757|[set-intersection-size-at-least-two](https://leetcode.com/problems/set-intersection-size-at-least-two)||[:memo:](https://leetcode.com/articles/set-intersection-size-at-least-two/)|43.8%|
|977|940|[distinct-subsequences-ii](https://leetcode.com/problems/distinct-subsequences-ii)||[:memo:](https://leetcode.com/articles/distinct-subsequences-ii/)|43.8%|
|154|154|[find-minimum-in-rotated-sorted-array-ii](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0154-0154(find-minimum-in-rotated-sorted-array-ii)/find-minimum-in-rotated-sorted-array-ii.java)|[:memo:](https://leetcode.com/articles/find-minimum-in-rotated-sorted-array-ii/)|43.5%|
|164|164|[maximum-gap](https://leetcode.com/problems/maximum-gap)||[:memo:](https://leetcode.com/articles/maximum-gap/)|43.5%|
|1398|1269|[number-of-ways-to-stay-in-the-same-place-after-some-steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps)|||43.5%|
|1820|1719|[number-of-ways-to-reconstruct-a-tree](https://leetcode.com/problems/number-of-ways-to-reconstruct-a-tree)|||43.5%|
|1531|1434|[number-of-ways-to-wear-different-hats-to-each-other](https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other)|||43.4%|
|1645|1521|[find-a-value-of-a-mysterious-function-closest-to-target](https://leetcode.com/problems/find-a-value-of-a-mysterious-function-closest-to-target)|||43.4%|
|836|818|[race-car](https://leetcode.com/problems/race-car)||[:memo:](https://leetcode.com/articles/race-car/)|43.3%|
|2513|2426|[number-of-pairs-satisfying-inequality](https://leetcode.com/problems/number-of-pairs-satisfying-inequality)|||43.3%|
|809|793|[preimage-size-of-factorial-zeroes-function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function)||[:memo:](https://leetcode.com/articles/preimage-size-of-factorial-zeroes-function/)|43.2%|
|1012|972|[equal-rational-numbers](https://leetcode.com/problems/equal-rational-numbers)||[:memo:](https://leetcode.com/articles/equal-rational-numbers/)|43.2%|
|403|403|[frog-jump](https://leetcode.com/problems/frog-jump)||[:memo:](https://leetcode.com/articles/frog-jump/)|43.1%|
|460|460|[lfu-cache](https://leetcode.com/problems/lfu-cache)||[:memo:](https://leetcode.com/articles/lfu-cache/)|43.1%|
|1710|1606|[find-servers-that-handled-most-number-of-requests](https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests)||[:memo:](https://leetcode.com/articles/find-server-that-handled-most-number-of-requests/)|43.1%|
|2592|2499|[minimum-total-cost-to-make-arrays-unequal](https://leetcode.com/problems/minimum-total-cost-to-make-arrays-unequal)|||43.0%|
|2574|2488|[count-subarrays-with-median-k](https://leetcode.com/problems/count-subarrays-with-median-k)|||42.9%|
|964|928|[minimize-malware-spread-ii](https://leetcode.com/problems/minimize-malware-spread-ii)||[:memo:](https://leetcode.com/articles/minimize-malware-spread-ii/)|42.8%|
|1805|1703|[minimum-adjacent-swaps-for-k-consecutive-ones](https://leetcode.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones)|||42.8%|
|84|84|[largest-rectangle-in-histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0084-0084(largest-rectangle-in-histogram)/largest-rectangle-in-histogram.java)|[:memo:](https://leetcode.com/articles/largest-rectangle-in-histogram/)|42.7%|
|629|629|[k-inverse-pairs-array](https://leetcode.com/problems/k-inverse-pairs-array)||[:memo:](https://leetcode.com/articles/k-inverse-pairs-array/)|42.6%|
|224|224|[basic-calculator](https://leetcode.com/problems/basic-calculator)||[:memo:](https://leetcode.com/articles/basic-calculator/)|42.5%|
|315|315|[count-of-smaller-numbers-after-self](https://leetcode.com/problems/count-of-smaller-numbers-after-self)||[:memo:](https://leetcode.com/articles/count-of-smaller-numbers-after-self/)|42.5%|
|1825|1723|[find-minimum-time-to-finish-all-jobs](https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs)|||42.4%|
|1042|1000|[minimum-cost-to-merge-stones](https://leetcode.com/problems/minimum-cost-to-merge-stones)|||42.3%|
|1766|1671|[minimum-number-of-removals-to-make-mountain-array](https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array)|||42.3%|
|1513|1397|[find-all-good-strings](https://leetcode.com/problems/find-all-good-strings)|||42.2%|
|960|924|[minimize-malware-spread](https://leetcode.com/problems/minimize-malware-spread)||[:memo:](https://leetcode.com/articles/minimize-malware-spread/)|42.1%|
|2635|2543|[check-if-point-is-reachable](https://leetcode.com/problems/check-if-point-is-reachable)|||42.1%|
|218|218|[the-skyline-problem](https://leetcode.com/problems/the-skyline-problem)||[:memo:](https://leetcode.com/articles/the-skyline-problem/)|41.9%|
|2202|2081|[sum-of-k-mirror-numbers](https://leetcode.com/problems/sum-of-k-mirror-numbers)|||41.9%|
|1262|1157|[online-majority-element-in-subarray](https://leetcode.com/problems/online-majority-element-in-subarray)|||41.8%|
|2521|2435|[paths-in-matrix-whose-sum-is-divisible-by-k](https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k)|||41.8%|
|856|829|[consecutive-numbers-sum](https://leetcode.com/problems/consecutive-numbers-sum)||[:memo:](https://leetcode.com/articles/consecutive-numbers-sum/)|41.6%|
|1668|1542|[find-longest-awesome-substring](https://leetcode.com/problems/find-longest-awesome-substring)|||41.6%|
|1887|1761|[minimum-degree-of-a-connected-trio-in-a-graph](https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph)|||41.6%|
|2295|2188|[minimum-time-to-finish-the-race](https://leetcode.com/problems/minimum-time-to-finish-the-race)|||41.6%|
|938|902|[numbers-at-most-n-given-digit-set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set)||[:memo:](https://leetcode.com/articles/numbers-at-most-n-given-digit-set/)|41.5%|
|552|552|[student-attendance-record-ii](https://leetcode.com/problems/student-attendance-record-ii)||[:memo:](https://leetcode.com/articles/student-attendance-record-ii/)|41.4%|
|332|332|[reconstruct-itinerary](https://leetcode.com/problems/reconstruct-itinerary)||[:memo:](https://leetcode.com/articles/reconstruct-itinerary/)|41.3%|
|873|843|[guess-the-word](https://leetcode.com/problems/guess-the-word)|||41.3%|
|2201|2097|[valid-arrangement-of-pairs](https://leetcode.com/problems/valid-arrangement-of-pairs)|||41.3%|
|2419|2334|[subarray-with-elements-greater-than-varying-threshold](https://leetcode.com/problems/subarray-with-elements-greater-than-varying-threshold)|||41.3%|
|746|745|[prefix-and-suffix-search](https://leetcode.com/problems/prefix-and-suffix-search)||[:memo:](https://leetcode.com/articles/prefix-and-suffix-search/)|41.2%|
|135|135|[candy](https://leetcode.com/problems/candy)||[:memo:](https://leetcode.com/articles/candy/)|41.1%|
|2389|2296|[design-a-text-editor](https://leetcode.com/problems/design-a-text-editor)|||41.0%|
|76|76|[minimum-window-substring](https://leetcode.com/problems/minimum-window-substring)||[:memo:](https://leetcode.com/articles/minimum-window-substring/)|40.9%|
|480|480|[sliding-window-median](https://leetcode.com/problems/sliding-window-median)||[:memo:](https://leetcode.com/articles/sliding-window-median/)|40.9%|
|1257|1632|[rank-transform-of-a-matrix](https://leetcode.com/problems/rank-transform-of-a-matrix)||[:memo:](https://leetcode.com/articles/rank-transform-of-a-matrix/)|40.9%|
|2450|2366|[minimum-replacements-to-sort-the-array](https://leetcode.com/problems/minimum-replacements-to-sort-the-array)|||40.9%|
|2286|2167|[minimum-time-to-remove-all-cars-containing-illegal-goods](https://leetcode.com/problems/minimum-time-to-remove-all-cars-containing-illegal-goods)|||40.8%|
|2554|2463|[minimum-total-distance-traveled](https://leetcode.com/problems/minimum-total-distance-traveled)|||40.6%|
|330|330|[patching-array](https://leetcode.com/problems/patching-array)||[:memo:](https://leetcode.com/articles/patching-array/)|40.4%|
|517|517|[super-washing-machines](https://leetcode.com/problems/super-washing-machines)||[:memo:](https://leetcode.com/articles/super-washing-machines/)|40.4%|
|1255|1330|[reverse-subarray-to-maximize-array-value](https://leetcode.com/problems/reverse-subarray-to-maximize-array-value)|||40.4%|
|2184|2060|[check-if-an-original-string-exists-given-two-encoded-strings](https://leetcode.com/problems/check-if-an-original-string-exists-given-two-encoded-strings)|||40.4%|
|1685|1563|[stone-game-v](https://leetcode.com/problems/stone-game-v)|||40.3%|
|2739|2646|[minimize-the-total-price-of-the-trips](https://leetcode.com/problems/minimize-the-total-price-of-the-trips)|||40.3%|
|630|630|[course-schedule-iii](https://leetcode.com/problems/course-schedule-iii)||[:memo:](https://leetcode.com/articles/course-schedule-iii/)|40.2%|
|884|854|[k-similar-strings](https://leetcode.com/problems/k-similar-strings)||[:memo:](https://leetcode.com/articles/k-similar-strings/)|40.0%|
|989|952|[largest-component-size-by-common-factor](https://leetcode.com/problems/largest-component-size-by-common-factor)||[:memo:](https://leetcode.com/articles/largest-component-size-by-common-factor/)|40.0%|
|1924|1815|[maximum-number-of-groups-getting-fresh-donuts](https://leetcode.com/problems/maximum-number-of-groups-getting-fresh-donuts)|||40.0%|
|902|871|[minimum-number-of-refueling-stops](https://leetcode.com/problems/minimum-number-of-refueling-stops)||[:memo:](https://leetcode.com/articles/minimum-number-of-refueling-stops/)|39.8%|
|993|956|[tallest-billboard](https://leetcode.com/problems/tallest-billboard)||[:memo:](https://leetcode.com/articles/tallest-billboard/)|39.8%|
|1057|1012|[numbers-with-repeated-digits](https://leetcode.com/problems/numbers-with-repeated-digits)|||39.8%|
|1875|1766|[tree-of-coprimes](https://leetcode.com/problems/tree-of-coprimes)|||39.7%|
|2068|1938|[maximum-genetic-difference-query](https://leetcode.com/problems/maximum-genetic-difference-query)|||39.7%|
|963|927|[three-equal-parts](https://leetcode.com/problems/three-equal-parts)||[:memo:](https://leetcode.com/articles/three-equal-parts/)|39.6%|
|1475|1373|[maximum-sum-bst-in-binary-tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree)|||39.6%|
|2023|1912|[design-movie-rental-system](https://leetcode.com/problems/design-movie-rental-system)|||39.6%|
|1913|1787|[make-the-xor-of-all-segments-equal-to-zero](https://leetcode.com/problems/make-the-xor-of-all-segments-equal-to-zero)|||39.5%|
|2251|2147|[number-of-ways-to-divide-a-long-corridor](https://leetcode.com/problems/number-of-ways-to-divide-a-long-corridor)|||39.5%|
|2499|2412|[minimum-money-required-before-transactions](https://leetcode.com/problems/minimum-money-required-before-transactions)|||39.5%|
|819|801|[minimum-swaps-to-make-sequences-increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing)||[:memo:](https://leetcode.com/articles/minimum-swaps-to-make-sequences-increasing/)|39.4%|
|1758|1655|[distribute-repeating-integers](https://leetcode.com/problems/distribute-repeating-integers)|||39.4%|
|2393|2301|[match-substring-after-replacement](https://leetcode.com/problems/match-substring-after-replacement)|||39.4%|
|1433|2227|[encrypt-and-decrypt-strings](https://leetcode.com/problems/encrypt-and-decrypt-strings)|||39.3%|
|1659|1537|[get-the-maximum-score](https://leetcode.com/problems/get-the-maximum-score)|||39.3%|
|1727|1728|[cat-and-mouse-ii](https://leetcode.com/problems/cat-and-mouse-ii)|||39.3%|
|2171|2045|[second-minimum-time-to-reach-destination](https://leetcode.com/problems/second-minimum-time-to-reach-destination)||[:memo:](https://leetcode.com/articles/second-minimum-title-to-reach-destination/)|39.3%|
|124|124|[binary-tree-maximum-path-sum](https://leetcode.com/problems/binary-tree-maximum-path-sum)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0124-0124(binary-tree-maximum-path-sum)/binary-tree-maximum-path-sum.java)|[:memo:](https://leetcode.com/articles/binary-tree-maximum-path-sum/)|39.2%|
|282|282|[expression-add-operators](https://leetcode.com/problems/expression-add-operators)||[:memo:](https://leetcode.com/articles/expression-add-operators/)|39.2%|
|600|600|[non-negative-integers-without-consecutive-ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones)||[:memo:](https://leetcode.com/articles/non-negative-integers-without-consecutive-ones/)|39.2%|
|2263|2141|[maximum-running-time-of-n-computers](https://leetcode.com/problems/maximum-running-time-of-n-computers)||[:memo:](https://leetcode.com/articles/maximum-running-time-of-n-computers/)|39.2%|
|188|188|[best-time-to-buy-and-sell-stock-iv](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv)||[:memo:](https://leetcode.com/articles/best-time-to-buy-and-sell-stock-iv/)|39.1%|
|2549|2454|[next-greater-element-iv](https://leetcode.com/problems/next-greater-element-iv)|||39.1%|
|87|87|[scramble-string](https://leetcode.com/problems/scramble-string)||[:memo:](https://leetcode.com/articles/scramble-string/)|39.0%|
|1947|1819|[number-of-different-subsequences-gcds](https://leetcode.com/problems/number-of-different-subsequences-gcds)|||39.0%|
|942|906|[super-palindromes](https://leetcode.com/problems/super-palindromes)||[:memo:](https://leetcode.com/articles/super-palindromes/)|38.9%|
|1017|975|[odd-even-jump](https://leetcode.com/problems/odd-even-jump)||[:memo:](https://leetcode.com/articles/odd-even-jump/)|38.9%|
|1778|1659|[maximize-grid-happiness](https://leetcode.com/problems/maximize-grid-happiness)|||38.9%|
|483|483|[smallest-good-base](https://leetcode.com/problems/smallest-good-base)|||38.8%|
|2633|2547|[minimum-cost-to-split-an-array](https://leetcode.com/problems/minimum-cost-to-split-an-array)|||38.8%|
|1234|1301|[number-of-paths-with-max-score](https://leetcode.com/problems/number-of-paths-with-max-score)|||38.7%|
|2280|2179|[count-good-triplets-in-an-array](https://leetcode.com/problems/count-good-triplets-in-an-array)|||38.6%|
|2307|2197|[replace-non-coprime-numbers-in-array](https://leetcode.com/problems/replace-non-coprime-numbers-in-array)|||38.6%|
|2157|2030|[smallest-k-length-subsequence-with-occurrences-of-a-letter](https://leetcode.com/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter)|||38.5%|
|1629|1505|[minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits](https://leetcode.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits)|||38.4%|
|1789|1687|[delivering-boxes-from-storage-to-ports](https://leetcode.com/problems/delivering-boxes-from-storage-to-ports)|||38.4%|
|1891|1782|[count-pairs-of-nodes](https://leetcode.com/problems/count-pairs-of-nodes)|||38.4%|
|2241|2122|[recover-the-original-array](https://leetcode.com/problems/recover-the-original-array)|||38.4%|
|1644|1520|[maximum-number-of-non-overlapping-substrings](https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings)|||38.2%|
|2559|2472|[maximum-number-of-non-overlapping-palindrome-substrings](https://leetcode.com/problems/maximum-number-of-non-overlapping-palindrome-substrings)|||38.2%|
|2462|2386|[find-the-k-sum-of-an-array](https://leetcode.com/problems/find-the-k-sum-of-an-array)|||38.1%|
|1799|1681|[minimum-incompatibility](https://leetcode.com/problems/minimum-incompatibility)|||38.0%|
|2671|2608|[shortest-cycle-in-a-graph](https://leetcode.com/problems/shortest-cycle-in-a-graph)|||38.0%|
|354|354|[russian-doll-envelopes](https://leetcode.com/problems/russian-doll-envelopes)||[:memo:](https://leetcode.com/articles/russian-doll-envelopes/)|37.9%|
|2013|1883|[minimum-skips-to-arrive-at-meeting-on-time](https://leetcode.com/problems/minimum-skips-to-arrive-at-meeting-on-time)|||37.9%|
|2349|2267|[check-if-there-is-a-valid-parentheses-string-path](https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path)|||37.9%|
|2353|2242|[maximum-score-of-a-node-sequence](https://leetcode.com/problems/maximum-score-of-a-node-sequence)|||37.9%|
|2040|1928|[minimum-cost-to-reach-destination-in-time](https://leetcode.com/problems/minimum-cost-to-reach-destination-in-time)|||37.8%|
|1896|1770|[maximum-score-from-performing-multiplication-operations](https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations)||[:memo:](https://leetcode.com/articles/maximum-score-from-performing-multiplication-operations/)|37.7%|
|2687|2663|[lexicographically-smallest-beautiful-string](https://leetcode.com/problems/lexicographically-smallest-beautiful-string)|||37.7%|
|2717|2603|[collect-coins-in-a-tree](https://leetcode.com/problems/collect-coins-in-a-tree)|||37.7%|
|2234|2111|[minimum-operations-to-make-the-array-k-increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-k-increasing)|||37.6%|
|68|68|[text-justification](https://leetcode.com/problems/text-justification)|||37.5%|
|174|174|[dungeon-game](https://leetcode.com/problems/dungeon-game)||[:memo:](https://leetcode.com/articles/dungeon-game/)|37.5%|
|1772|1649|[create-sorted-array-through-instructions](https://leetcode.com/problems/create-sorted-array-through-instructions)||[:memo:](https://leetcode.com/articles/create-sorted-array-through-instructions/)|37.5%|
|2326|2223|[sum-of-scores-of-built-strings](https://leetcode.com/problems/sum-of-scores-of-built-strings)|||37.5%|
|2545|2458|[height-of-binary-tree-after-subtree-removal-queries](https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries)|||37.4%|
|1733|1610|[maximum-number-of-visible-points](https://leetcode.com/problems/maximum-number-of-visible-points)|||37.3%|
|127|127|[word-ladder](https://leetcode.com/problems/word-ladder)||[:memo:](https://leetcode.com/articles/word-ladder/)|37.2%|
|591|591|[tag-validator](https://leetcode.com/problems/tag-validator)||[:memo:](https://leetcode.com/articles/tag-validator/)|37.2%|
|1638|1515|[best-position-for-a-service-centre](https://leetcode.com/problems/best-position-for-a-service-centre)|||37.2%|
|2657|2589|[minimum-time-to-complete-all-tasks](https://leetcode.com/problems/minimum-time-to-complete-all-tasks)|||37.2%|
|2588|2503|[maximum-number-of-points-from-grid-queries](https://leetcode.com/problems/maximum-number-of-points-from-grid-queries)|||37.0%|
|1344|1224|[maximum-equal-frequency](https://leetcode.com/problems/maximum-equal-frequency)|||36.9%|
|2583|2493|[divide-nodes-into-the-maximum-number-of-groups](https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups)|||36.9%|
|41|41|[first-missing-positive](https://leetcode.com/problems/first-missing-positive)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0041-0041(first-missing-positive)/first-missing-positive.java)|[:memo:](https://leetcode.com/articles/first-missing-positive/)|36.8%|
|1563|1453|[maximum-number-of-darts-inside-of-a-circular-dartboard](https://leetcode.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard)|||36.8%|
|2360|2272|[substring-with-largest-variance](https://leetcode.com/problems/substring-with-largest-variance)|||36.8%|
|719|719|[find-k-th-smallest-pair-distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance)||[:memo:](https://leetcode.com/articles/find-k-th-smallest-pair-distance/)|36.7%|
|927|891|[sum-of-subsequence-widths](https://leetcode.com/problems/sum-of-subsequence-widths)||[:memo:](https://leetcode.com/articles/sum-of-subsequence-widths/)|36.7%|
|1881|1755|[closest-subsequence-sum](https://leetcode.com/problems/closest-subsequence-sum)|||36.7%|
|432|432|[all-oone-data-structure](https://leetcode.com/problems/all-oone-data-structure)|||36.6%|
|4|4|[median-of-two-sorted-arrays](https://leetcode.com/problems/median-of-two-sorted-arrays)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0004-0004(median-of-two-sorted-arrays)/median-of-two-sorted-arrays.java)||36.4%|
|212|212|[word-search-ii](https://leetcode.com/problems/word-search-ii)||[:memo:](https://leetcode.com/articles/word-search-ii/)|36.4%|
|2457|2376|[count-special-integers](https://leetcode.com/problems/count-special-integers)|||36.4%|
|1479|1354|[construct-target-array-with-multiple-sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums)||[:memo:](https://leetcode.com/articles/construct-target-array-with-multiple-sums/)|36.3%|
|741|741|[cherry-pickup](https://leetcode.com/problems/cherry-pickup)||[:memo:](https://leetcode.com/articles/cherry-pickup/)|36.2%|
|1043|1001|[grid-illumination](https://leetcode.com/problems/grid-illumination)|||36.2%|
|2321|2203|[minimum-weighted-subgraph-with-the-required-paths](https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths)|||36.0%|
|327|327|[count-of-range-sum](https://leetcode.com/problems/count-of-range-sum)|||35.8%|
|1493|1377|[frog-position-after-t-seconds](https://leetcode.com/problems/frog-position-after-t-seconds)|||35.7%|
|1953|1825|[finding-mk-average](https://leetcode.com/problems/finding-mk-average)|||35.7%|
|1957|1847|[closest-room](https://leetcode.com/problems/closest-room)|||35.7%|
|1968|1840|[maximum-building-height](https://leetcode.com/problems/maximum-building-height)|||35.6%|
|2060|1932|[merge-bsts-to-create-single-bst](https://leetcode.com/problems/merge-bsts-to-create-single-bst)|||35.6%|
|381|381|[insert-delete-getrandom-o1-duplicates-allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0381-0381(insert-delete-getrandom-o1-duplicates-allowed)/insert-delete-getrandom-o1-duplicates-allowed.java)|[:memo:](https://leetcode.com/articles/insert-delete-getrandom-o1-duplicates-allowed/)|35.5%|
|910|878|[nth-magical-number](https://leetcode.com/problems/nth-magical-number)||[:memo:](https://leetcode.com/articles/nth-magical-number/)|35.3%|
|1185|1095|[find-in-mountain-array](https://leetcode.com/problems/find-in-mountain-array)|||35.3%|
|1897|1771|[maximize-palindrome-length-from-subsequences](https://leetcode.com/problems/maximize-palindrome-length-from-subsequences)|||35.2%|
|2229|2106|[maximum-fruits-harvested-after-at-most-k-steps](https://leetcode.com/problems/maximum-fruits-harvested-after-at-most-k-steps)|||35.1%|
|336|336|[palindrome-pairs](https://leetcode.com/problems/palindrome-pairs)||[:memo:](https://leetcode.com/articles/palindrome-pairs/)|35.0%|
|2105|1994|[the-number-of-good-subsets](https://leetcode.com/problems/the-number-of-good-subsets)|||34.9%|
|2246|2127|[maximum-employees-to-be-invited-to-a-meeting](https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting)|||34.9%|
|2344|2258|[escape-the-spreading-fire](https://leetcode.com/problems/escape-the-spreading-fire)|||34.9%|
|2708|2573|[find-the-string-with-lcp](https://leetcode.com/problems/find-the-string-with-lcp)|||34.9%|
|2711|2577|[minimum-time-to-visit-a-cell-in-a-grid](https://leetcode.com/problems/minimum-time-to-visit-a-cell-in-a-grid)|||34.9%|
|949|913|[cat-and-mouse](https://leetcode.com/problems/cat-and-mouse)||[:memo:](https://leetcode.com/articles/cat-and-mouse-game/)|34.8%|
|1133|1163|[last-substring-in-lexicographical-order](https://leetcode.com/problems/last-substring-in-lexicographical-order)|||34.8%|
|1676|1553|[minimum-number-of-days-to-eat-n-oranges](https://leetcode.com/problems/minimum-number-of-days-to-eat-n-oranges)|||34.8%|
|2538|2448|[minimum-cost-to-make-array-equal](https://leetcode.com/problems/minimum-cost-to-make-array-equal)||[:memo:](https://leetcode.com/articles/minimum-cost-to-make-array-equal/)|34.8%|
|2627|2538|[difference-between-maximum-and-minimum-price-sum](https://leetcode.com/problems/difference-between-maximum-and-minimum-price-sum)|||34.8%|
|2357|2276|[count-integers-in-intervals](https://leetcode.com/problems/count-integers-in-intervals)|||34.5%|
|821|803|[bricks-falling-when-hit](https://leetcode.com/problems/bricks-falling-when-hit)||[:memo:](https://leetcode.com/articles/bricks-falling-when-hit/)|34.4%|
|2311|2209|[minimum-white-tiles-after-covering-with-carpets](https://leetcode.com/problems/minimum-white-tiles-after-covering-with-carpets)|||34.4%|
|1106|1036|[escape-a-large-maze](https://leetcode.com/problems/escape-a-large-maze)|||34.2%|
|2213|2092|[find-all-people-with-secret](https://leetcode.com/problems/find-all-people-with-secret)|||34.2%|
|2689|2561|[rearranging-fruits](https://leetcode.com/problems/rearranging-fruits)|||34.2%|
|675|675|[cut-off-trees-for-golf-event](https://leetcode.com/problems/cut-off-trees-for-golf-event)||[:memo:](https://leetcode.com/articles/cutoff-trees-for-golf-event/)|34.1%|
|685|685|[redundant-connection-ii](https://leetcode.com/problems/redundant-connection-ii)||[:memo:](https://leetcode.com/articles/redundant-connection-ii/)|34.1%|
|1429|1307|[verbal-arithmetic-puzzle](https://leetcode.com/problems/verbal-arithmetic-puzzle)|||34.1%|
|233|233|[number-of-digit-one](https://leetcode.com/problems/number-of-digit-one)||[:memo:](https://leetcode.com/articles/number-of-digit-one/)|34.0%|
|132|132|[palindrome-partitioning-ii](https://leetcode.com/problems/palindrome-partitioning-ii)||[:memo:](https://leetcode.com/articles/palindrome-partitioning-ii/)|33.8%|
|488|488|[zuma-game](https://leetcode.com/problems/zuma-game)|||33.8%|
|2605|2514|[count-anagrams](https://leetcode.com/problems/count-anagrams)|||33.8%|
|1296|1483|[kth-ancestor-of-a-tree-node](https://leetcode.com/problems/kth-ancestor-of-a-tree-node)|||33.7%|
|2180|2071|[maximum-number-of-tasks-you-can-assign](https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign)|||33.6%|
|894|710|[random-pick-with-blacklist](https://leetcode.com/problems/random-pick-with-blacklist)||[:memo:](https://leetcode.com/articles/random-pick-with-blacklist/)|33.5%|
|2479|2402|[meeting-rooms-iii](https://leetcode.com/problems/meeting-rooms-iii)|||33.4%|
|1277|1363|[largest-multiple-of-three](https://leetcode.com/problems/largest-multiple-of-three)|||33.2%|
|2449|2398|[maximum-number-of-robots-within-budget](https://leetcode.com/problems/maximum-number-of-robots-within-budget)|||33.1%|
|2577|2484|[count-palindromic-subsequences](https://leetcode.com/problems/count-palindromic-subsequences)|||33.1%|
|1270|1172|[dinner-plate-stacks](https://leetcode.com/problems/dinner-plate-stacks)|||33.0%|
|2147|2019|[the-score-of-students-solving-math-expression](https://leetcode.com/problems/the-score-of-students-solving-math-expression)|||33.0%|
|32|32|[longest-valid-parentheses](https://leetcode.com/problems/longest-valid-parentheses)||[:memo:](https://leetcode.com/articles/longest-valid-parentheses/)|32.9%|
|391|391|[perfect-rectangle](https://leetcode.com/problems/perfect-rectangle)|||32.9%|
|2135|2025|[maximum-number-of-ways-to-partition-an-array](https://leetcode.com/problems/maximum-number-of-ways-to-partition-an-array)|||32.8%|
|796|780|[reaching-points](https://leetcode.com/problems/reaching-points)||[:memo:](https://leetcode.com/articles/reaching-points/)|32.7%|
|2601|2518|[number-of-great-partitions](https://leetcode.com/problems/number-of-great-partitions)|||32.7%|
|214|214|[shortest-palindrome](https://leetcode.com/problems/shortest-palindrome)||[:memo:](https://leetcode.com/articles/shortest-palindrome/)|32.4%|
|2596|2508|[add-edges-to-make-degrees-of-all-nodes-even](https://leetcode.com/problems/add-edges-to-make-degrees-of-all-nodes-even)|||32.2%|
|479|479|[largest-palindrome-product](https://leetcode.com/problems/largest-palindrome-product)|||32.1%|
|2510|2430|[maximum-deletions-on-a-string](https://leetcode.com/problems/maximum-deletions-on-a-string)|||32.0%|
|2618|2528|[maximize-the-minimum-powered-city](https://leetcode.com/problems/maximize-the-minimum-powered-city)|||32.0%|
|2701|2565|[subsequence-with-the-minimum-score](https://leetcode.com/problems/subsequence-with-the-minimum-score)|||31.9%|
|1936|1808|[maximize-number-of-nice-divisors](https://leetcode.com/problems/maximize-number-of-nice-divisors)|||31.8%|
|2200|2132|[stamping-the-grid](https://leetcode.com/problems/stamping-the-grid)|||31.6%|
|30|30|[substring-with-concatenation-of-all-words](https://leetcode.com/problems/substring-with-concatenation-of-all-words)||[:memo:](https://leetcode.com/articles/substring-with-concatenation-of-all-words/)|31.3%|
|2018|1889|[minimum-space-wasted-from-packaging](https://leetcode.com/problems/minimum-space-wasted-from-packaging)|||31.3%|
|440|440|[k-th-smallest-in-lexicographical-order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order)|||31.2%|
|2319|2213|[longest-substring-of-one-repeating-character](https://leetcode.com/problems/longest-substring-of-one-repeating-character)|||30.9%|
|2682|2552|[count-increasing-quadruplets](https://leetcode.com/problems/count-increasing-quadruplets)|||30.9%|
|493|493|[reverse-pairs](https://leetcode.com/problems/reverse-pairs)||[:memo:](https://leetcode.com/articles/reverse-pairs/)|30.8%|
|1122|1044|[longest-duplicate-substring](https://leetcode.com/problems/longest-duplicate-substring)||[:memo:](https://leetcode.com/articles/longest-duplicate-substring/)|30.6%|
|639|639|[decode-ways-ii](https://leetcode.com/problems/decode-ways-ii)||[:memo:](https://leetcode.com/articles/decode-ways-ii/)|30.4%|
|1587|1494|[parallel-courses-ii](https://leetcode.com/problems/parallel-courses-ii)|||30.3%|
|2569|2478|[number-of-beautiful-partitions](https://leetcode.com/problems/number-of-beautiful-partitions)|||30.3%|
|273|273|[integer-to-english-words](https://leetcode.com/problems/integer-to-english-words)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0273-0273(integer-to-english-words)/integer-to-english-words.java)|[:memo:](https://leetcode.com/articles/integer-to-english-words/)|30.0%|
|1336|1960|[maximum-product-of-the-length-of-two-palindromic-substrings](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings)|||29.7%|
|335|335|[self-crossing](https://leetcode.com/problems/self-crossing)|||29.5%|
|466|466|[count-the-repetitions](https://leetcode.com/problems/count-the-repetitions)||[:memo:](https://leetcode.com/articles/count-the-repetitions/)|29.5%|
|321|321|[create-maximum-number](https://leetcode.com/problems/create-maximum-number)|||29.1%|
|2150|2040|[kth-smallest-product-of-two-sorted-arrays](https://leetcode.com/problems/kth-smallest-product-of-two-sorted-arrays)|||28.7%|
|2330|2234|[maximum-total-beauty-of-the-gardens](https://leetcode.com/problems/maximum-total-beauty-of-the-gardens)|||28.6%|
|2697|2617|[minimum-number-of-visited-cells-in-a-grid](https://leetcode.com/problems/minimum-number-of-visited-cells-in-a-grid)|||28.6%|
|2301|2183|[count-array-pairs-divisible-by-k](https://leetcode.com/problems/count-array-pairs-divisible-by-k)|||28.3%|
|1326|1862|[sum-of-floored-pairs](https://leetcode.com/problems/sum-of-floored-pairs)|||28.2%|
|10|10|[regular-expression-matching](https://leetcode.com/problems/regular-expression-matching)||[:memo:](https://leetcode.com/articles/regular-expression-matching/)|28.0%|
|2051|1923|[longest-common-subpath](https://leetcode.com/problems/longest-common-subpath)|||27.6%|
|126|126|[word-ladder-ii](https://leetcode.com/problems/word-ladder-ii)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0126-0126(word-ladder-ii)/word-ladder-ii.java)|[:memo:](https://leetcode.com/articles/word-ladder-ii/)|27.5%|
|2368|2281|[sum-of-total-strength-of-wizards](https://leetcode.com/problems/sum-of-total-strength-of-wizards)||[:memo:](https://leetcode.com/articles/sum-of-total-strength-of-wizards/)|27.3%|
|923|887|[super-egg-drop](https://leetcode.com/problems/super-egg-drop)||[:memo:](https://leetcode.com/articles/super-egg-drop/)|27.1%|
|44|44|[wildcard-matching](https://leetcode.com/problems/wildcard-matching)||[:memo:](https://leetcode.com/articles/wildcard-matching/)|27.0%|
|2222|2117|[abbreviating-the-product-of-a-range](https://leetcode.com/problems/abbreviating-the-product-of-a-range)|||27.0%|
|2703|2569|[handling-sum-queries-after-update](https://leetcode.com/problems/handling-sum-queries-after-update)|||26.9%|
|2415|2338|[count-the-number-of-ideal-arrays](https://leetcode.com/problems/count-the-number-of-ideal-arrays)|||26.3%|
|892|862|[shortest-subarray-with-sum-at-least-k](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k)||[:memo:](https://leetcode.com/articles/shortest-subarray-with-sum-at-least-k/)|26.0%|
|823|805|[split-array-with-same-average](https://leetcode.com/problems/split-array-with-same-average)||[:memo:](https://leetcode.com/articles/split-array-with-same-average/)|25.7%|
|2276|2157|[groups-of-strings](https://leetcode.com/problems/groups-of-strings)|||25.5%|
|149|149|[max-points-on-a-line](https://leetcode.com/problems/max-points-on-a-line)||[:memo:](https://leetcode.com/articles/max-points-on-a-line/)|25.2%|
|2275|2156|[find-substring-with-given-hash-value](https://leetcode.com/problems/find-substring-with-given-hash-value)|||22.4%|
|220|220|[contains-duplicate-iii](https://leetcode.com/problems/contains-duplicate-iii)||[:memo:](https://leetcode.com/articles/contains-duplicate-iii/)|22.2%|
|2647|2584|[split-the-array-to-make-coprime-products](https://leetcode.com/problems/split-the-array-to-make-coprime-products)|||22.2%|
|2526|2407|[longest-increasing-subsequence-ii](https://leetcode.com/problems/longest-increasing-subsequence-ii)|||22.0%|
|564|564|[find-the-closest-palindrome](https://leetcode.com/problems/find-the-closest-palindrome)||[:memo:](https://leetcode.com/articles/find-the-closest-palindrome/)|21.9%|
|2091|1977|[number-of-ways-to-separate-numbers](https://leetcode.com/problems/number-of-ways-to-separate-numbers)|||20.5%|
|2765|2659|[make-array-empty](https://leetcode.com/problems/make-array-empty)|||20.2%|
|2162|2035|[partition-array-into-two-arrays-to-minimize-sum-difference](https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference)|||18.9%|
|65|65|[valid-number](https://leetcode.com/problems/valid-number)|[Java](https://github.com/LukeLinXu/leetcode/blob/dev_luke/solutions/0065-0065(valid-number)/valid-number.java)|[:memo:](https://leetcode.com/articles/valid-number/)|18.7%|
|1728|1622|[fancy-sequence](https://leetcode.com/problems/fancy-sequence)|||16.2%|
|2380|2286|[booking-concert-tickets-in-groups](https://leetcode.com/problems/booking-concert-tickets-in-groups)|||15.6%|
|2726|2612|[minimum-reverse-operations](https://leetcode.com/problems/minimum-reverse-operations)|||14.6%|
|420|420|[strong-password-checker](https://leetcode.com/problems/strong-password-checker)|||13.8%|