{"push_id":1318595713,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8c8f5fa637d55c85c71867ec488605cdd0f9b53e","before":"36db6b47611a6b64aedb5ee5a91e548d81d04309","commits":[{"sha":"8c8f5fa637d55c85c71867ec488605cdd0f9b53e","author":{"name":"ashokkyadav","email":"1cf75b27ead08b88a33399d8a63199d0d1cf13d4@gmail.com"},"message":"J Kadane's algorithm to find maximum subarray","distinct":true,"url":"https://api.github.com/repos/ashokkyadav/WorkNLearn/commits/8c8f5fa637d55c85c71867ec488605cdd0f9b53e"}]}
{"actor":{"display_login":"ashokkyadav"}}