Computing persistence number of an integer

Question

I am trying to make a code that does the following:

Multiplying the digits of an integer and continuing the process gives the surprising result that the

Answer 1

You should use a while or for loop to multiply the digits instead of hardcoding what to do with the first, second and so on digits.

In pseudocode...

productSoFar = 1
digitsLeftToMultipy = #the number
while there are digits left to multiply:
    get the next digit and
    update produtsSoFar and digitsLeftToMultiply

Also, use

10 <= n < 100

instead of

n in range(10, 100)

So you only do a couple of comparisons instead of a sequential lookup that takes time proportional to the length of the range.