Prob 0008 ‐ Largest Product in a Series - maccergit/Euler GitHub Wiki

Nothing special here : iterate through the long string, taking slices. For each slice, iterate over the digits and multiply the digits together. Do all of this as a Python generator, and find the max value returned by the generator.

01

This turns out to be a slightly complex "one-liner" in Python. There's no real way to improve on this - it's more of an exercise in string slicing and type conversion :