{"push_id":698735536,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ec561879fc2a1cc58e24979934505372cb5be0e9","before":"ca3371671a26eb8c2812269424328b649ae3b4a1","commits":[{"sha":"ec561879fc2a1cc58e24979934505372cb5be0e9","author":{"email":"6b1b67eb7ca9085d74e73cfa4d2a55d1c62caf63@ucsc.edu","name":"Jie Zhang"},"message":"Longest substring without repeating characters.","distinct":true,"url":"https://api.github.com/repos/jiegzh/LeetCode/commits/ec561879fc2a1cc58e24979934505372cb5be0e9"}]}