{"push_id":2865361797,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"845334b98d4e951f7fbf571925eee264584727dc","before":"7c4205937fe2d3f4a6e8455d5cb97e570eb4df12","commits":[{"sha":"845334b98d4e951f7fbf571925eee264584727dc","author":{"name":"Chandra Kant Sharma","email":"9d9dd23f681cc3c27ab4316ae793b00b53a08687@gmail.com"},"message":"Recursive: tower of hanoi\n\nTower of hanoi is a problem where one has three towers and a number of disk. The solver has to move all the disk from one tower to another given the following rules:\r\n1) Can move only one disk at a time.\r\n2) Can move only the upper most disk of a tower.\r\n3) No disk can be placed on top of a smaller disk.","distinct":true,"url":"https://api.github.com/repos/ChanduSharma/Data-structures-and-algorithms-in-python/commits/845334b98d4e951f7fbf571925eee264584727dc"}]}
{"actor":{"display_login":"ChanduSharma"}}