It's actually a DSA question. But I’m interested in understanding how this problem can be approached using combinatorics (counting arrangements with constraints on consecutive elements).
#(DP/Combinatorics) Count Stable Binary Arrays with Fixed 0s/1s and Subarray Limit
vagrant tree
timber bloomBOT
median burrow
It's actually a DSA question. But I’m interested in understanding how this probl...
what sizes of zero, one, and limit do we need to handle?
i can perhaps write a generating function
vagrant tree
what sizes of `zero`, `one`, and `limit` do we need to handle?
1<= zero, one, limit <=1000
median burrow
ok i have a decent way to do it without DP (well actually the DP is kinda just hidden). let me write it up
vagrant tree
Okay.. go with it