{"push_id":1441854936,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f233adddfbece3a21ba455e8936e5b4d14d4fe34","before":"6dab8edb7820545459e354c3bb3c0566bf8d3f9e","commits":[{"sha":"f233adddfbece3a21ba455e8936e5b4d14d4fe34","author":{"name":"Scott Shepard","email":"ddf64ea5989e94a2f54e4e755560f084d9f8c1bd@shepardmail.com"},"message":"Day 12, 2015 Challenge Solution (#8)\n\nI finished all the 2016 challenges (up till day 6) so I am going back to fill in my 2015 challenges.\r\nThis is Day 12 solution in python. It relies heavily on recursion.","distinct":true,"url":"https://api.github.com/repos/scottshepard/advent-of-code/commits/f233adddfbece3a21ba455e8936e5b4d14d4fe34"}]}
{"actor":{"display_login":"scottshepard"}}