{"push_id":2361506612,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"bd3a60db40d761ff8a7d5be6c9563c21e20a7c29","before":"37620065ca40be3a314a05691ac8abcc60779df2","commits":[{"sha":"bd3a60db40d761ff8a7d5be6c9563c21e20a7c29","author":{"name":"Andrew Bloom","email":"8c905d2d63ca9a7773306403850b7d26b61b3bdf@gmail.com"},"message":"solved path sum two ways problem using recursive traversal and memoization","distinct":true,"url":"https://api.github.com/repos/ALB37/project-euler-problems/commits/bd3a60db40d761ff8a7d5be6c9563c21e20a7c29"}]}
{"actor":{"display_login":"ALB37"}}