Available question text
Count the number of binary arrays with exactly zero zeros and one ones such that no run of identical bits exceeds length limit (equivalently, every subarray longer than limit contains both 0 and 1), returning the result mod 1e9+7. The core challenge is combinatorial/DP counting of arrangements that partition zeros and ones into alternating blocks with lengths bounded by limit.
Related questions
Continue with questions that share topics or the same question type.
- Find All Possible Stable Binary Arrays I
Coding
- All Possible Full Binary Trees
Coding
- Find All Possible Recipes from Given Supplies
Coding · Array · Directed Acyclic Graph · Graph Theory
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
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 3130. Find All Possible Stable Binary Arrays II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source