{"push_id":2799383458,"size":3,"distinct_size":1,"ref":"refs/heads/master","head":"1e5c1ff6b9b24a943bfdf16e415e9f3a489be6f5","before":"327d56f9ef356b1df6ea74ac4471f28467b88c3b","commits":[{"sha":"add2ed191249fed0eb631a16064398ed40103a71","author":{"name":"EthanShin","email":"ecdee8e2f955c9a45b6739ebb8a6d8f74b4f3fad@gmail.com"},"message":"Merge tag '20180814ap' into develop\n\nfeat: Modify Absolute_Permutation.kt to include new feature","distinct":false,"url":"https://api.github.com/repos/EthanShin/hackerrank-1/commits/add2ed191249fed0eb631a16064398ed40103a71"},{"sha":"cd1fe21a81832614471f3763e8a3026484cc8b4b","author":{"name":"EthanShin","email":"ecdee8e2f955c9a45b6739ebb8a6d8f74b4f3fad@gmail.com"},"message":"feat: Add Almost_Sorted.kt\n\ndate: 2018-08-15\ndescription:\nGiven an array of integers, sort by selecting either one swap or one\nreverse.\n\n1. Create project.\n2. Implement I/O.","distinct":false,"url":"https://api.github.com/repos/EthanShin/hackerrank-1/commits/cd1fe21a81832614471f3763e8a3026484cc8b4b"},{"sha":"1e5c1ff6b9b24a943bfdf16e415e9f3a489be6f5","author":{"name":"EthanShin","email":"ecdee8e2f955c9a45b6739ebb8a6d8f74b4f3fad@gmail.com"},"message":"Merge branch 'release/20180815as'\n\nhttps://www.hackerrank.com/challenges/almost-sorted/problem","distinct":true,"url":"https://api.github.com/repos/EthanShin/hackerrank-1/commits/1e5c1ff6b9b24a943bfdf16e415e9f3a489be6f5"}]}
{"actor":{"display_login":"EthanShin"}}