{"push_id":2688485372,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ac5d796c9dccd9566d76f678212402216e98ef0c","before":"901a0b260b7f7b5bce9b8bc0545dcb4add0a082b","commits":[{"sha":"ac5d796c9dccd9566d76f678212402216e98ef0c","author":{"name":"Vitalii Dobrotskyi","email":"79a8ab96651c26723f33b1f202ffc947e7bf2862@gmail.com"},"message":"53. Maximum Subarray. Bad solution!","distinct":true,"url":"https://api.github.com/repos/Vitaliy-Dob/leet-code/commits/ac5d796c9dccd9566d76f678212402216e98ef0c"}]}
{"actor":{"display_login":"Vitaliy-Dob"}}