Skip to content

Commit 855fa7a

Browse files
committed
Updated stats
1 parent 738d6f7 commit 855fa7a

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

stats.json

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1 +1 @@
1-
{"leetcode":{"easy":21,"hard":3,"medium":12,"shas":{"2707-merge-two-2d-arrays-by-summing-values":{"2707-merge-two-2d-arrays-by-summing-values.java":"ffcf57fc585fb22573315e4df0324d6b743e2c66","README.md":"126f179270e6ce8476193401d33ca567d254ae5b","difficulty":"easy"},"README.md":{"":"0fce3abe9ccc11b6fc753331b4cee3086decb71f"},"1927-maximum-ascending-subarray-sum":{"1927-maximum-ascending-subarray-sum.java":"c573a6088b87160ff95b7506dec3697fad0fbe24","README.md":"2244e29338d92bc56a02e51466b5ea79c88a352e","difficulty":"easy"},"3372-longest-strictly-increasing-or-strictly-decreasing-subarray":{"3372-longest-strictly-increasing-or-strictly-decreasing-subarray.java":"08879cb0ba3b55a5ca0a6d30ecbaa6a627257e01","README.md":"4f3835279e633060c530aa5cb2bca56ec8035dc3","difficulty":"easy"},"stats.json":{"":"5fdde83bae04c997608407fbd4f3e1c375abd96d"},"1878-check-if-array-is-sorted-and-rotated":{"1878-check-if-array-is-sorted-and-rotated.java":"2255625b8043014d39ed6c21f19ec7d37aab259a","README.md":"14be98a0ba2cd0c4f14e9e73f7a203c1d82e384e","difficulty":"easy"},"3429-special-array-i":{"3429-special-array-i.java":"7d0e5b8948e55f503bad57cb360f62b74e0c7a84","README.md":"3a120539c17aa89521dc9ba0bdefe9629b42a492","difficulty":"easy"},"3704-count-partitions-with-even-sum-difference":{"3704-count-partitions-with-even-sum-difference.java":"c95047672fbadc957b7b23255c20d318504b43a4","README.md":"08a84b853657404f3caae1698f7e1dbf0f6f4dc8","difficulty":"easy"},"1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence":{"1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.java":"41649cced65ad6a0efba33f7ca37c4bd55a94299","README.md":"b9b895526bb5585fca2afca29c77b6eb9cb3282c","difficulty":"easy"},"1468-check-if-n-and-its-double-exist":{"1468-check-if-n-and-its-double-exist.java":"2ee96b0c3ac8e5361640ef999383c6e8f0ac2ae8","README.md":"db2355d0fbc51d40176c0cbec13c5f7627c8d98c","difficulty":"easy"},"3582-find-indices-of-stable-mountains":{"3582-find-indices-of-stable-mountains.java":"13a4195d2c969027dbeb321d63fd13fc5f2bc42f","README.md":"f2537712a5096be061e098057fce3178f1b5ba2b","difficulty":"easy"},"3581-the-two-sneaky-numbers-of-digitville":{"3581-the-two-sneaky-numbers-of-digitville.java":"175196a8dec7f6302b2dd4ee012068cf5eb547a6","README.md":"27cb8114bbfe732e2a97c875f7172b29090c3405","difficulty":"easy"},"3619-adjacent-increasing-subarrays-detection-ii":{"3619-adjacent-increasing-subarrays-detection-ii.cpp":"88217b26815fea4c20da1803f44f0e3122ff1eed","README.md":"a91a5e43c4262f3f86886ffbf39205b58a5fd2c7","difficulty":"medium"},"0920-uncommon-words-from-two-sentences":{"0920-uncommon-words-from-two-sentences.java":"add2bb55fd8dfe93956fbd069abe53aaaf16e093","README.md":"f6a06f33da9effaae39fa965ebcd99310b361f78","difficulty":"easy"},"1786-count-the-number-of-consistent-strings":{"1786-count-the-number-of-consistent-strings.java":"afc2f99d1aa32ecf7b64434fa7e9aa758ebf29fe","README.md":"55219ab601533f2af73ba75d191c10f362e97728","difficulty":"easy"},"2076-sum-of-digits-of-string-after-convert":{"2076-sum-of-digits-of-string-after-convert.java":"10e3347b8cc9d76790b4bd0d703f600d34a5ba36","README.md":"54845a8e6f69bebb28839cf814e6b655496547a3","difficulty":"easy"},"2727-number-of-senior-citizens":{"2727-number-of-senior-citizens.java":"90049f12783c25145037b614925aba24ae982c2e","README.md":"b11e9424b9ffcc109843bc986c9a0aaab9fb5824","difficulty":"easy"},"2661-smallest-missing-non-negative-integer-after-operations":{"2661-smallest-missing-non-negative-integer-after-operations.cpp":"a9719d59dc069ce2ba60e843ded70e38eb2e48d5","README.md":"9f7b106ce6f9cac1183e1be07faf7b6a30e9f254","difficulty":"medium"},"1747-lexicographically-smallest-string-after-applying-operations":{"1747-lexicographically-smallest-string-after-applying-operations.java":"fd08616dedf6526d60a74cd182311a8ec24e09da","README.md":"30d0323870e65887a0ebab63f4364efbd1629e4c","difficulty":"medium"},"2137-final-value-of-variable-after-performing-operations":{"2137-final-value-of-variable-after-performing-operations.cpp":"1b7e862614bb47f3bf416bcb4435fc68773fe509","README.md":"79536c5a4734a6c89078a3b8063df6fc11e3fba7","difficulty":"easy"},"2654-count-the-number-of-vowel-strings-in-range":{"2654-count-the-number-of-vowel-strings-in-range.java":"0515965dab76c151206223f5f9c7c859be5599f7","README.md":"8f3778e3fde05cbbb417f1d99d1168653cb656d4","difficulty":"easy"},"1387-find-elements-in-a-contaminated-binary-tree":{"1387-find-elements-in-a-contaminated-binary-tree.java":"d297a3f11bb6ef61f2ca20de84102bdba583fca7","README.md":"7980583be6ecef53867f4c3e06018b1486896daa","difficulty":"medium"},"3622-maximum-frequency-of-an-element-after-performing-operations-i":{"3622-maximum-frequency-of-an-element-after-performing-operations-i.cpp":"b60273ee4cc92f7ddd609fff9c8ea1c79cd4c46c","README.md":"1ae52e4ce03066ea7ebf7cec67cbf165f2983eb1","difficulty":"medium"},"3640-maximum-frequency-of-an-element-after-performing-operations-ii":{"3640-maximum-frequency-of-an-element-after-performing-operations-ii.java":"eff12933372cdce4afbdc56175f918562ef6ec06","README.md":"795417993e034b65da88d0f2123fbd4aba5e8859","difficulty":"hard"},"3768-check-if-digits-are-equal-in-string-after-operations-i":{"3768-check-if-digits-are-equal-in-string-after-operations-i.cpp":"8ff42bc498a5fba021c9d69b8271ef9088df549a","README.md":"7cdf0b03ccf313e0efcc2657d0d1d30367095aed","difficulty":"easy"},"2174-next-greater-numerically-balanced-number":{"2174-next-greater-numerically-balanced-number.cpp":"f7018daac129605c7075416c13dac29224c1192e","README.md":"c00541d068216e8968544333ec48d55a33ca3383","difficulty":"medium"},"0080-remove-duplicates-from-sorted-array-ii":{"0080-remove-duplicates-from-sorted-array-ii.cpp":"a8d2a45dec958a3457a234c7e896035e74e65d4b","README.md":"fe2bba6dc0853114e6fd85ca28bb4f52f76c7799","difficulty":"medium"},"0034-find-first-and-last-position-of-element-in-sorted-array":{"0034-find-first-and-last-position-of-element-in-sorted-array.java":"692b4652d7327a362e88b71e776db8ac6dfb6a7f","README.md":"567e3eedc797db77ac13d34c49731ab95533307b","difficulty":"medium"},"1817-calculate-money-in-leetcode-bank":{"README.md":"1220e8acd4cdbf8ae84896282ac90214bbe01763","difficulty":"easy"},"2169-simple-bank-system":{"2169-simple-bank-system.cpp":"ce7ee41e51456d6e3da4539452eed5db18274a4c","README.md":"1d3e8e8f674d9faf0a9cc7ef3556e2b6cfb0dc18","difficulty":"medium"},"3616-make-array-elements-equal-to-zero":{"3616-make-array-elements-equal-to-zero.cpp":"d70221ea53b84ed0c6aa95a530adf1c64b1f49cc","README.md":"52aedbcc885646a6ef3fb11a72974b5771055c19","difficulty":"easy"},"0334-increasing-triplet-subsequence":{"0334-increasing-triplet-subsequence.java":"3f5931c0140be557a22afce2d858ff0f8aa33050","README.md":"11b2cfceb3f8a6fe7a45787ea374b890e83a1c44","difficulty":"medium"},"3676-smallest-number-with-all-set-bits":{"3676-smallest-number-with-all-set-bits.java":"8b933b551108553b7db899d12b4564956e7226d3","README.md":"e1fb6cef4115cb21f883f74e2a32dbd16c0baeca","difficulty":"easy"},"1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array":{"1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array.java":"7dfce27acf1dfd2c03c1b1ea13e04c47da0f7f2a","README.md":"c3690e06193e880ae230b711911292d5f4ecd585","difficulty":"hard"},"3501-delete-nodes-from-linked-list-present-in-array":{"3501-delete-nodes-from-linked-list-present-in-array.cpp":"b74b20e6f145953ac5852611b90903b626339577","README.md":"666c4fdca81de7fccf908d13e05f955ac275b758","difficulty":"medium"},"1700-minimum-time-to-make-rope-colorful":{"1700-minimum-time-to-make-rope-colorful.cpp":"fec0b42dfa85c1aecaba849de1420abb77d33c6a","README.md":"ed9c9ad96b0830603f46d26acbcb15209bce0677","difficulty":"medium"},"3610-find-x-sum-of-all-k-long-subarrays-i":{"3610-find-x-sum-of-all-k-long-subarrays-i.cpp":"723043397459d2ed3d217a5810588058973a221e","README.md":"73b897acbab0feff2df0ead19283f62a87b06e7f","difficulty":"easy"},"3592-find-x-sum-of-all-k-long-subarrays-ii":{"3592-find-x-sum-of-all-k-long-subarrays-ii.cpp":"cfdd3cd6f5a94bcfa8fd9939efbca9e52c8c6065","README.md":"31f538fc19025b66c011f7b18b3fb3f86c05e3cd","difficulty":"hard"}},"solved":36}}
1+
{"leetcode":{"easy":22,"hard":3,"medium":12,"shas":{"2707-merge-two-2d-arrays-by-summing-values":{"2707-merge-two-2d-arrays-by-summing-values.java":"ffcf57fc585fb22573315e4df0324d6b743e2c66","README.md":"126f179270e6ce8476193401d33ca567d254ae5b","difficulty":"easy"},"README.md":{"":"6f449fd60ef26591ed1d490e623c09c21b1a7638"},"1927-maximum-ascending-subarray-sum":{"1927-maximum-ascending-subarray-sum.java":"c573a6088b87160ff95b7506dec3697fad0fbe24","README.md":"2244e29338d92bc56a02e51466b5ea79c88a352e","difficulty":"easy"},"3372-longest-strictly-increasing-or-strictly-decreasing-subarray":{"3372-longest-strictly-increasing-or-strictly-decreasing-subarray.java":"08879cb0ba3b55a5ca0a6d30ecbaa6a627257e01","README.md":"4f3835279e633060c530aa5cb2bca56ec8035dc3","difficulty":"easy"},"stats.json":{"":"7b4ca341c7ff6261f57da39bf4c9a299da5a1e88"},"1878-check-if-array-is-sorted-and-rotated":{"1878-check-if-array-is-sorted-and-rotated.java":"2255625b8043014d39ed6c21f19ec7d37aab259a","README.md":"14be98a0ba2cd0c4f14e9e73f7a203c1d82e384e","difficulty":"easy"},"3429-special-array-i":{"3429-special-array-i.java":"7d0e5b8948e55f503bad57cb360f62b74e0c7a84","README.md":"3a120539c17aa89521dc9ba0bdefe9629b42a492","difficulty":"easy"},"3704-count-partitions-with-even-sum-difference":{"3704-count-partitions-with-even-sum-difference.java":"c95047672fbadc957b7b23255c20d318504b43a4","README.md":"08a84b853657404f3caae1698f7e1dbf0f6f4dc8","difficulty":"easy"},"1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence":{"1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.java":"41649cced65ad6a0efba33f7ca37c4bd55a94299","README.md":"b9b895526bb5585fca2afca29c77b6eb9cb3282c","difficulty":"easy"},"1468-check-if-n-and-its-double-exist":{"1468-check-if-n-and-its-double-exist.java":"2ee96b0c3ac8e5361640ef999383c6e8f0ac2ae8","README.md":"db2355d0fbc51d40176c0cbec13c5f7627c8d98c","difficulty":"easy"},"3582-find-indices-of-stable-mountains":{"3582-find-indices-of-stable-mountains.java":"13a4195d2c969027dbeb321d63fd13fc5f2bc42f","README.md":"f2537712a5096be061e098057fce3178f1b5ba2b","difficulty":"easy"},"3581-the-two-sneaky-numbers-of-digitville":{"3581-the-two-sneaky-numbers-of-digitville.java":"175196a8dec7f6302b2dd4ee012068cf5eb547a6","README.md":"27cb8114bbfe732e2a97c875f7172b29090c3405","difficulty":"easy"},"3619-adjacent-increasing-subarrays-detection-ii":{"3619-adjacent-increasing-subarrays-detection-ii.cpp":"88217b26815fea4c20da1803f44f0e3122ff1eed","README.md":"a91a5e43c4262f3f86886ffbf39205b58a5fd2c7","difficulty":"medium"},"0920-uncommon-words-from-two-sentences":{"0920-uncommon-words-from-two-sentences.java":"add2bb55fd8dfe93956fbd069abe53aaaf16e093","README.md":"f6a06f33da9effaae39fa965ebcd99310b361f78","difficulty":"easy"},"1786-count-the-number-of-consistent-strings":{"1786-count-the-number-of-consistent-strings.java":"afc2f99d1aa32ecf7b64434fa7e9aa758ebf29fe","README.md":"55219ab601533f2af73ba75d191c10f362e97728","difficulty":"easy"},"2076-sum-of-digits-of-string-after-convert":{"2076-sum-of-digits-of-string-after-convert.java":"10e3347b8cc9d76790b4bd0d703f600d34a5ba36","README.md":"54845a8e6f69bebb28839cf814e6b655496547a3","difficulty":"easy"},"2727-number-of-senior-citizens":{"2727-number-of-senior-citizens.java":"90049f12783c25145037b614925aba24ae982c2e","README.md":"b11e9424b9ffcc109843bc986c9a0aaab9fb5824","difficulty":"easy"},"2661-smallest-missing-non-negative-integer-after-operations":{"2661-smallest-missing-non-negative-integer-after-operations.cpp":"a9719d59dc069ce2ba60e843ded70e38eb2e48d5","README.md":"9f7b106ce6f9cac1183e1be07faf7b6a30e9f254","difficulty":"medium"},"1747-lexicographically-smallest-string-after-applying-operations":{"1747-lexicographically-smallest-string-after-applying-operations.java":"fd08616dedf6526d60a74cd182311a8ec24e09da","README.md":"30d0323870e65887a0ebab63f4364efbd1629e4c","difficulty":"medium"},"2137-final-value-of-variable-after-performing-operations":{"2137-final-value-of-variable-after-performing-operations.cpp":"1b7e862614bb47f3bf416bcb4435fc68773fe509","README.md":"79536c5a4734a6c89078a3b8063df6fc11e3fba7","difficulty":"easy"},"2654-count-the-number-of-vowel-strings-in-range":{"2654-count-the-number-of-vowel-strings-in-range.java":"0515965dab76c151206223f5f9c7c859be5599f7","README.md":"8f3778e3fde05cbbb417f1d99d1168653cb656d4","difficulty":"easy"},"1387-find-elements-in-a-contaminated-binary-tree":{"1387-find-elements-in-a-contaminated-binary-tree.java":"d297a3f11bb6ef61f2ca20de84102bdba583fca7","README.md":"7980583be6ecef53867f4c3e06018b1486896daa","difficulty":"medium"},"3622-maximum-frequency-of-an-element-after-performing-operations-i":{"3622-maximum-frequency-of-an-element-after-performing-operations-i.cpp":"b60273ee4cc92f7ddd609fff9c8ea1c79cd4c46c","README.md":"1ae52e4ce03066ea7ebf7cec67cbf165f2983eb1","difficulty":"medium"},"3640-maximum-frequency-of-an-element-after-performing-operations-ii":{"3640-maximum-frequency-of-an-element-after-performing-operations-ii.java":"eff12933372cdce4afbdc56175f918562ef6ec06","README.md":"795417993e034b65da88d0f2123fbd4aba5e8859","difficulty":"hard"},"3768-check-if-digits-are-equal-in-string-after-operations-i":{"3768-check-if-digits-are-equal-in-string-after-operations-i.cpp":"8ff42bc498a5fba021c9d69b8271ef9088df549a","README.md":"7cdf0b03ccf313e0efcc2657d0d1d30367095aed","difficulty":"easy"},"2174-next-greater-numerically-balanced-number":{"2174-next-greater-numerically-balanced-number.cpp":"f7018daac129605c7075416c13dac29224c1192e","README.md":"c00541d068216e8968544333ec48d55a33ca3383","difficulty":"medium"},"0080-remove-duplicates-from-sorted-array-ii":{"0080-remove-duplicates-from-sorted-array-ii.cpp":"a8d2a45dec958a3457a234c7e896035e74e65d4b","README.md":"fe2bba6dc0853114e6fd85ca28bb4f52f76c7799","difficulty":"medium"},"0034-find-first-and-last-position-of-element-in-sorted-array":{"0034-find-first-and-last-position-of-element-in-sorted-array.java":"692b4652d7327a362e88b71e776db8ac6dfb6a7f","README.md":"567e3eedc797db77ac13d34c49731ab95533307b","difficulty":"medium"},"1817-calculate-money-in-leetcode-bank":{"README.md":"1220e8acd4cdbf8ae84896282ac90214bbe01763","difficulty":"easy"},"2169-simple-bank-system":{"2169-simple-bank-system.cpp":"ce7ee41e51456d6e3da4539452eed5db18274a4c","README.md":"1d3e8e8f674d9faf0a9cc7ef3556e2b6cfb0dc18","difficulty":"medium"},"3616-make-array-elements-equal-to-zero":{"3616-make-array-elements-equal-to-zero.cpp":"d70221ea53b84ed0c6aa95a530adf1c64b1f49cc","README.md":"52aedbcc885646a6ef3fb11a72974b5771055c19","difficulty":"easy"},"0334-increasing-triplet-subsequence":{"0334-increasing-triplet-subsequence.java":"3f5931c0140be557a22afce2d858ff0f8aa33050","README.md":"11b2cfceb3f8a6fe7a45787ea374b890e83a1c44","difficulty":"medium"},"3676-smallest-number-with-all-set-bits":{"3676-smallest-number-with-all-set-bits.java":"8b933b551108553b7db899d12b4564956e7226d3","README.md":"e1fb6cef4115cb21f883f74e2a32dbd16c0baeca","difficulty":"easy"},"1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array":{"1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array.java":"7dfce27acf1dfd2c03c1b1ea13e04c47da0f7f2a","README.md":"c3690e06193e880ae230b711911292d5f4ecd585","difficulty":"hard"},"3501-delete-nodes-from-linked-list-present-in-array":{"3501-delete-nodes-from-linked-list-present-in-array.cpp":"b74b20e6f145953ac5852611b90903b626339577","README.md":"666c4fdca81de7fccf908d13e05f955ac275b758","difficulty":"medium"},"1700-minimum-time-to-make-rope-colorful":{"1700-minimum-time-to-make-rope-colorful.cpp":"fec0b42dfa85c1aecaba849de1420abb77d33c6a","README.md":"ed9c9ad96b0830603f46d26acbcb15209bce0677","difficulty":"medium"},"3610-find-x-sum-of-all-k-long-subarrays-i":{"3610-find-x-sum-of-all-k-long-subarrays-i.cpp":"723043397459d2ed3d217a5810588058973a221e","README.md":"73b897acbab0feff2df0ead19283f62a87b06e7f","difficulty":"easy"},"3592-find-x-sum-of-all-k-long-subarrays-ii":{"3592-find-x-sum-of-all-k-long-subarrays-ii.cpp":"cfdd3cd6f5a94bcfa8fd9939efbca9e52c8c6065","README.md":"31f538fc19025b66c011f7b18b3fb3f86c05e3cd","difficulty":"hard"},"0409-longest-palindrome":{"0409-longest-palindrome.java":"3dc71fe98241e541e59d6d696e9519f9845cd131","README.md":"b2f8005d6c833406aa39cb58aa78f68d1f326ec5","difficulty":"easy"},"3863-power-grid-maintenance":{"3863-power-grid-maintenance.java":"2322ba981b909af3fff03bd33a13572463625a00","README.md":"75afda7989e862a18782bac296adabaa08ff78df"}},"solved":37}}

0 commit comments

Comments
 (0)