Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3129. Find All Possible Stable Binary Arrays I
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.