{"push_id":2473848104,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"0752b31719566fcdcaeaaa4d78491dbf395fc5fa","before":"bc18e542fc05012e3ea981614fdbec6951a54b02","commits":[{"sha":"0752b31719566fcdcaeaaa4d78491dbf395fc5fa","author":{"name":"Rohit Hooda","email":"981ad674cc96b977f55407978c715b47fa20ba35@gmail.com"},"message":"[GCD]\nImplement finding GCD of two numbers efficiently.","distinct":true,"url":"https://api.github.com/repos/rh2010/learn_and_prepare/commits/0752b31719566fcdcaeaaa4d78491dbf395fc5fa"}]}
{"actor":{"display_login":"rh2010"}}