{"push_id":552602268,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b374a4a9110bed45b6509b790c9952b44adcffcf","before":"9b61e46c25740405c5028ce92bb9554dd9ff6c5d","commits":[{"sha":"b374a4a9110bed45b6509b790c9952b44adcffcf","author":{"email":"8bfd13cad0bc4b2ac41d9e235951e72c9b62c2aa@patel.org.in","name":"Jay A. Patel"},"message":"Previous test spec `double-amount-change` works well in catching the greedy\nsolution as a non-solution to the \"Making Change\" problem.  However, the spec\nwould pass an adversarial solution that uses the correct solution for amounts\nthat multiples of 2, and a greedy approach for non-multiples of 2.\n\nA more generalize test spec `combined-change` is now provided that makes sure\nthat we test for all possible amounts.","distinct":true,"url":"https://api.github.com/repos/jayp/making-change/commits/b374a4a9110bed45b6509b790c9952b44adcffcf"}]}