{"push_id":623005694,"size":2,"distinct_size":2,"ref":"refs/heads/problem-4","head":"8f856971308eb55d4ce59e0ff94c9d94e42692cb","before":"ce35970887842365ea8f90d3ab0d510b0f559cb1","commits":[{"sha":"00da9444c083ab16f5255dc9f2497981cc03c720","author":{"email":"cbdb0cc7f3f5b4be81a75fa7242590e3e9882e1e@oder.us","name":"Charles Oder"},"message":"Problem 4: Added method to get the largest palindrom of products of n-length integers","distinct":true,"url":"https://api.github.com/repos/charles-oder/Project-Euler-Java/commits/00da9444c083ab16f5255dc9f2497981cc03c720"},{"sha":"8f856971308eb55d4ce59e0ff94c9d94e42692cb","author":{"email":"cbdb0cc7f3f5b4be81a75fa7242590e3e9882e1e@oder.us","name":"Charles Oder"},"message":"Problem 4: added test for problem solution","distinct":true,"url":"https://api.github.com/repos/charles-oder/Project-Euler-Java/commits/8f856971308eb55d4ce59e0ff94c9d94e42692cb"}]}