{"push_id":911032364,"size":8,"distinct_size":1,"ref":"refs/heads/master","head":"4aa059bbac369178d439d0cab4bfa0e4ef12cd19","before":"f810b0947c08cd33f49fd5afa3338a303ad0e1b0","commits":[{"sha":"603b511c2a73225050d9616d0f0274d65660d0a0","author":{"email":"5687c2114b62f3f8dbea2cab5afb5ad7e7bfbc90@ch-nb-469.uptakenet.net","name":"David Danaher"},"message":"Problem 5 file created","distinct":false,"url":"https://api.github.com/repos/DavidJDanaher/euler-js/commits/603b511c2a73225050d9616d0f0274d65660d0a0"},{"sha":"3b50fbbad483cbc15e31366b8332c62b38b24b9f","author":{"email":"5687c2114b62f3f8dbea2cab5afb5ad7e7bfbc90@ch-nb-469.local","name":"David Danaher"},"message":"Problem 5: Complete","distinct":false,"url":"https://api.github.com/repos/DavidJDanaher/euler-js/commits/3b50fbbad483cbc15e31366b8332c62b38b24b9f"},{"sha":"e0e5411474fb7e5de5ad7e8b8aa076ea999cc321","author":{"email":"5687c2114b62f3f8dbea2cab5afb5ad7e7bfbc90@ch-nb-469.local","name":"David Danaher"},"message":"Modifying Problem 05 algorithm - unfinished","distinct":false,"url":"https://api.github.com/repos/DavidJDanaher/euler-js/commits/e0e5411474fb7e5de5ad7e8b8aa076ea999cc321"},{"sha":"7c5851644842105d6d95a8e6dd35c6ee7ba5bed0","author":{"email":"5687c2114b62f3f8dbea2cab5afb5ad7e7bfbc90@ch-nb-469.local","name":"David Danaher"},"message":"Problem 5 - Ordered list of all prime factors.\n\nWrong approach, starting over.","distinct":false,"url":"https://api.github.com/repos/DavidJDanaher/euler-js/commits/7c5851644842105d6d95a8e6dd35c6ee7ba5bed0"},{"sha":"3341adda664be07e4d66d320312805cb3ce24bb2","author":{"email":"5687c2114b62f3f8dbea2cab5afb5ad7e7bfbc90@ch-nb-469.uptakenet.net","name":"David Danaher"},"message":"Problem 5 - Factors returned in object form.\n\nTODO: Compare count of each factor in master list to count of each factor within each smaller set","distinct":false,"url":"https://api.github.com/repos/DavidJDanaher/euler-js/commits/3341adda664be07e4d66d320312805cb3ce24bb2"},{"sha":"4524206e77a877ec26b24ad0a5261f065d09b9a5","author":{"email":"5687c2114b62f3f8dbea2cab5afb5ad7e7bfbc90@ch-nb-469.uptakenet.net","name":"David Danaher"},"message":"Problem-05 - Almost....","distinct":false,"url":"https://api.github.com/repos/DavidJDanaher/euler-js/commits/4524206e77a877ec26b24ad0a5261f065d09b9a5"},{"sha":"74a13057a928243d12889ffc291dac9e83cb3c06","author":{"email":"5687c2114b62f3f8dbea2cab5afb5ad7e7bfbc90@ch-nb-469.local","name":"David Danaher"},"message":"Problem 5 - Refactored solution\n\nVast reduction in execution time","distinct":false,"url":"https://api.github.com/repos/DavidJDanaher/euler-js/commits/74a13057a928243d12889ffc291dac9e83cb3c06"},{"sha":"4aa059bbac369178d439d0cab4bfa0e4ef12cd19","author":{"email":"428a1578d8710cd413116f1852c2999575dd4a27@uptake.com","name":"David Danaher"},"message":"Merge pull request #1 from DavidJDanaher/Problem-05-refactor\n\nProblem 05 refactor","distinct":true,"url":"https://api.github.com/repos/DavidJDanaher/euler-js/commits/4aa059bbac369178d439d0cab4bfa0e4ef12cd19"}]}