{"push_id":2393007467,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6fc0566c5903370fc5901f13686098f55af10c79","before":"c04e3f73be72096f54c3d963548e482431102783","commits":[{"sha":"6fc0566c5903370fc5901f13686098f55af10c79","author":{"name":"UrMagicIsMine","email":"42ca71dee1fe8b5ece7d4be8548cb48fd1e3980e@users.noreply.github.com"},"message":"Optimized O(N^2) Solution","distinct":true,"url":"https://api.github.com/repos/UrMagicIsMine/LeetCode-Sol/commits/6fc0566c5903370fc5901f13686098f55af10c79"}]}
{"actor":{"display_login":"UrMagicIsMine"}}