LeetCode 3499: Maximise Active Section with Trade

You're given a binary string where 1 represents an active section and 0 represents an inactive one. You get exactly one trade: Erase a block of 1s that has 0s on both sides. Fill a block of 0s that