{"push_id":2036644177,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"34fa61cefe513b1e5b6f3cf88c86eb51e5851b47","before":"c4f182800a65ef60bc28e3499c163b155ae8fc58","commits":[{"sha":"34fa61cefe513b1e5b6f3cf88c86eb51e5851b47","author":{"name":"ALasib","email":"4d0a30fd70fcb1051f74a511a59242d964f1ce9b@users.noreply.github.com"},"message":"Create Maximum Subarray Sum with segment tree","distinct":true,"url":"https://api.github.com/repos/ALasib/Algorithms/commits/34fa61cefe513b1e5b6f3cf88c86eb51e5851b47"}]}
{"actor":{"display_login":"ALasib"}}