Imagine a long string of digits as a tape with a window of length k moving across it. For each window, multiply all digits inside it and look for the largest product. Write a function largest_series_product that returns the maximum product among all groups of k consecutive digits in digits.

def largest_series_product(digits: str, k: int) -> int: