Repository navigation
Expand file tree
/
Copy pathstats.json
More file actions
1 lines (1 loc) · 9.08 KB
/
Copy pathstats.json
File metadata and controls
1 lines (1 loc) · 9.08 KB
1
{"leetcode":{"easy":15,"hard":1,"medium":30,"shas":{"0001-two-sum":{"0001-two-sum.py":"3548858dfd4555d2103089302d02d58443ffba3d","README.md":"7238204fabae612bb22b153b27369c01b34708d6"},"0121-best-time-to-buy-and-sell-stock":{"0121-best-time-to-buy-and-sell-stock.py":"96ab85eae6132d3456797d807a9096e3bae95f1c","README.md":"c985d4a7bb22bad48ddd48f971d6376a9b0b8e9b","difficulty":"easy"},"README.md":{"":"074a1517fafc0eb4a9cfada96602d58d554b6e3d"},"0217-contains-duplicate":{"0217-contains-duplicate.py":"2ee027fa0b29a3e1468c2512f39b67048adeea08","README.md":"32f125875e81cf1815f6c769990b2abcd816244c","difficulty":"easy"},"stats.json":{"":"0c1b67435784d1d145fb72959fceeadb8fd2244d"},"0238-product-of-array-except-self":{"0238-product-of-array-except-self.py":"0e2bbc892256f7d6cb0bd3a5eda6334067a5daf1","README.md":"912d25d7bd08724df0ad14590238921cf2be4a85","difficulty":"medium"},"0053-maximum-subarray":{"0053-maximum-subarray.py":"b9903a2a8568e79aaf092ac6eaeee3842b3df826","README.md":"d5a3ebbc32f90c704f218540f37b5cba9883d539","difficulty":"medium"},"0152-maximum-product-subarray":{"0152-maximum-product-subarray.py":"f6f03ecea6bc9f101fad2f3e6efee043aeca43fc","README.md":"4bd1e38f0c2309e911819178604dd8d0f62e33b9","difficulty":"medium"},"0153-find-minimum-in-rotated-sorted-array":{"0153-find-minimum-in-rotated-sorted-array.py":"5476270e89630ebfd2da8fdfaa5923cacd05a0bf","README.md":"538fecd813924ec4dc9b7d1b4d0f5b98fc98c343","difficulty":"medium"},"0033-search-in-rotated-sorted-array":{"0033-search-in-rotated-sorted-array.py":"2b69d891d120b7004d27bedf3bec35e586254724","README.md":"94b21a0ff47c1182891a4daab5dd7adcb2dd81d6","difficulty":"medium"},"0015-3sum":{"0015-3sum.py":"147bf9f4269509f35049d7b4251abcfea322b422","README.md":"84e5854cd32cb65d06da712e6329d17566651913","difficulty":"medium"},"0011-container-with-most-water":{"0011-container-with-most-water.py":"62a4b646772855bf0caf2958c128c6e2c8892e2b","README.md":"d639cbc775d69587c4d50e25339787fc8d8bf70a","difficulty":"medium"},"0371-sum-of-two-integers":{"0371-sum-of-two-integers.py":"ed9ffc9ba78098908d605f6107864fce452f0e02","README.md":"2e0667e92ce0c5641f2fd8b07d8704396d98081d","difficulty":"medium"},"0070-climbing-stairs":{"0070-climbing-stairs.py":"a3ba746281f8f8f390c1a8cc21b299097a4f31ad","README.md":"605065e555bda04c9d4c7c28998872571ff21e0d","difficulty":"easy"},"0322-coin-change":{"0322-coin-change.py":"c6b148da74384ced06d7856aec55296c38527bf5","README.md":"b6d3fd92a7abf08ee56f664edf0c2dbdfbaa7bc5","difficulty":"medium"},"0300-longest-increasing-subsequence":{"0300-longest-increasing-subsequence.py":"7e52ed50877c69e6f5384ab7525c1c5964a88acc","README.md":"598ddc0fad5b6ebf0b6821028c42c5f9a78fc010","difficulty":"medium"},"1143-longest-common-subsequence":{"1143-longest-common-subsequence.py":"eae7e6fac907407b302beb6385f88ed8b3a8d5ea","README.md":"f78c32cf76f22323d0edf3b660f8229501d0a7e5","difficulty":"medium"},"0139-word-break":{"0139-word-break.py":"d23d71df72edc28c0da7fc56d5b51cc850f3279d","README.md":"cd0b151ce6b8aff35a1eee2ae12ec13daa6a9a58","difficulty":"medium"},"1768-merge-strings-alternately":{"1768-merge-strings-alternately.py":"5aaee3c1a97e3fc2fe781e5a497c20927fd93f37","README.md":"21fd62cd68c6bc98c94487b39888213ef8513bde","difficulty":"easy"},"1071-greatest-common-divisor-of-strings":{"README.md":"5e1593474e4e96f920d988baa86577c643229c98","difficulty":"easy","1071-greatest-common-divisor-of-strings.py":"5f347e354f171bff3ac585d7cab6f60ac35ffcf9"},"1431-kids-with-the-greatest-number-of-candies":{"README.md":"89c4bff770f6b6deb439ae5ef0e6c6a29f2a4a8c","difficulty":"easy","1431-kids-with-the-greatest-number-of-candies.py":"52983134059fd0d4ad2aaff12213b8436ff194a1"},"0605-can-place-flowers":{"0605-can-place-flowers.py":"420982297074b0271211a6b96efb9a27b0c5834f","README.md":"b161c4b38440817b2f79b8f6a379cc7dd0563997","difficulty":"easy"},"0643-maximum-average-subarray-i":{"0643-maximum-average-subarray-i.py":"88516f28146880e3279d165c901529b5ab01a713","README.md":"3f182a24a124ad25c7187ec2a29a8cf7f76721f2","difficulty":"easy"},"1207-unique-number-of-occurrences":{"README.md":"5a77700848de345625443b051fd99a6d4dbed6cb"},"1657-determine-if-two-strings-are-close":{"1657-determine-if-two-strings-are-close.py":"bddf689d0a282151744a609464314f89153ee498","README.md":"09bd4bdabd97253691eaad6fc9c23db05dd57228","difficulty":"medium"},"2215-find-the-difference-of-two-arrays":{"2215-find-the-difference-of-two-arrays.py":"c3dfca472128e889f16b90fd55fc492b0fad69dc","README.md":"7aedec9a92b8e7b2b4dd7c7e04ea94f069c22d7a"},"0104-maximum-depth-of-binary-tree":{"0104-maximum-depth-of-binary-tree.py":"43fa6e52fe9c71eb53e1879f0844f4b3b5f9bffc","README.md":"3e88d40eac7067a0b69cceb90c76020b6f152ae0","difficulty":"easy"},"0872-leaf-similar-trees":{"0872-leaf-similar-trees.py":"41a4761cb0518892a6f86949caab05d1057fa8dd","README.md":"4d197beccac99ba8a008ee61ee17eb34c4758915","difficulty":"easy"},"1448-count-good-nodes-in-binary-tree":{"1448-count-good-nodes-in-binary-tree.py":"47fb74098b8ca6cba913c3a35e74250f6857e215","README.md":"ac8c67cb0cc4cae93f90dad628e618183514922b","difficulty":"medium"},"0437-path-sum-iii":{"0437-path-sum-iii.py":"3bd0bbbe5b6a5dd9686af598677616dbdd863800","README.md":"3cfc1f93fd29f8cd8bdb232365bbe6dd5180d9d9","difficulty":"medium"},"0199-binary-tree-right-side-view":{"0199-binary-tree-right-side-view.py":"908b0a1206b15c1d00d888c0de0641ad88e93536","README.md":"e5e81cc2d06e4177eb353566d3a36bebd1431bab","difficulty":"medium"},"1161-maximum-level-sum-of-a-binary-tree":{"1161-maximum-level-sum-of-a-binary-tree.py":"f96e08eed735a01a9ac1ce934b787d7748bbf712","README.md":"b00918434c0ce776444d9f750b1d1b2c7505f51b","difficulty":"medium"},"0700-search-in-a-binary-search-tree":{"0700-search-in-a-binary-search-tree.py":"e7b9af1a3685a560e9c85d89a50f23ca478eb640","README.md":"0ebb87b67c966c7015765bd0dd9990eb6353574f","difficulty":"easy"},"0167-two-sum-ii-input-array-is-sorted":{"0167-two-sum-ii-input-array-is-sorted.py":"fed5ef9cf579ab0ef4e2a05c90d0ef75ba0d1d2c","README.md":"f07629b35d63450b979032e6ab9a74f3d7f40c62","difficulty":"medium"},"0438-find-all-anagrams-in-a-string":{"0438-find-all-anagrams-in-a-string.py":"d3ac063c085bc03da1ae8c4a6da92ccfaa8aff4e","README.md":"32ddb29ccd9fc2fec1a4d1c02d675ae7bd76d97d","difficulty":"medium"},"0005-longest-palindromic-substring":{"0005-longest-palindromic-substring.py":"13c49eb1c0fddfad0a0b7fa5ea3a625fb74826a4","README.md":"1486d2027004d58264160e29dc48b2c44c5a941b","difficulty":"medium"},"0146-lru-cache":{"0146-lru-cache.py":"29eb76373797dbb9ddba7685b88132943bf096fb","README.md":"78d8cda26202d31a421edf66e6ee48900155ec1f","difficulty":"medium"},"0023-merge-k-sorted-lists":{"0023-merge-k-sorted-lists.py":"29b8dacc987dc0e57dd3a2917adab49d7e7f9594","README.md":"db6073167141f16dfc4b2e140fcc5f006994de35","difficulty":"hard"},"2390-removing-stars-from-a-string":{"2390-removing-stars-from-a-string.py":"28b290ee1e3847412dc55544fcab541e92276140","README.md":"c0f4b0cb7947a3e84ccc440ea00e8a59425a8e09","difficulty":"medium"},"0735-asteroid-collision":{"0735-asteroid-collision.py":"8e5fad0cb1eb36c1b1a0673772bed55fe779e152","README.md":"25eabd5475bacce897b6fec781fdbe7e00f7fc7c","difficulty":"medium"},"1732-find-the-highest-altitude":{"1732-find-the-highest-altitude.py":"ae4b452c6a1409aab07217f2b8a6662eb8221627","README.md":"6f4fac734721d34956d71417b760d5df1e33c1a4","difficulty":"easy"},"0724-find-pivot-index":{"0724-find-pivot-index.py":"699f5507150c11d7b06daf4cba781602594d1027","README.md":"810957dcc5782fa71d4fd8e0f0419396ab6a2e1b","difficulty":"easy"},"0933-number-of-recent-calls":{"0933-number-of-recent-calls.py":"66029fc8801921087b3d20ebb1f7217ad5160e41","README.md":"c3f2d3ae210746d761191c53f92dd7ab54fee097","difficulty":"easy"},"2095-delete-the-middle-node-of-a-linked-list":{"2095-delete-the-middle-node-of-a-linked-list.py":"13e140a9d62cc09eaeab09f3bada0198cf31b8ec","README.md":"b5cc378651546dcfe82f3b637c355f3f041fa93a","difficulty":"medium"},"0450-delete-node-in-a-bst":{"0450-delete-node-in-a-bst.py":"71681a598a49809ff4865c6bef7600250bac6d4f","README.md":"8ac4c4ccd33ce177d7a1a7378dce76a220ae983d","difficulty":"medium"},"0841-keys-and-rooms":{"0841-keys-and-rooms.py":"343b8b1ca5bae429dc8fcfb3bcc3d87a4620bf6d","README.md":"f5774014db9acda17350020e347e44692e09eec7","difficulty":"medium"},"0547-number-of-provinces":{"0547-number-of-provinces.py":"d886268a90f3a59aa7e2410ca189ddb21fc566ac","README.md":"ae6ceca6bc3942c9bf6f21b50ec888eaf27e900e","difficulty":"medium"},"1926-nearest-exit-from-entrance-in-maze":{"1926-nearest-exit-from-entrance-in-maze.py":"16e41c6ee5439d3082d558898c8e807831de3396","README.md":"560194058735391ff47f4bfc39a7b16b7e91b5a4","difficulty":"medium"},"0062-unique-paths":{"0062-unique-paths.py":"6b0001b8fad7293fde9cd71411328656beec89c8","README.md":"b676820715691b3472b9749889dbf60309e0f260","difficulty":"medium"},"0714-best-time-to-buy-and-sell-stock-with-transaction-fee":{"0714-best-time-to-buy-and-sell-stock-with-transaction-fee.py":"ee6eaa9b912b1fe28d3a9db9ff792698ab5360e7","README.md":"21cac6e7f2257b970c131b162cd49da0d61ff523","difficulty":"medium"},"0345-reverse-vowels-of-a-string":{"0345-reverse-vowels-of-a-string.py":"7fc0910b2353571bff0bef995a4eff6224a69ba2","README.md":"b68e120d13bdb83481aed4d63ff2f9ac1a5acc18","difficulty":"easy"}},"solved":46}}