Search
⌘K

Leetcode 2348. Number of Zero-Filled Subarrays

Count the total number of contiguous subarrays made entirely of zeros by scanning for maximal runs of consecutive zeros and summing the number of subarrays each run contributes (for a run of length L that’s L*(L+1)/2). This can be done in linear time with constant extra space.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.