{"push_id":735948095,"size":2,"distinct_size":1,"ref":"refs/heads/master","head":"f4c36527612cdfcf13a1435fa0b777a436767d5c","before":"3461864ef301b260f7e0a2d899e916743c52667c","commits":[{"sha":"f5b748ce22a678198025d4deb6ae031c8afad489","author":{"email":"97ebab1d3b0692b8ae8cb51d10a632ee02ed15b3@gridiron-guru.com","name":"divideandconquer"},"message":"Adding a recursive solution along with an abstract factory that can return the requested parser type.","distinct":false,"url":"https://api.github.com/repos/divideandconquer/java-palindrome-example/commits/f5b748ce22a678198025d4deb6ae031c8afad489"},{"sha":"f4c36527612cdfcf13a1435fa0b777a436767d5c","author":{"email":"34644bfc7258b45f8779ad889f18ac34d9b11f70@users.noreply.github.com","name":"Kyle"},"message":"Merge pull request #3 from divideandconquer/recursive\n\nAdding a recursive solution along with an abstract factory that can r…","distinct":true,"url":"https://api.github.com/repos/divideandconquer/java-palindrome-example/commits/f4c36527612cdfcf13a1435fa0b777a436767d5c"}]}