{"push_id":1457214356,"size":1,"distinct_size":1,"ref":"refs/heads/first-pass","head":"1aeb72e0b996354dc63e99a9b72c018be5c6901f","before":"44c421e4932859507f7be02da88416adb58767b2","commits":[{"sha":"1aeb72e0b996354dc63e99a9b72c018be5c6901f","author":{"name":"zjydeveloper","email":"273f0a6f80887b6a36401169f96fb98e62a0c4ec@gmail.com"},"message":"3. Longest Substring Without Repeating Characters","distinct":true,"url":"https://api.github.com/repos/jzthinkgeek/LeetCode/commits/1aeb72e0b996354dc63e99a9b72c018be5c6901f"}]}
{"actor":{"display_login":"jzthinkgeek"}}