{"push_id":1268513263,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"40c95270afbe5e5f68ef3b68e58aa3b44e869808","before":"d75a8d193f8753893621e9eea9f69e81ebf6ef0e","commits":[{"sha":"40c95270afbe5e5f68ef3b68e58aa3b44e869808","author":{"name":"manishpeshwani","email":"57c72524e162c1b4dcd615daad96dad5006a2336@yahoo.com"},"message":"Knapsack problem using dynamic programming","distinct":true,"url":"https://api.github.com/repos/manishpeshwani/javaalgorithms/commits/40c95270afbe5e5f68ef3b68e58aa3b44e869808"}]}
{"actor":{"display_login":"manishpeshwani"}}