Project Euler/8
From charlesreid1
Question
We are given a 1000 digit number.
The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.
We are asked: find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
Approach
The approach here is similar to the palindrome product problem: we run through the 1000 digit number, extracting 13-digit strings, for a total of 1000 - 13 = 987 different numbers. These should be sorted in order of greatest to smallest digits, and the maximum kept.