{"push_id":1058352230,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"38a7727ebbd7e13b7d3c5657ff87a1ea4adea02f","before":"6316061f478506787625a0f8aec24e2914b80253","commits":[{"sha":"38a7727ebbd7e13b7d3c5657ff87a1ea4adea02f","author":{"email":"0c6a5fbc7070d32bacad9d2acfee2ba507f307ba@Raven.(none)","name":"Nathan Haskell"},"message":"completed challenge 2/finding min and max values in an array","distinct":true,"url":"https://api.github.com/repos/Nbhaskell/minimumandmaximum/commits/38a7727ebbd7e13b7d3c5657ff87a1ea4adea02f"}]}