Leetcode 3130. Find All Possible Stable Binary Arrays II

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.