Available question text
Count how many binary arrays of length zero+one contain exactly zero zeros and one ones and have no run of identical bits longer than limit (equivalently, every subarray longer than limit must contain both 0 and 1). Return the count modulo 10^9+7 (constraints: zero, one, limit ≤ 200).
Related questions
Continue with questions that share topics or the same question type.
- Find All Possible Stable Binary Arrays II
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 3129. Find All Possible Stable Binary Arrays I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source