stats.json

{"leetcode":{"easy":1,"hard":0,"medium":2,"shas":{"1370-count-number-of-nice-subarrays":{"1370-count-number-of-nice-subarrays.py":"849999efd8204d929ec275392d301aebe23b7219","README.md":"3e7750e177a0bf5c48d0eab58804e63cfa36be59"},"1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph":{"1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph.py":"b36a26957efbc86ab363ee73159762216641f7d9","README.md":"f5fe1b5ad663fb4ef5d22629312b8eab4baa1a53","difficulty":"medium"},"README.md":{"":"ce23d1ee447f73eee71f8915ae69bf5fc59d7b0b"},"1496-lucky-numbers-in-a-matrix":{"1496-lucky-numbers-in-a-matrix.py":"ea2ff364575b39716a93f8c346163a0f596f9770","README.md":"d0e899fe8a8e039014f20e41dfaf8b4428746931","difficulty":"easy"},"1653-number-of-good-leaf-nodes-pairs":{"1653-number-of-good-leaf-nodes-pairs.py":"c937920d2ed59a9eb82b91d6f0b50c726107a83c","README.md":"8613ad8142cf1fd6a1fab2380451aa7c079cc24d","difficulty":"medium"},"stats.json":{"":"3c32ca54ecdcbec39d278c3c1aa0646ea93658a7"}},"solved":3}}