Project Euler: Problem 8
Problem: Find the largest product of any 13 adjacent digits in a 1000 digit number. Solution: Move through the 1000 digit number with a sliding window of 13 digits. For…
Freelance PHP Developer based in Manchester, UK