{"push_id":2645910054,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9950779c69bca11964b844ce20a2c3fe54feba04","before":"02436b379f43c4c773097709213ccc31786fbb5d","commits":[{"sha":"9950779c69bca11964b844ce20a2c3fe54feba04","author":{"name":"Baldwin Chang","email":"fc627fbfb9917d90c744f0a7dbd25da6fb067fe3@jci.com"},"message":"DP house robber + max sub array using DP and a queue","distinct":true,"url":"https://api.github.com/repos/baldwinchang/dsa-study/commits/9950779c69bca11964b844ce20a2c3fe54feba04"}]}
{"actor":{"display_login":"baldwinchang"}}