{"push_id":1288925780,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"59d593b6d25bb88d8ccc5efd747ac1660cb7f2aa","before":"24c309b9453b76f3ad77ff908714cbd091e58eec","commits":[{"sha":"59d593b6d25bb88d8ccc5efd747ac1660cb7f2aa","author":{"name":"Yanzhe Chen","email":"af6bd10323b59cccb38530a61e1dbd42793a9397@gmail.com"},"message":"Refine Problem 333. Largest BST Subtree","distinct":true,"url":"https://api.github.com/repos/yanzhe-chen/leetcode/commits/59d593b6d25bb88d8ccc5efd747ac1660cb7f2aa"}]}
{"actor":{"display_login":"yanzhe-chen"}}