{"push_id":2754807822,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d7ea25c2fd7035616aec084b72ec333389df4f39","before":"7ec3959193d8dc4f8d512f4f1ef5671cdfb2c598","commits":[{"sha":"d7ea25c2fd7035616aec084b72ec333389df4f39","author":{"name":"saleh","email":"90a1f29e13d527838b37bad12b7829920553665a@gmail.com"},"message":"Add Solution for 325. Maximum Size Subarray Sum Equals K","distinct":true,"url":"https://api.github.com/repos/ATM-SALEH/panacea-leetcode/commits/d7ea25c2fd7035616aec084b72ec333389df4f39"}]}
{"actor":{"display_login":"ATM-SALEH"}}