Available question text
Count the number of non-empty contiguous subarrays in a binary array whose elements sum to a given goal — equivalently, count pairs of indices where the difference of their prefix sums equals goal (n ≤ 3×10^4).
Related questions
Continue with questions that share topics or the same question type.
- Binary Search Tree to Greater Sum Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Find Subarrays With Equal Sum
Coding
- Find X-Sum of All K-Long 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 930. Binary Subarrays With Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source