Leetcode 1018. Binary Prefix Divisible By 5
Given a binary array, return for each prefix whether the integer value of that binary prefix is divisible by 5. The key is to update the running value modulo 5 as you append bits to avoid large numbers (n up to 10^5).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.