Tap here to switch tabs
Problem
Submissions

Problem: Number of Zero-Filled Subarrays

Number of Zero-Filled Subarrays asks you to count every nonempty contiguous section of an integer array whose elements are all zero, including overlapping sections.

Statement

Given an integer array nums, return the total number of subarrays filled entirely with 00.

Note: A subarray is a contiguous non empty sequence of elements within an array.

Constraints:

  • 1≤1 \leq nums.length ≤105\leq 10^5

  • −109≤-10^9 \leq nums[i] ≤109\leq 10^9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Number of Zero-Filled Subarrays

Number of Zero-Filled Subarrays asks you to count every nonempty contiguous section of an integer array whose elements are all zero, including overlapping sections.

Statement

Given an integer array nums, return the total number of subarrays filled entirely with 00.

Note: A subarray is a contiguous non empty sequence of elements within an array.

Constraints:

  • 1≤1 \leq nums.length ≤105\leq 10^5

  • −109≤-10^9 \leq nums[i] ≤109\leq 10^9