stats.json

{"leetcode":{"easy":9,"hard":0,"medium":7,"shas":{"1768-merge-strings-alternately":{"1768-merge-strings-alternately.py":"37dc6a4cdc12443ced8ad251555b3de88d2daf81","README.md":"21fd62cd68c6bc98c94487b39888213ef8513bde","difficulty":"easy"},"README.md":{"":"b918eee84c05a9a6febf9a1be649cc2aa80c53c3"},"0389-find-the-difference":{"0389-find-the-difference.py":"97cc51241d590cf0dee00f6328219d14d9db49bd","README.md":"7c5fa8df5092b3c4157a884108b81352aa72392f","difficulty":"easy"},"stats.json":{"":"b843178fdb803fa2cd959fdcb05e82262d26564b"},"0217-contains-duplicate":{"0217-contains-duplicate.py":"1f670e5b0e402d4a08ed8912aa9a173c28e4d3bc","README.md":"32f125875e81cf1815f6c769990b2abcd816244c","difficulty":"easy"},"0001-two-sum":{"0001-two-sum.py":"d740164b60d2b18d83442696d158d56df2ec47a9","README.md":"295832280eacc9b202138f15adc074a9cb24c66f","difficulty":"easy"},"0347-top-k-frequent-elements":{"0347-top-k-frequent-elements.py":"01522a6035acb2f05fbf0096ba43ab5345c35ea1","README.md":"4e6dc5145dd18f7c1358b1d91339f332d396e8bc","difficulty":"medium"},"0128-longest-consecutive-sequence":{"0128-longest-consecutive-sequence.py":"5ea51cf1cbb04ac1940822f56bd35d1c1e5a647d","README.md":"bc9f29c64becd6a215a5f4d2dfc5724230985721","difficulty":"medium"},"0141-linked-list-cycle":{"0141-linked-list-cycle.py":"20502882f58ca1eae2fb04afb4c259ce050680e9","README.md":"c5ab8258e428a83827bb65b22ace9f4fd6aa339a","difficulty":"easy"},"0021-merge-two-sorted-lists":{"0021-merge-two-sorted-lists.py":"696092f605f1f010c34867d7886a45f6317e05db","README.md":"859aec2842f4b0ee5bcbc96fb86ed1988c287b12","difficulty":"easy"},"0017-letter-combinations-of-a-phone-number":{"0017-letter-combinations-of-a-phone-number.py":"d6b60009461caf9a19c43b8e9b9192ca6e75aeed","README.md":"816788cd30ef9acdb044252e4717385f54642e2b","difficulty":"medium"},"0077-combinations":{"0077-combinations.py":"31a36edc96efa587f6f143998aebf918a540ce3d","README.md":"648032d4c3700460b7f70996c74a22b3e459a958","difficulty":"medium"},"0104-maximum-depth-of-binary-tree":{"0104-maximum-depth-of-binary-tree.py":"19691e67d2a7f4a2f0ff294075269b7f21ce3620","README.md":"3e88d40eac7067a0b69cceb90c76020b6f152ae0","difficulty":"easy"},"0215-kth-largest-element-in-an-array":{"0215-kth-largest-element-in-an-array.py":"f698a144639cc371b66f1c1bddeb0fd402a4437f","README.md":"298cc5a76e0dc90dc8740987ad53ab6784bb1497","difficulty":"medium"},"0035-search-insert-position":{"0035-search-insert-position.py":"4bfedcb5691f85d8501286debc9e7d5435a7264e","README.md":"f7e96ce58f8df7b936c2c3670c12a52643a05bf6","difficulty":"easy"},"0209-minimum-size-subarray-sum":{"0209-minimum-size-subarray-sum.py":"90b2c88f10131a79e69aa7829ace5448ab099636","README.md":"6175d13534a18976ac44650d27ae421dbeee2c30"},"0153-find-minimum-in-rotated-sorted-array":{"0153-find-minimum-in-rotated-sorted-array.py":"31b2ef961367599b1fc80df57f4d563e062f8c97","README.md":"600ad5a169903c578c661c0f571748dc2de102e8","difficulty":"medium"},"0199-binary-tree-right-side-view":{"0199-binary-tree-right-side-view.py":"bd04cd0864e30b7b8d8baed1d512cff40ace926a","README.md":"e5e81cc2d06e4177eb353566d3a36bebd1431bab","difficulty":"medium"},"0070-climbing-stairs":{"0070-climbing-stairs.py":"a535eb24a6113a1fb34816cdec3f268f42f00ad2","README.md":"0c597685f700179382f33b96e37d1288b8252318","difficulty":"easy"}},"solved":16}}