{"push_id":927860399,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"bbc78ca8f2c3d2efc0c0d8b3e81d9c4f9b39bdd0","before":"2858726884fbfaa4ac5faa9d13141279f3c37df5","commits":[{"sha":"bbc78ca8f2c3d2efc0c0d8b3e81d9c4f9b39bdd0","author":{"email":"a0db15925755466f3451ab2cf5a46133ab8653e5@gmail.com","name":"yusong-shen"},"message":"Solve #153 Maximum Product Subarray","distinct":true,"url":"https://api.github.com/repos/yusong-shen/leetCodePractice/commits/bbc78ca8f2c3d2efc0c0d8b3e81d9c4f9b39bdd0"}]}