{"push_id":2405819819,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"251817a2deee7a7a08b9c2de5191a9d8c83e7302","before":"aad2e297d16c00573372ccb3b0b4bf88318958e3","commits":[{"sha":"f5ac97a657874c597e24df26c42b2e25c49541a3","author":{"name":"David Crow","email":"a9260c2361a8feb07086fabec1bdc88b186408be@urbanairship.com"},"message":"Subsets, Maximum Depth of Binary Tree","distinct":true,"url":"https://api.github.com/repos/crow/PracticeProblems/commits/f5ac97a657874c597e24df26c42b2e25c49541a3"},{"sha":"251817a2deee7a7a08b9c2de5191a9d8c83e7302","author":{"name":"David Crow","email":"a9260c2361a8feb07086fabec1bdc88b186408be@urbanairship.com"},"message":"Can Win Nim","distinct":true,"url":"https://api.github.com/repos/crow/PracticeProblems/commits/251817a2deee7a7a08b9c2de5191a9d8c83e7302"}]}
{"actor":{"display_login":"crow"}}