Project Euler Problem Eight
The eighth problem of Project Euler is very simple. Find the greatest product of five consecutive digits in the 1000-digit number.
The problem at first however has a bit of a twist. You cannot represent that large a number as an integer in javascript. However, that is not needed at all. And this is an important lesson to take away from this problem, that you will definitely need later on.
I decided to place the 1000 digit number in a string, then split the string into a 1000-element array. Then checking a product of 4 consecutive digits is very simple.
As always the code is javascript, and can be run with nodejs.
