{"push_id":2045956516,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4befb511a15c4760c273fa5cc4d9a4d0d2a2dee3","before":"d77b5c0e4ee15b3d38338244f3551812b3c4cc71","commits":[{"sha":"4befb511a15c4760c273fa5cc4d9a4d0d2a2dee3","author":{"name":"Laucr","email":"5396774bdcadc59a37f165ee2838719738c5fe6a@gmail.com"},"message":"Finds maximum contiguous sub-sequence sum in a[].","distinct":true,"url":"https://api.github.com/repos/Laucr/LeetCode_s2/commits/4befb511a15c4760c273fa5cc4d9a4d0d2a2dee3"}]}
{"actor":{"display_login":"Laucr"}}