Project Euler 8: The Largest Product of 13 Adjacent Digits with a Zero-Counting Sliding Window
Largest product of 13 adjacent digits via a sliding window that tracks the zero count and nonzero-digit product separately. Why it never divides by zero, why 64-bit is needed, in C++17 and Python 3.
Project Euleralgorithmssliding window