{"push_id":1020921524,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b0a9ec26bb54010c55668ea214dae1d2e61463cb","before":"b53254f1fa984741f385ae4da91281543457c688","commits":[{"sha":"b0a9ec26bb54010c55668ea214dae1d2e61463cb","author":{"email":"ef2839115a7f4c77a244643d7fd544f8aa16e4f8@gmail.com","name":"alyssacx"},"message":"longest substring without repeating characters, linked list cycle I & II","distinct":true,"url":"https://api.github.com/repos/alyssacx/practice-makes-perfect/commits/b0a9ec26bb54010c55668ea214dae1d2e61463cb"}]}