Repository navigation
Expand file tree
/
Copy pathstats.json
More file actions
1 lines (1 loc) · 6.26 KB
/
Copy pathstats.json
File metadata and controls
1 lines (1 loc) · 6.26 KB
1
{"leetcode":{"easy":23,"hard":1,"medium":7,"shas":{"0104-maximum-depth-of-binary-tree":{"0104-maximum-depth-of-binary-tree.cpp":"f74ef443d831ea8fe8b3045816e01031d5eafe5a","README.md":"3e88d40eac7067a0b69cceb90c76020b6f152ae0","difficulty":"easy"},"README.md":{"":"21488055ea02ab480099916ad06de7cb3a801f4e"},"0100-same-tree":{"0100-same-tree.cpp":"49e323b5887e74d392fc22449ca23dc98845f704","README.md":"e68046f2dc906bcd38453dd92eec5c257d4694a9","difficulty":"easy"},"stats.json":{"":"9eb0d2baf03782160b66e180aa35dfc908d25dce"},"0101-symmetric-tree":{"0101-symmetric-tree.cpp":"950134c5df7a1481d1f43fc212aa9404212b178f","README.md":"1f2113012a39cfbad1ebdddb1b47cba18e5fa452","difficulty":"easy"},"0283-move-zeroes":{"0283-move-zeroes.cpp":"5f3e9d53b72fb154aed4040ab6431a99a30079ff","README.md":"28d20bb062aa7dc5a9395769b41f7a80a0378b71","difficulty":"easy"},"0958-check-completeness-of-a-binary-tree":{"0958-check-completeness-of-a-binary-tree.cpp":"96637b166421603bf37855f31497e2a4cb24b20f","README.md":"3934d08d696ad381b0d3e4b048d570dc52e6f071","difficulty":"medium"},"1967-number-of-strings-that-appear-as-substrings-in-word":{"1967-number-of-strings-that-appear-as-substrings-in-word.cpp":"ec50a9582ab14b6e5b1d4c06b057dca6af2b5681","README.md":"a5d20dacc92b993035b9f509f9d2d13667a3527a","difficulty":"easy"},"0520-detect-capital":{"0520-detect-capital.cpp":"3375d5a55ad27be49d41b2bd8db0514ed1e25aa8","README.md":"141e6b05d153f3195b3fb5c752872dd9bcbd5f1e","difficulty":"easy"},"0226-invert-binary-tree":{"0226-invert-binary-tree.cpp":"da35be243018df8bd52313fadbdae304376498c3","README.md":"50f4a6354112c1afacef29ffc7209e5f9f7095d8","difficulty":"easy"},"3978-unique-middle-element":{"3978-unique-middle-element.cpp":"6d01d04cdef6c69e2707bfca28c1abc7f0a40111","README.md":"58ebf6fdc2435b06acd5c1695b7ca1e8625d8757"},"0110-balanced-binary-tree":{"0110-balanced-binary-tree.cpp":"5ba4774400b3e921f52d576b134166f84f397eb9","README.md":"1496517dcf0faedc819cbdf10d07de1900d95d9c","difficulty":"easy"},"0543-diameter-of-binary-tree":{"0543-diameter-of-binary-tree.cpp":"70e6839af0a051929c3fad7d31b3c9637d0c2ec0","README.md":"5ef438e39aa6f6497073598c4bd2c8274ababac7","difficulty":"easy"},"0112-path-sum":{"0112-path-sum.cpp":"4fac3b3f35a4c4cc7e4c28b9415b5cb71c565eaa","README.md":"98772e551dafb6d42f9d932cfe0bd4fdf77d93d6","difficulty":"easy"},"1288-remove-covered-intervals":{"1288-remove-covered-intervals.cpp":"6d705e2da07c0715e552691557e431a86136f5a1","README.md":"cf7d498c09ccdf3c1d5888448e7ae33381e26252","difficulty":"medium"},"3754-concatenate-non-zero-digits-and-multiply-by-sum-i":{"3754-concatenate-non-zero-digits-and-multiply-by-sum-i.cpp":"c705683fad5e22d604f7bd4e3bd48a2a8ccdc4e4","README.md":"946e9aa8ee99ad4ca61ecd190476b43fe33568f0","difficulty":"easy"},"0509-fibonacci-number":{"0509-fibonacci-number.cpp":"b3b1062a935ca9b64a8b10a29849717e08ec8f3b","README.md":"2ac4ae56a3b012f1cae799cadcf8d8465aa0c385","difficulty":"easy"},"0124-binary-tree-maximum-path-sum":{"0124-binary-tree-maximum-path-sum.cpp":"f5db191f478d7a6d0030be0cc9b5e9f4a9e5c59a","README.md":"ffa0bc8c9c787efac4955cef573cc6ed99caf29a","difficulty":"hard"},"1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree":{"README.md":"1eb3c8a6dcce703a0625b09f62ad51a089318598","difficulty":"easy","1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.cpp":"4e5d1ce87cd70f70c38f280cd423b880f0892308"},"0222-count-complete-tree-nodes":{"0222-count-complete-tree-nodes.cpp":"861eb6cfbfd950176b63d38be6902365b0414092","README.md":"b5d031e0d7cc7a1abf0b398a1344396508c657c2","difficulty":"easy"},"0103-binary-tree-zigzag-level-order-traversal":{"0103-binary-tree-zigzag-level-order-traversal.cpp":"b781ce0c609d820253438989723a547784df28d9","README.md":"fcd20aa2bad60f78f450527d135d90bfbc83d83a","difficulty":"medium"},"0067-add-binary":{"0067-add-binary.cpp":"e735b7e1ea9caf5c525648368bd1438523496987","README.md":"c8e3121bb53cf8e5ad4cd28297e9f3ea06024890","difficulty":"easy"},"1979-find-greatest-common-divisor-of-array":{"1979-find-greatest-common-divisor-of-array.cpp":"3ad0562f9305336473f03a5fa8cad0dcae945808","README.md":"19470a2e480a449465db851aa8909f7da11b2a51","difficulty":"easy"},"0114-flatten-binary-tree-to-linked-list":{"README.md":"581431bf3d62fd3a541ca6eb01543cb6f06b71a8"},"0199-binary-tree-right-side-view":{"0199-binary-tree-right-side-view.cpp":"4cfa68f663a252c8d22f9e05f3a51684a457be7a","README.md":"e5e81cc2d06e4177eb353566d3a36bebd1431bab","difficulty":"medium"},"3925-concatenate-array-with-reverse":{"3925-concatenate-array-with-reverse.cpp":"0f66ba6da51e1f330a39dbb7d66665a01661f4b1","README.md":"ddf2ba651425b00864b17a3bdb34a2c516ba2607","difficulty":"easy"},"0129-sum-root-to-leaf-numbers":{"0129-sum-root-to-leaf-numbers.cpp":"6e9c5f9a86ffc579920524051748e34246f31096","README.md":"11b6e43e7a160c6bbac891bc5f8e1ffd1361e0df","difficulty":"medium"},"0414-third-maximum-number":{"0414-third-maximum-number.cpp":"0e9ee7302876987b52b0cbb6553e57f3a2ec8a0c","README.md":"462fdca39bef8391217b547b84ad84e90295162a","difficulty":"easy"},"0001-two-sum":{"0001-two-sum.cpp":"bfe6ebe6626ec6fff955edb93b36f060cf00091a","README.md":"295832280eacc9b202138f15adc074a9cb24c66f","difficulty":"easy"},"0113-path-sum-ii":{"0113-path-sum-ii.cpp":"801846ae710e5b8c7d592586334727fd7cb217b5","README.md":"20bc8fdf97e213e5f14e6750518274598a2e796a","difficulty":"medium"},"0628-maximum-product-of-three-numbers":{"0628-maximum-product-of-three-numbers.cpp":"d00d1d5430c4434603e38c7b30ea5bb24ff09806","README.md":"754001835507c5a8d4b280a465accf540e5d4154","difficulty":"easy"},"0238-product-of-array-except-self":{"0238-product-of-array-except-self.cpp":"023bdd7f484b1440048431f17fb343b2a20102ac","README.md":"e68656f3b6d96cf37a7b9cc755603e43c6db267d","difficulty":"medium"},"2331-evaluate-boolean-binary-tree":{"2331-evaluate-boolean-binary-tree.cpp":"6b80c2969f9c159b253397995e6e3a670b4b32df","README.md":"0c30ea7b62ac653fcdad30cf4e276c9e04aa9090","difficulty":"easy"},"2180-count-integers-with-even-digit-sum":{"2180-count-integers-with-even-digit-sum.cpp":"0f6d5dfb89dd7de61a29bc26d752619b8429a21a","README.md":"80e550b1fa76dbdf7b4f4e6b6ac9b0e96ad53545","difficulty":"easy"},"3014-minimum-number-of-pushes-to-type-word-i":{"3014-minimum-number-of-pushes-to-type-word-i.cpp":"5cd0c68049801895c174a66b8b7b3f2267500662","README.md":"934a0eed10b4c43f06635b0298a9d664ebfaa31d","difficulty":"easy"}},"solved":31}}