Project Euler 8 - Largest product in a series
I think your current code is working- it seems like it’s getting the same answer as other people who say they solved it (i.e. 23514624000). So I think it belongs here.
Right now, if you wanted to use this for any string of digits and any length of consecutive numbers, it would be \$O(n^2)\$ time complexity because you would have to multiply at most (length-of-series / 2) * (length-of-series / 2) numbers. Something you could use to fix that is a deque from the collections module. You could use it to know what to divide and what to multiply to get the current product, and you could also use it to track how many zeros are in the current sequence of consecutive numbers. If you do this then you only need to multiply or divide at most (length-of-series * 2) - 1 numbers, so it’s \$O(n)\$.
import collections

def find_max_prod(n, series):
    
    if len(series) &lt; n:
        return 0
        
    current_nums = collections.deque(maxlen=n)
    zero_count = 0
    max_prod = 1
    my_iter = iter(series)
    
    for _ in range(n):
        next_n = int(next(my_iter))
        max_prod *= next_n
        current_nums.append(next_n)
        if next_n == 0:
            zero_count += 1

    current_prod = max_prod if max_prod &gt; 0 else 1
    
    for str_n in my_iter:
        n_out = current_nums.popleft()
        n_in = int(str_n)
        current_nums.append(n_in)
        if n_in == 0:
            zero_count += 1
        if n_out == 0:
            zero_count -= 1
        else:
            current_prod //= n_out
        if n_in != 0:
            current_prod *= n_in
            if current_prod &gt; max_prod and zero_count == 0:
                max_prod = current_prod
    
    return max_prod

or with Toby Speight‘s suggestion:
import collections

def max_of_substr(n, substr):
    current_nums = collections.deque(maxlen=n)
    my_iter = iter(substr)
    max_prod = 1
    
    for _ in range(n):
        next_n = int(next(my_iter))
        max_prod *= next_n
        current_nums.append(next_n)
    
    current_prod = max_prod

    for str_n in my_iter:
        n_out = current_nums.popleft()
        n_in = int(str_n)
        current_nums.append(n_in)
        current_prod //= n_out
        current_prod *= n_in
        if current_prod &gt; max_prod:
            max_prod = current_prod
    
    return max_prod

def find_max_prod(n, series):
    max_substr_generator = (
        max_of_substr(n, substr)
        for substr in series.split('0')
        if len(substr) &gt;= n
        )
    return max(max_substr_generator, default=0)