{"push_id":2647080237,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3fadcf4f03080769da7277a2bdb5a0d6c16e7b57","before":"db9c0d5a6fe4f12315d276cbcc9db39768396d15","commits":[{"sha":"3fadcf4f03080769da7277a2bdb5a0d6c16e7b57","author":{"name":"octopopo","email":"99fab26f736d986a9e4587148593c8b733c16482@gmail.com"},"message":"Longest Palindromic Substring\n\nThe most intuitive way for me to do this is by dynammic programming. But it took a lot of time to solve the problem\n\nThe total running time will be O(n^2) where n is the size of the string","distinct":true,"url":"https://api.github.com/repos/octopopo/My-LeetCode/commits/3fadcf4f03080769da7277a2bdb5a0d6c16e7b57"}]}
{"actor":{"display_login":"octopopo"}}