{"push_id":1650646437,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6503f1cc8f95fe28eaef913cc77dfe2fd1220715","before":"1e30d1020de6d74c0bb749555cd69e4a729faf64","commits":[{"sha":"6503f1cc8f95fe28eaef913cc77dfe2fd1220715","author":{"name":"EduardoZola","email":"18914d81362b46521d7573176049d2eb7d9fcf5c@gmail.com"},"message":"Solution112. Path sum","distinct":true,"url":"https://api.github.com/repos/eduzol/LeetCode/commits/6503f1cc8f95fe28eaef913cc77dfe2fd1220715"}]}
{"actor":{"display_login":"eduzol"}}