{"push_id":2707869857,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2c38d90c4a35d27ebc11bc9ae16809a47ea1d584","before":"41be87e92222e890eff66936dd42ca4994fc4005","commits":[{"sha":"2c38d90c4a35d27ebc11bc9ae16809a47ea1d584","author":{"name":"Amit Bansal","email":"36993a6991014559c4058882fbf63c25f6836cb3@gmail.com"},"message":"866. Smallest Subtree with all the Deepest Nodes","distinct":true,"url":"https://api.github.com/repos/amitbansal7/leetcode/commits/2c38d90c4a35d27ebc11bc9ae16809a47ea1d584"}]}
{"actor":{"display_login":"amitbansal7"}}