{"push_id":1019210207,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"88311df321919234166f0bae6eb6cdbd9e445350","before":"dbf8bcf1764c39744cd4d6b7c569a5a998b614b8","commits":[{"sha":"88311df321919234166f0bae6eb6cdbd9e445350","author":{"email":"183da20e8c53089e13cfa899af7dfb9fbf29fa3b@gmail.com","name":"Pai-Wei Lai"},"message":"Create 003. Longest Substring Without Repeating Characters","distinct":true,"url":"https://api.github.com/repos/paiweilai/leetcode-python/commits/88311df321919234166f0bae6eb6cdbd9e445350"}]}