{"push_id":593817107,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6d8249d034694a7ba24e333c656368ca6a5c92b3","before":"ae3d4087f8c8ae726a455880c60fbd1f4af2b759","commits":[{"sha":"6d8249d034694a7ba24e333c656368ca6a5c92b3","author":{"email":"99651f5212fb310970583b54ce3740221bf644f9@gmail.com","name":"Ye Xianjin"},"message":"Add solution to Knapsack problem. Based on the condition that we can select an\nelement multiple times, we can choose the minimal number as our base number(n),\nand loop through other distinct values to see weather we can get to kn + p\n(0 =< p < n).","distinct":true,"url":"https://api.github.com/repos/advancedxy/hackerrank/commits/6d8249d034694a7ba24e333c656368ca6a5c92b3"}]}