{"push_id":723129105,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"a6793253a472c7ce0a465375c3fac41b96ac52a5","before":"eaa0db347dfeec3e6e3f67c83f802a5174bb3383","commits":[{"sha":"9bd3120f1769cd9c6107b3159a315d30252c637f","author":{"email":"f2a8af7cbb9c93dd8bf464f7a03d2d25c20b4525@aucklanduni.ac.nz","name":"Eric"},"message":"Stack-ish implementation of checking if a linked list is Palindrome","distinct":true,"url":"https://api.github.com/repos/Lubndub/LeetCode/commits/9bd3120f1769cd9c6107b3159a315d30252c637f"},{"sha":"a6793253a472c7ce0a465375c3fac41b96ac52a5","author":{"email":"f2a8af7cbb9c93dd8bf464f7a03d2d25c20b4525@aucklanduni.ac.nz","name":"Eric"},"message":"Stack-ish implementation of checking if a linked list is Palindrome","distinct":true,"url":"https://api.github.com/repos/Lubndub/LeetCode/commits/a6793253a472c7ce0a465375c3fac41b96ac52a5"}]}