Tag: 8
Project Euler Problem 8 Java
In this blog post we will be looking at problem 8 of Project Euler and we will program a solution in Java. The problem of Project Euler found here, below is the problem for quick lookup. The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8