{"push_id":2082125087,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"928e23acdeed58f5889a1b4bc1bb55b5372b8d61","before":"16effe36d39bd58f201d643b90d25c43375fd411","commits":[{"sha":"928e23acdeed58f5889a1b4bc1bb55b5372b8d61","author":{"name":"Rishabh Mishra","email":"3b0f1c16b0ce6f1b67ee767a0eea0044a636ef89@gmail.com"},"message":"Adding Solution to Maximum Subarray Sum Problem","distinct":true,"url":"https://api.github.com/repos/rishabhzn200/Leetcode/commits/928e23acdeed58f5889a1b4bc1bb55b5372b8d61"}]}
{"actor":{"display_login":"rishabhzn200"}}