{"push_id":2725077498,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"15a4dcc44881118ce5288a2af61c45d6656a742d","before":"d61ecfaa42b58bd255443210916c62351d43b407","commits":[{"sha":"15a4dcc44881118ce5288a2af61c45d6656a742d","author":{"name":"Frapples","email":"ba27cdf88e922919f7a24c7bdb8f515670078810@outlook.com"},"message":"003 Longest Substring Without Repeating Characters","distinct":true,"url":"https://api.github.com/repos/frapples/java-toy-leetcode-algorithm/commits/15a4dcc44881118ce5288a2af61c45d6656a742d"}]}
{"actor":{"display_login":"frapples"}}