{"push_id":2903331681,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"fa2a054374138f9e232d242db38534bab6cae1fb","before":"3b7c0f53b5340821fe0ea03b3d0953dc6222d701","commits":[{"sha":"fa2a054374138f9e232d242db38534bab6cae1fb","author":{"name":"Joschi","email":"91aa349101bd9cbb325fb9b502a313e280b0bbdf@wwu.de"},"message":"solution for 031 next permutation, with sorting and with reversing for all ascending numbers","distinct":true,"url":"https://api.github.com/repos/rickest-rick/leetcode/commits/fa2a054374138f9e232d242db38534bab6cae1fb"}]}
{"actor":{"display_login":"rickest-rick"}}