{"push_id":1249676368,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"77c8f28e29aec4210a433525aed8c0f7a08ccc56","before":"75e9a7d3e01c670ee5964763cf0b4001aa57bf62","commits":[{"sha":"77c8f28e29aec4210a433525aed8c0f7a08ccc56","author":{"name":"tyang020","email":"65ce1add3755955a0c6bf984683e9c445f0868c9@outlook.com"},"message":"[368. Largest Divisible Subset][Accepted]committed by LeetCode Extension","distinct":true,"url":"https://api.github.com/repos/tyang020/Leetcode/commits/77c8f28e29aec4210a433525aed8c0f7a08ccc56"}]}
{"actor":{"display_login":"tyang020"}}