{"push_id":1973233247,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"89872ad6fd8b4f22807e7b89839a367ef1b89a1c","before":"2598d76775b8824fcf9326a73c8c4e590cbc28eb","commits":[{"sha":"89872ad6fd8b4f22807e7b89839a367ef1b89a1c","author":{"name":"Petar Petrov","email":"9d7cd2c9801f1cd720f3889c9f87ed3873e6828f@gmail.com"},"message":"Add 2nd birthday chocolate challenge solution\n\nKind of O(n) but not really a lot more better than the first solution given the input constraints of m <= 12.","distinct":true,"url":"https://api.github.com/repos/petarov/sandbox/commits/89872ad6fd8b4f22807e7b89839a367ef1b89a1c"}]}
{"actor":{"display_login":"petarov"}}