{"push_id":1260679148,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"25c03d7299eead34455eb1d675be25cdabfa5686","before":"48e3500dcf5db989f887dc28bddc7eed10d19492","commits":[{"sha":"25c03d7299eead34455eb1d675be25cdabfa5686","author":{"name":"Nitish Shandilya","email":"ecec61592ec40fe3a3d1e6153c282eb5395c07ca@gmail.com"},"message":"min cuts to make palindrome with n^2 time complexity","distinct":true,"url":"https://api.github.com/repos/NitishShandilya/CodeSamples/commits/25c03d7299eead34455eb1d675be25cdabfa5686"}]}
{"actor":{"display_login":"NitishShandilya"}}