Leetcode 3192. Minimum Operations to Make Binary Array Elements Equal to One II

Given a binary array where an operation toggles all elements from some chosen index to the end, find the minimum number of such suffix-flip operations to make every element 1. The core challenge is to choose optimal flip points — solvable greedily by scanning and tracking the current flip parity (or counting effective 0/1 transitions).