{"push_id":3172350856,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b6a53133ec0c64984d8fdb9be0dc01603ed97366","before":"cfbc0269f49e80bfc57257a602bc0076d2048aa4","commits":[{"sha":"b6a53133ec0c64984d8fdb9be0dc01603ed97366","author":{"name":"Mohammed Jasam","email":"7241fafe837617fce3787dedb9ec3701f852b1bf@gmail.com"},"message":"House rob top down and bottom up solutions with O(n) time and O(1) space best case","distinct":true,"url":"https://api.github.com/repos/mohammedjasam/Google-Interview-Preparation/commits/b6a53133ec0c64984d8fdb9be0dc01603ed97366"}]}
{"actor":{"display_login":"mohammedjasam"}}