Project Euler 8 - Largest Product in a Series
Project Euler 8 - Largest Product in a Series
Official link: https://projecteuler.net/problem=8
Embedded Files
Thought Process
Thought Process
Go through the big number and use a modified digit sum function to calculate the digit product of each 13 digit number, only need to do 986 iterations
Interactive Code
Interactive Code
Input an integer (yourinput)
Code will output the largest digit product of length yourinput
Page updated
Google Sites
Report abuse