{"push_id":2448076089,"size":2,"distinct_size":1,"ref":"refs/heads/master","head":"8910502152d09630329b893793482661f2c8943b","before":"357fdaf38110a28d2acb9fb2ba433a74cc786244","commits":[{"sha":"8dccddf615c51bff229711fe15b3ec369e3011e5","author":{"name":"Mohanasundaram Veeramuthu","email":"d2d52ecef1558af9ae08757ba59cccc865b87888@iacpublishinglabs.com"},"message":"leetcode - min-cost-climbing-stairs","distinct":false,"url":"https://api.github.com/repos/mveeramuthu/algo_and_ds/commits/8dccddf615c51bff229711fe15b3ec369e3011e5"},{"sha":"8910502152d09630329b893793482661f2c8943b","author":{"name":"Mohanasundaram Veeramuthu","email":"e68e1073925c158e21ec22a845bc9a614b8960af@gmail.com"},"message":"Merge pull request #3 from mveeramuthu/min-cost-climbing-stairs\n\nleetcode - min-cost-climbing-stairs","distinct":true,"url":"https://api.github.com/repos/mveeramuthu/algo_and_ds/commits/8910502152d09630329b893793482661f2c8943b"}]}
{"actor":{"display_login":"mveeramuthu"}}