{"push_id":2736121450,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"daee4c6301221da5eadb711da285624da765fbcd","before":"41d274affe350cd9d7d6307833cc7c6b134a3899","commits":[{"sha":"daee4c6301221da5eadb711da285624da765fbcd","author":{"name":"contactaditya","email":"c44757238b7938e78ed11963a134b8d7f102ffba@gmail.com"},"message":"This is a program to return the minimum cuts needed for a palindrome partitioning of the string.","distinct":true,"url":"https://api.github.com/repos/contactaditya/Interview-Preparation/commits/daee4c6301221da5eadb711da285624da765fbcd"}]}
{"actor":{"display_login":"contactaditya"}}