Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Count Number of Nice Subarrays
Coding · Array · Hash Table · Math
- Count the Number of Beautiful Subarrays
Coding
- Count the Number of Good Subarrays
Coding
- Count the Number of Incremovable Subarrays I
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2348. Number of Zero-Filled Subarrays
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source