stats.json

{"leetcode":{"easy":34,"hard":7,"medium":45,"shas":{"0407-trapping-rain-water-ii":{"0407-trapping-rain-water-ii.py":"d6031b9e97c622fd852f76e9ccf7270b2385b1c9","README.md":"2ded31aef07495cf6fc3b4c38061d2f3a24fa909"},"1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid":{"1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.py":"2a8c27830c3490a0375b6eb7f7310fc9c7ceb2c4","README.md":"6439480538508c05fcf2223ec20d27fd8ae1c838"},"1876-map-of-highest-peak":{"1876-map-of-highest-peak.py":"be33af36d76b9865cd29947acc44402d911a14d0","README.md":"2aed082a7ab8d8c07655ace4cc208d2f373bd353","difficulty":"medium"},"2145-grid-game":{"2145-grid-game.py":"b67a467443047c48a346f0be5fa1789df8aec1eb","README.md":"423b0070d067b807b9ca3ae0ec93e1a415c2ae29"},"2533-bitwise-xor-of-all-pairings":{"2533-bitwise-xor-of-all-pairings.py":"da3a63a874870a8c6b75e9a25a7523465ef5a3bb","README.md":"97e1029342dcb3b5c8c636915791f111e2ccb7f0"},"2685-first-completely-painted-row-or-column":{"2685-first-completely-painted-row-or-column.py":"79988f76e8b9796a47ca1a67f47ee462d699d937","README.md":"45c80d9a3bff5a74be5eaccef30f3909ef48b0a7"},"2792-neighboring-bitwise-xor":{"2792-neighboring-bitwise-xor.py":"76b8a867d47e4a059a37ceb10ddc8ca71baae4f9","README.md":"6a0a2c7b186e5e1329ad5ce9eb7040767148f13d"},"README.md":{"":"e29b871f6afe45ee7007f4f4766820f1a10a39a3"},"1396-count-servers-that-communicate":{"1396-count-servers-that-communicate.py":"5d4d67c14ec63c278218407a3097e813d39bb138","README.md":"859a4898d2ee4058b818df8f9ef57b74ab037a76","difficulty":"medium"},"stats.json":{"":"fabb577c82424283ddfc9ec7e0730e2cae54836a"},"0820-find-eventual-safe-states":{"0820-find-eventual-safe-states.py":"387f9716c0ea6611d2ab4c7656fde2a41faf1dc4","README.md":"59c3927e21eee9572ac3d67a2fbf75be891e9107","difficulty":"medium"},"2246-maximum-employees-to-be-invited-to-a-meeting":{"2246-maximum-employees-to-be-invited-to-a-meeting.py":"7695009c961bcb57bd6974c13f4596cf75c79a71","README.md":"0b335e100965fb2c0c8f0bf28d2e1fe9d5b8c331","difficulty":"hard"},"3219-make-lexicographically-smallest-array-by-swapping-elements":{"3219-make-lexicographically-smallest-array-by-swapping-elements.py":"70e0c30d63f6bf36fe938ba781899d63314cb9d7","README.md":"921cbed3b177622677d0f671321a7a30effd7ef9","difficulty":"medium"},"1558-course-schedule-iv":{"1558-course-schedule-iv.py":"a308717b34c58ba9c7810312abde2994df9a312b","README.md":"795a433913fdb344d42d436e159e94ee155c073a","difficulty":"medium"},"2764-maximum-number-of-fish-in-a-grid":{"2764-maximum-number-of-fish-in-a-grid.py":"95cfdeb66e473e9d354d2ecb20721773804f58df","README.md":"d50f97f0943b543d42406cd257e840ec2029a57b","difficulty":"medium"},"0684-redundant-connection":{"0684-redundant-connection.py":"7979843761b54295378a7b853e4aeebbff9f3aa9","README.md":"ec855ae4df7ef76b7e614c2cf0eb68146f0d7614","difficulty":"medium"},"2583-divide-nodes-into-the-maximum-number-of-groups":{"2583-divide-nodes-into-the-maximum-number-of-groups.py":"5fc2028246482fffc8d40dca843f75ab7b57ee99","README.md":"8637859851d3377664ffb0b629a9d8064aba15f2","difficulty":"hard"},"0854-making-a-large-island":{"0854-making-a-large-island.py":"0ebf724feed606fd47e3a07fa9efde2985e45805","README.md":"f5c92a51e4dc915d27dc02a677e821e376e46586","difficulty":"hard"},"3429-special-array-i":{"3429-special-array-i.py":"dc55f0b2177e098848d822d2dc135529737b8fab","README.md":"dda59956c3cd6ce964f5768e58ffb8ce41c0de73","difficulty":"easy"},"1878-check-if-array-is-sorted-and-rotated":{"1878-check-if-array-is-sorted-and-rotated.py":"da9dcd0d5088d575339447d877bfbedb5d6e1044","README.md":"71e06a7e29eca92e38c35bb3ce1040fa5e0ef7d2","difficulty":"easy"},"3372-longest-strictly-increasing-or-strictly-decreasing-subarray":{"3372-longest-strictly-increasing-or-strictly-decreasing-subarray.py":"e422362b799272e60571bdc81ee9a29e6434c3fc","README.md":"4f3835279e633060c530aa5cb2bca56ec8035dc3","difficulty":"easy"},"1927-maximum-ascending-subarray-sum":{"1927-maximum-ascending-subarray-sum.py":"d979a0feb6c99de5d09443220a9223ffd2953b9a","README.md":"c9b8e592ff4b5f4ed003628171b4023c010b7c2d","difficulty":"easy"},"1915-check-if-one-string-swap-can-make-strings-equal":{"1915-check-if-one-string-swap-can-make-strings-equal.py":"be00dbdd0ebea0706fc463902733114cd73c2d06","README.md":"e9658d9c588f95ddd9f419a023ead3d664008039","difficulty":"easy"},"1364-tuple-with-same-product":{"1364-tuple-with-same-product.py":"ac26cf53a20a25a7d9fed19d90ad48b8bedbcf85","README.md":"0638bcfa0e90b0bc212d10bf38d7e08a31994b87","difficulty":"medium"},"3434-find-the-number-of-distinct-colors-among-the-balls":{"3434-find-the-number-of-distinct-colors-among-the-balls.py":"84b132c0151843c6525dd4e6202036bd58a1531f","README.md":"1257e526765284eedea0254ed934b5dc4a9109e7","difficulty":"medium"},"2434-design-a-number-container-system":{"2434-design-a-number-container-system.py":"8eccfc0f499c1eea69d36967d5fcd013460bf901","README.md":"f99c126303b6aad6ac5e52d3609248784910f89d","difficulty":"medium"},"2448-count-number-of-bad-pairs":{"2448-count-number-of-bad-pairs.py":"7c0164222d2e56f4970a8825b5448d354f4cd385","README.md":"83d0ed4c7dfcf97d08917577333c7e30f2b0d6ce","difficulty":"medium"},"3447-clear-digits":{"3447-clear-digits.py":"085d934ca64fa914f6d4c00d5030b58e24768215","README.md":"8642a98cf9e2794a3d2983324a86db1a8c01393d","difficulty":"easy"},"2021-remove-all-occurrences-of-a-substring":{"2021-remove-all-occurrences-of-a-substring.py":"61b954c3c2ccb40312e393d34b2fef72e0630f43","README.md":"05d9e853a43416e8acbdd9fe1ffddcd4842162d0","difficulty":"medium"},"2473-max-sum-of-a-pair-with-equal-sum-of-digits":{"2473-max-sum-of-a-pair-with-equal-sum-of-digits.py":"81258d8a62a4bbc02052bcdd557c77ea1c0e1e0c","README.md":"8e1bbf2d14cb7bae566266366ff7b2f13e8b111b","difficulty":"medium"},"3332-minimum-operations-to-exceed-threshold-value-ii":{"3332-minimum-operations-to-exceed-threshold-value-ii.py":"b573abed8c432c9b308b591b4401d1769b79c6f1","README.md":"f9cf28d8b1fb634b518517955e37a82545e7df68","difficulty":"medium"},"1477-product-of-the-last-k-numbers":{"1477-product-of-the-last-k-numbers.py":"ebcd20a546ac4724aef435f6274d618ad6099eac","README.md":"16557f5d4160499d9b3d466ccea291cc0b887439","difficulty":"medium"},"2802-find-the-punishment-number-of-an-integer":{"2802-find-the-punishment-number-of-an-integer.py":"6f926d913fc8eea5196f22deb7427927d9110dce","README.md":"efc3e5c459ce7e7d6b18ac5da83e59b8dbb555fe","difficulty":"medium"},"1819-construct-the-lexicographically-largest-valid-sequence":{"1819-construct-the-lexicographically-largest-valid-sequence.py":"591ac42cc1d641cb58822b1e34f392e7e74a665a","README.md":"5a6ec3208f50cd545559a281190dd5a4bca4f205","difficulty":"medium"},"1160-letter-tile-possibilities":{"1160-letter-tile-possibilities.py":"56fd69f23edbb00e48c61f3b7d3353ab30e8432f","README.md":"ecdd62c8f4929550e19a9ef89fc7f383a06757fc","difficulty":"medium"},"2456-construct-smallest-number-from-di-string":{"2456-construct-smallest-number-from-di-string.py":"71e88531b0d3b1101c83cad3023b7f986f1ad384","README.md":"21841a0a03c296d304bf839c4adee79011cb19c0","difficulty":"medium"},"1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n":{"1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.py":"eb362194a427aa0e0898d3b90f95cbf2e691dc7d","README.md":"74b9d9e1b6446b5be7ad47bc14343df8d9ecc958","difficulty":"medium"},"2107-find-unique-binary-string":{"2107-find-unique-binary-string.py":"7fbd342a34484e981cc5f8e949289a15c407d371","README.md":"b0b6e304f8d6bd3ff908e232d68c40f89ee7c9cd","difficulty":"medium"},"1387-find-elements-in-a-contaminated-binary-tree":{"1387-find-elements-in-a-contaminated-binary-tree.py":"436bc226db766534d522afce3a35623979ffe796","README.md":"7980583be6ecef53867f4c3e06018b1486896daa","difficulty":"medium"},"1093-recover-a-tree-from-preorder-traversal":{"1093-recover-a-tree-from-preorder-traversal.py":"c216d57ba59c25eba8c943f778b216f2d5554924","README.md":"b70ae544747eef7effda85e53eeef3f8a9d5e9b1","difficulty":"hard"},"0925-construct-binary-tree-from-preorder-and-postorder-traversal":{"README.md":"be31bf390a70467103dd25c4054df5dcb6e1bfb3"},"2564-most-profitable-path-in-a-tree":{"2564-most-profitable-path-in-a-tree.py":"4cd983b002155b34c67298c665658329366e95cf","README.md":"e56db6241b94a4f297e763b1b86a745d31513479","difficulty":"medium"},"1631-number-of-sub-arrays-with-odd-sum":{"1631-number-of-sub-arrays-with-odd-sum.py":"c82badbb7f64c61d6adf45c1c4982793a5757a5c","README.md":"2e2bb66730b657eb16248394f3e2794c8b40a50c","difficulty":"medium"},"1849-maximum-absolute-sum-of-any-subarray":{"1849-maximum-absolute-sum-of-any-subarray.py":"85c0148743b85165ef26057b541214cb582875e4","README.md":"17a252ecbf551e9e57e4abb7dfc552dd8f74a817","difficulty":"medium"},"1170-shortest-common-supersequence":{"1170-shortest-common-supersequence.py":"9b9290a637bae13b3beef7c03be32953612a861a","README.md":"7a916ced23fb0af40ec7fbdf9158b011b1da5920","difficulty":"hard"},"2551-apply-operations-to-an-array":{"2551-apply-operations-to-an-array.py":"4965d7a0b25f83f76821a166cf2028801f354f6f","README.md":"db6fe73b402f26b678e52baa5c5d8517ec000c82","difficulty":"easy"},"2707-merge-two-2d-arrays-by-summing-values":{"2707-merge-two-2d-arrays-by-summing-values.py":"56b05c66d0701e394424d62728ea341587084802","README.md":"126f179270e6ce8476193401d33ca567d254ae5b","difficulty":"easy"},"2265-partition-array-according-to-given-pivot":{"2265-partition-array-according-to-given-pivot.py":"cf4331604219682bb6660b0590d34cd590f38814","README.md":"5ed7d3387bd3b69500fe679841c7463ffb6cf942","difficulty":"medium"},"1889-check-if-number-is-a-sum-of-powers-of-three":{"1889-check-if-number-is-a-sum-of-powers-of-three.py":"5a2184cc2a1b061ab025f540b78585f1e61841e4","README.md":"565fa7a1a460edcb5bbfac1992cce481f586bce6","difficulty":"medium"},"0001-two-sum":{"0001-two-sum.py":"9a642200cc04def2bb71ea617c04009f3047390b","README.md":"295832280eacc9b202138f15adc074a9cb24c66f","difficulty":"easy"},"0026-remove-duplicates-from-sorted-array":{"0026-remove-duplicates-from-sorted-array.py":"b0d1d7e3e30a70daf49bb1409156d5b4d50ad9a0","README.md":"347d48028e5b233f473e529176aa780f584325e5","difficulty":"easy"},"2649-count-total-number-of-colored-cells":{"2649-count-total-number-of-colored-cells.py":"0eb139c2ca29474401602f87e67ab75b665d6194","README.md":"269e2535e29df07b26c6dfbc4b57370f3a06f4b2","difficulty":"medium"},"0027-remove-element":{"0027-remove-element.py":"988049ed5f55ef865d98998fd1a70739f5057f79","README.md":"1ab688a312e16f9d8c94dc797e0bcfeea600bcec","difficulty":"easy"},"0217-contains-duplicate":{"0217-contains-duplicate.py":"7dbbb1789e60792a1a6c67ca75a4daa634034993","README.md":"32f125875e81cf1815f6c769990b2abcd816244c","difficulty":"easy"},"0053-maximum-subarray":{"0053-maximum-subarray.py":"5cf1207c6d4b2bc3e28a2334cbc71ad845cae382","README.md":"d5a3ebbc32f90c704f218540f37b5cba9883d539","difficulty":"medium"},"0215-kth-largest-element-in-an-array":{"0215-kth-largest-element-in-an-array.py":"a1e81e475f0e18801db8c8d43f0c14be49dc1e27","README.md":"298cc5a76e0dc90dc8740987ad53ab6784bb1497","difficulty":"medium"},"0189-rotate-array":{"0189-rotate-array.py":"d54c1fd42d73ec85fa2c023cd0b51c35bb71ebbe","README.md":"b710072ecd8b8c5020863cf6ed6cb567a8d0c8f7","difficulty":"medium"},"0283-move-zeroes":{"0283-move-zeroes.py":"83cc0c2e3139fe8f6256f22c857cc7fd7a804bf4","README.md":"28d20bb062aa7dc5a9395769b41f7a80a0378b71","difficulty":"easy"},"3227-find-missing-and-repeated-values":{"3227-find-missing-and-repeated-values.py":"36ba71fecc9ca1300ab0bde93819ad69d1a29c1b","README.md":"c25efda0562d8d985ee1f10a560efcb04acf9041","difficulty":"easy"},"2610-closest-prime-numbers-in-range":{"2610-closest-prime-numbers-in-range.py":"8c2a7bdfe36caf1656ef49b00b3ffd4d4f6f908a","README.md":"bbd585a08200af4de9470426ecb0db7eb66cf648","difficulty":"medium"},"2463-minimum-recolors-to-get-k-consecutive-black-blocks":{"2463-minimum-recolors-to-get-k-consecutive-black-blocks.py":"2e435bada342cfb9ed66b230aedddccc400d8917","README.md":"cb542868f09389af2d2b18728b6c12b0647aad94","difficulty":"easy"},"3483-alternating-groups-ii":{"3483-alternating-groups-ii.py":"84c772f3aaf5d03c4583006068f5c59e572ab57d","README.md":"cbc52601191d27764faea143c97c7e73cc8de8fd","difficulty":"medium"},"2614-maximum-count-of-positive-integer-and-negative-integer":{"2614-maximum-count-of-positive-integer-and-negative-integer.py":"05cf7030ee7e66913b3d2553f4d36f26efbbd457","README.md":"58eaeae56e775d5323829c217ff0e84c57a05c00","difficulty":"easy"},"3643-zero-array-transformation-ii":{"3643-zero-array-transformation-ii.py":"a219e464d0caf5d1937f440d51330fe44c3b9929","README.md":"fd36c49d3ccd8a0c464f6c30d4683a50ba804fb3","difficulty":"medium"},"1335-maximum-candies-allocated-to-k-children":{"1335-maximum-candies-allocated-to-k-children.py":"01d0a56043a88d70f23e5c37a2b09c0d31c838a2","README.md":"c37cdabe65ad7ba4e873c71464f4f93154ad39f3","difficulty":"medium"},"2665-minimum-time-to-repair-cars":{"2665-minimum-time-to-repair-cars.py":"22830b0a7784f88d605995feacbc02c7b9f548ef","README.md":"35ff34a2055cba652497ba054132d7b5b1bbe95f","difficulty":"medium"},"3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i":{"3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i.py":"6059c2193a8e19999063379b03b05eaff3af37bc","README.md":"739142b289a1f4b92f65f63ba50de4282f7de5b1","difficulty":"medium"},"3430-count-days-without-meetings":{"3430-count-days-without-meetings.py":"50dd7dd0a4b55b4ebd09717e4adf4eda0206d605","README.md":"b977410ce1e2cd44d3294b76e2cda1e19884571e","difficulty":"medium"},"2160-minimum-operations-to-make-a-uni-value-grid":{"2160-minimum-operations-to-make-a-uni-value-grid.py":"a8de3c927d80ec0fd0d9a9e5a2064434ac0802b3","README.md":"3c5897c7f439ef9c7416edf314ddafc3847724c7"},"2888-minimum-index-of-a-valid-split":{"2888-minimum-index-of-a-valid-split.py":"422c04b1e0b57c3c0c34be657b87f91d98a6d632","README.md":"3499d62a7a4903ffeeb8a4817f149ae4a84b476f","difficulty":"medium"},"3657-check-if-grid-can-be-cut-into-sections":{"3657-check-if-grid-can-be-cut-into-sections.py":"9affbfb356953894d40846aca4bb6e4edc4a9a76","README.md":"c14d99f9c7eabfa65ce1109605b683175e41fad0"},"2588-maximum-number-of-points-from-grid-queries":{"2588-maximum-number-of-points-from-grid-queries.py":"18ac4f4a52c38d44ca99e510d6ced759acbc3b22","README.md":"b61d15379b0603c1f3a4f52c9bbf5e1be161d410","difficulty":"hard"},"1656-count-good-triplets":{"1656-count-good-triplets.py":"0895e15dce83bd7106adee6b5e9bbf5be8a565bb","README.md":"c633fdeb6aba8d3402e131864bbde3613b3e3dac","difficulty":"easy"},"0011-container-with-most-water":{"0011-container-with-most-water.py":"2af3a561dcc75c9646cc8857b37e76fa45164b8e","README.md":"d639cbc775d69587c4d50e25339787fc8d8bf70a","difficulty":"medium"},"2280-count-good-triplets-in-an-array":{"2280-count-good-triplets-in-an-array.py":"0cfc279fd492c0acd99fb40b890f88a9c7702619","README.md":"439a0967eec229682cf227978735c9627247c2e4","difficulty":"hard"},"2277-count-equal-and-divisible-pairs-in-an-array":{"2277-count-equal-and-divisible-pairs-in-an-array.py":"4f2df2bd5986fc94b3fd14d84600f4e6504adfcd","README.md":"9390a3ca22199fdef8e5f90d4bc04f26b93c8a12","difficulty":"easy"},"0459-repeated-substring-pattern":{"0459-repeated-substring-pattern.py":"d8cea14db8ed0a99627a301087ee46939766eabb","README.md":"49db16a1f0978485d919035f60097cfa0214bf3a","difficulty":"easy"},"0686-repeated-string-match":{"0686-repeated-string-match.py":"8513fe5df8061b61c82598199fec29fb5546defc","README.md":"f2fc38892403316feb92e8e8bf7b5fa5f1501b6a","difficulty":"medium"},"2168-check-if-numbers-are-ascending-in-a-sentence":{"2168-check-if-numbers-are-ascending-in-a-sentence.py":"689a431f111b20fb9140ed60a31f1b405b70d859","README.md":"e1dd897ff9da588b0f4872c143d49a542e49a449","difficulty":"easy"},"2243-check-if-all-as-appears-before-all-bs":{"2243-check-if-all-as-appears-before-all-bs.py":"979330536c1b2a77aa40a5dcd9a2ba7e01c18704","README.md":"9b29aab6651b84ac441e853ed5d71df0350f3433","difficulty":"easy"},"1756-minimum-deletions-to-make-string-balanced":{"1756-minimum-deletions-to-make-string-balanced.py":"8070f5fd5ec0504d47b70db256d7774ac9e793d8","README.md":"c8adc0715afd94d4459c58312e284e016d1477e0","difficulty":"medium"},"0121-best-time-to-buy-and-sell-stock":{"0121-best-time-to-buy-and-sell-stock.py":"82efa04de28c59ed4f9bf1f808d9b97f56a72540","README.md":"c985d4a7bb22bad48ddd48f971d6376a9b0b8e9b","difficulty":"easy"},"1813-maximum-erasure-value":{"1813-maximum-erasure-value.py":"d1cbdf348a1fe766c498d4db984f53753debe28b","README.md":"06829dd849ec04751619a655860bc89c53a69301","difficulty":"medium"},"2112-minimum-difference-between-highest-and-lowest-of-k-scores":{"2112-minimum-difference-between-highest-and-lowest-of-k-scores.py":"16e03e12865246a87f0d342ed4f6883c19a5ea9b","README.md":"d0326881ab5492922347708d05a2131ae5e3ec19","difficulty":"easy"},"0209-minimum-size-subarray-sum":{"0209-minimum-size-subarray-sum.py":"de59e042ae1fd26497e1795b58e917e75e623f38","README.md":"6175d13534a18976ac44650d27ae421dbeee2c30","difficulty":"medium"},"2917-count-pairs-whose-sum-is-less-than-target":{"2917-count-pairs-whose-sum-is-less-than-target.py":"ba7330c657d85a8f775c406e2ae120bd9c9ec688","README.md":"de9e5f0ec1464a86079a82db43fa2c4b6ab01082","difficulty":"easy"},"0058-length-of-last-word":{"0058-length-of-last-word.py":"40ad18e7b8b37d288ebb0e104c679f4b5d9296b9","README.md":"8c6470efcc0bbc6275fdf95aea6954761795bd58","difficulty":"easy"},"0035-search-insert-position":{"0035-search-insert-position.py":"bdc294aa4e6e1c756de217fd6f5be859fe8f6363","README.md":"f7e96ce58f8df7b936c2c3670c12a52643a05bf6","difficulty":"easy"},"3621-minimum-operations-to-make-array-values-equal-to-k":{"3621-minimum-operations-to-make-array-values-equal-to-k.py":"d3779a12a8a00338c5892109848fd25e29bab99e","README.md":"6668593aa89e3513772c9ca21f152653cac97eca","difficulty":"easy"},"0088-merge-sorted-array":{"0088-merge-sorted-array.py":"9a41a0bac42311663123fee881515e40b743cf1e","README.md":"50730b6007ef4a20d99d504582778d3b2a0d4774","difficulty":"easy"},"0118-pascals-triangle":{"0118-pascals-triangle.py":"85eab59463f7b6fc6ed9a2e3f0b2d80501621e31","README.md":"549ce276ec0d25402deff66cf41209e7589d123d","difficulty":"easy"},"1894-merge-strings-alternately":{"1894-merge-strings-alternately.py":"76a19a8557274b6a72a8b85be437cce0e284917c","README.md":"21fd62cd68c6bc98c94487b39888213ef8513bde","difficulty":"easy"},"1146-greatest-common-divisor-of-strings":{"1146-greatest-common-divisor-of-strings.py":"6e90dd86232fa22b3a5f8e28d495ccac02e2a269","README.md":"db7d8e9654352403976b6b9726180b89d7bcc81f","difficulty":"easy"},"1528-kids-with-the-greatest-number-of-candies":{"1528-kids-with-the-greatest-number-of-candies.py":"7e68dfae36ba1f9214d4d8b6a63b0c5e3c3bb323","README.md":"7e84dde7bf6052f9264a136540e84d069a0e06ed","difficulty":"easy"},"0605-can-place-flowers":{"0605-can-place-flowers.py":"623a46af709d96a0fe6b74dffa3d970bd33248a5","README.md":"b161c4b38440817b2f79b8f6a379cc7dd0563997","difficulty":"easy"},"0345-reverse-vowels-of-a-string":{"0345-reverse-vowels-of-a-string.py":"8cf78214d105e418788d40e33e4bec6e6b975d7d","README.md":"b68e120d13bdb83481aed4d63ff2f9ac1a5acc18","difficulty":"easy"},"0151-reverse-words-in-a-string":{"0151-reverse-words-in-a-string.py":"dd29d4657f5faac91f94d64b6c4d299d80c0019a","README.md":"3c297129555a572a5da3aadfd1275e741726ae49","difficulty":"medium"}},"solved":86}}