-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstats.json
More file actions
1 lines (1 loc) · 3.02 KB
/
stats.json
File metadata and controls
1 lines (1 loc) · 3.02 KB
1
{"leetcode":{"easy":4,"hard":5,"medium":3,"shas":{"0100-same-tree":{"0100-same-tree.py":"33b9a7701036bc5931dfbe8a638bd51ea0b7a0bb","README.md":"e68046f2dc906bcd38453dd92eec5c257d4694a9"},"0146-lru-cache":{"0146-lru-cache.py":"7c33fe0480cdab425824e51a1ede6bf9a026c6cc","README.md":"78d8cda26202d31a421edf66e6ee48900155ec1f"},"0424-longest-repeating-character-replacement":{"0424-longest-repeating-character-replacement.py":"f093f83c82820f471c944874342bb817ba20101a","README.md":"64e2ba5714ef780b760523fafa5c05a6fddab22c"},"0572-subtree-of-another-tree":{"0572-subtree-of-another-tree.py":"95de3ec9e7c0dad9b1d2767f37bf3edd149cd3b1","README.md":"4243f42032030cd2348e7380514d136d8a164b04"},"0789-kth-largest-element-in-a-stream":{"0789-kth-largest-element-in-a-stream.py":"f72f822f5fd2938b90e8ffbe7f3c37f06de12fbc","README.md":"ce768188116f046c134ad13f92d19ca08fd7cf45","difficulty":"easy"},"README.md":{"":"34b50317b2af98eb8663665f7922a6d08de12666"},"1127-last-stone-weight":{"1127-last-stone-weight.py":"a9bfb68fa0592f2b36bb3dc69d5c5efa8182cfe4","README.md":"ff882a360dd87cf3d6e4115a6640ef978f868bcc","difficulty":"easy"},"stats.json":{"":"c5537d019516a55a68a1503d6440aa771f2fa010"},"0004-median-of-two-sorted-arrays":{"0004-median-of-two-sorted-arrays.py":"4521d2342c5322551344e8c1ac2cf5d89a7dcf3e","README.md":"be94a82db362148fa07bc71d2831cb0cb25279e9","difficulty":"hard"},"0235-lowest-common-ancestor-of-a-binary-search-tree":{"0235-lowest-common-ancestor-of-a-binary-search-tree.py":"77ac618391d512d804a85a1d8815353d91e687fa","README.md":"ccc587c35bb4f030d4cc146967eb49e7a922b6ce","difficulty":"medium"},"0208-implement-trie-prefix-tree":{"0208-implement-trie-prefix-tree.py":"2e1ac76044248e0b89fa34abdbc8c2e035b6f16f","README.md":"b2e549df033a7a50e2720489817822dcbf6d92d9","difficulty":"medium"},"0102-binary-tree-level-order-traversal":{"0102-binary-tree-level-order-traversal.py":"2b95a059d9fe134921279ad7a704e2869b6390d2","README.md":"01b65fdfcb1f1937ab9e22e5e3338d581c1423eb","difficulty":"medium"},"0076-minimum-window-substring":{"0076-minimum-window-substring.py":"cb14e3348fc0e6c21164bdd69fa4e42eee351aa5","README.md":"4e4e993681b5879cc2236606247c0c41ae2bb783","difficulty":"hard"},"0661-image-smoother":{"0661-image-smoother.py":"f517749327ddc154eff5d9fd2f49d820869f24cc","README.md":"1af13e0770944a5e15e45bef2ea0689485efa2b2","difficulty":"easy"},"0023-merge-k-sorted-lists":{"0023-merge-k-sorted-lists.py":"d00d333353c4d546cb41d8a0dc202df4a10f0b58","README.md":"50f73b9f23527f4998c689225a4bece42f7c16df","difficulty":"hard"},"0025-reverse-nodes-in-k-group":{"0025-reverse-nodes-in-k-group.py":"440e35e69ef54eae1cdd12d27cd4c07f7fe372e0","README.md":"546ce7c305d12a712c76d032e209715ad644c24b","difficulty":"hard"},"0239-sliding-window-maximum":{"0239-sliding-window-maximum.py":"1006e9ad28fbc507222ea2cc1799fec3110f72da","README.md":"e74bbc2d7db3a76d550412775d2638076c85fdea","difficulty":"hard"},"0242-valid-anagram":{"0242-valid-anagram.py":"98075e81ac67970e0dcb6cd085395787097fc5e5","README.md":"7216cfc7074105cd2f2a50ce61da29ee3295b549","difficulty":"easy"}},"solved":12}}