{"push_id":1853565751,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"66b3cdcb2c622807cf54d41addf1c8fc873e4b9c","before":"30419551111ab79f2e11260704d00b2fdeb21245","commits":[{"sha":"66b3cdcb2c622807cf54d41addf1c8fc873e4b9c","author":{"name":"Ravi Kiran Chadalawada","email":"a60cfbb9295ee3612a4e596ace1203f83e7a7b0a@gmail.com"},"message":"Added unbounded knapsack problem solution","distinct":true,"url":"https://api.github.com/repos/ravisrhyme/CTCI/commits/66b3cdcb2c622807cf54d41addf1c8fc873e4b9c"}]}
{"actor":{"display_login":"ravisrhyme"}}