Minimum Operations to Make Binary Array Elements Equal to One I

Given a binary array, find the minimum number of operations that flip any 3 consecutive bits so that all elements become 1, or return -1 if impossible. The core challenge is choosing an optimal sequence of overlapping length-3 flips — solvable by treating flips mod 2 (a linear system over GF(2)) or by a greedy sliding-window/difference approach to track active flips in O(n).