{"push_id":694952662,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"fdb1080eae7e5a2785f67cd22144c0d9f29aa73a","before":"636422af89800b9c9249d028222b3daf2fb4c060","commits":[{"sha":"fdb1080eae7e5a2785f67cd22144c0d9f29aa73a","author":{"email":"a96a9493b7e75c97f07efe516bc0d2ee2d7aa291@beancrunch.com","name":"Anurag Kapur"},"message":"Refactored problem #222 using divide and conquer approach\n\n- solution now passes time constraints imposed on very large inputs.","distinct":true,"url":"https://api.github.com/repos/anuragkapur/algorithmic-programming/commits/fdb1080eae7e5a2785f67cd22144c0d9f29aa73a"}]}