{"push_id":831025062,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"34957f23dbfd5b03decb0d89904f8164c818c213","before":"b47f01948378d4bf2b7b96208a81d7e16148d868","commits":[{"sha":"34957f23dbfd5b03decb0d89904f8164c818c213","author":{"email":"6bf4fadbbe8acb878b18a4d99a5fdf8381080b5d@nyu.edu","name":"Xun Gong"},"message":"O(n) and O(nlogn) solutions","distinct":true,"url":"https://api.github.com/repos/xun-gong/Leetcode_OJ/commits/34957f23dbfd5b03decb0d89904f8164c818c213"}]}