{"push_id":3967192057,"size":2,"distinct_size":1,"ref":"refs/heads/development","head":"07a4a6ab053f9df566879d7d06c59bf21892180d","before":"429b5730c0dcb963490243252d01c039331ee710","commits":[{"sha":"b3715d5dc4dbc84c594ad615d17625f2079b662f","author":{"name":"Alan Lee","email":"a9dba696706c01b31538618fe1f8c8dda5f793ac@gmail.com"},"message":"feat: solution for maximum sub array","distinct":false,"url":"https://api.github.com/repos/mralanlee/leetcode/commits/b3715d5dc4dbc84c594ad615d17625f2079b662f"},{"sha":"07a4a6ab053f9df566879d7d06c59bf21892180d","author":{"name":"Kyle Oldham","email":"1c1463e213672f882e4102d180da0b762d84d15f@gmail.com"},"message":"Merge pull request #4 from mralanlee/53-maximum-subarray\n\nfeat: solution for maximum sub array","distinct":true,"url":"https://api.github.com/repos/mralanlee/leetcode/commits/07a4a6ab053f9df566879d7d06c59bf21892180d"}]}
{"actor":{"display_login":"kyleoldham"}}