{"push_id":1854749137,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a5d3d758489002b5899348f47319989ab3b6600a","before":"8229548be3d0b660090c3e96819dac3fdd3dd3a8","commits":[{"sha":"a5d3d758489002b5899348f47319989ab3b6600a","author":{"name":"jinghuaz","email":"fde3964564ab4a3d1be5506a74abf5fefa1a4745@outlook.com"},"message":"Add two solutions for puzzle Palindrome Partitioning\n\nhttp://www.lintcode.com/en/problem/palindrome-partitioning/\n\nGiven a string s, partition s such that every substring of the partition is a palindrome.\nReturn all possible palindrome partitioning of s.\n\nExample\nGiven s = \"aab\", return:\n[\n  [\"aa\",\"b\"],\n  [\"a\",\"a\",\"b\"]\n]","distinct":true,"url":"https://api.github.com/repos/jinghzhu/Algorithm/commits/a5d3d758489002b5899348f47319989ab3b6600a"}]}
{"actor":{"display_login":"jinghzhu"}}