{"push_id":2519510763,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"250b433655c615e168ceb85676f65405c01f147a","before":"ff89301396bec306f1aa14362473f37dca257dbf","commits":[{"sha":"250b433655c615e168ceb85676f65405c01f147a","author":{"name":"Ishitva Goel","email":"c0988697a8007ea734ac83afafdfc07d571eff7d@yahoo.co.in"},"message":"Implementation for finding intersection point of two converging Linked Lists.","distinct":true,"url":"https://api.github.com/repos/ishitvagoel/BitsAndBytes/commits/250b433655c615e168ceb85676f65405c01f147a"}]}
{"actor":{"display_login":"ishitvagoel"}}