{"push_id":2904652633,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"d270de2b14689aeb31f001d67fac66e498defc38","before":"829bce1dc2ec62c2ee0ebf104dbeb3cabeabe8fb","commits":[{"sha":"3ce4390304f17ede89b7b9f1b8d28724dbab9488","author":{"name":"xlui","email":"2fc2e05fdd289475907ae1ac962549e667aa9816@gmail.com"},"message":"Problem 3. Longest Substring Without Repeating Characters","distinct":true,"url":"https://api.github.com/repos/xlui/dive-into-offer/commits/3ce4390304f17ede89b7b9f1b8d28724dbab9488"},{"sha":"d270de2b14689aeb31f001d67fac66e498defc38","author":{"name":"xlui","email":"2fc2e05fdd289475907ae1ac962549e667aa9816@gmail.com"},"message":"Problem 849. Maximize Distance to Closest Person","distinct":true,"url":"https://api.github.com/repos/xlui/dive-into-offer/commits/d270de2b14689aeb31f001d67fac66e498defc38"}]}
{"actor":{"display_login":"xlui"}}