You are given a binary array nums.You can do the following operation on the array any number of times (possibly zero):Choose any 3 consecutive elements from the array and flip all of them.Flipping an element means changing its value from 0 to 1, and from 1 to 0.Return the minimum number of operations required to make all elements in nums equal to 1. If it is impossible, return -1. Example 1:Input: nums = [0,1,1,1,0,0]Output: 3Explanation:We can do the following operations:Choose the elements at indices 0, 1 and 2. The resulting array is nums = [1,0,0,1,0,0].Choose the elements at indices 1, 2 and 3. The resulting array is nums = [1,1,1,0,0,0].Choose the elements at indices 3, 4 and 5. The resulting array is nums = [1,1,1,1,1,1].Example 2:Input: nums = [0,1,1,1]Output: -1Explanation:It is impossible to make all elements equal to 1. Constraints:3 <= nums.length <= 1050 <= nums[i] <= 1Python3 1class Solution:2    def minOperations(self, nums: List[int]) -> int:

You are given an integer array nums. In one operation, you can add or subtract 1 from any element of nums.Return the minimum number of operations to make all elements of nums divisible by 3. Example 1:Input: nums = [1,2,3,4]Output: 3Explanation:All array elements can be made divisible by 3 using 3 operations:Subtract 1 from 1.Add 1 to 2.Subtract 1 from 4.Example 2:Input: nums = [3,6,9]Output: 0 Constraints:1 <= nums.length <= 501 <= nums[i] <= 50Python3 1class Solution:2    def minimumOperations(self, nums: List[int]) -> int:3

Given an array of N integers containing only 0 or 1. You can do the following operations on the array:swap elements at two indiceschoose one index and change its value from 0 to 1 or vice-versa.You have to do the minimum number of the above operations such that the final array is non-decreasing.Note Consider 1 based Array-indexing

You are given an N x M binary matrix called "image". You need to perform the following operations on the matrix (in order) and return the resulting image:Flip the image horizontally: This involves reversing the order of elements in each row of the matrix. For example, [1,0,1,0,0,0] becomes [0,0,0,1,0,1]Invert the image: This involves replacing 0s with 1s and 1s with 0s in the entire matrix. For example, [0,0,0,1,0,1] becomes [1,1,1,0,1,0]Input FormatLine of input contains N - number of rows and M - number of columns. The next N lines contains M integers each denoting the elements of the matrix image.Output FormatYou have to print the resultant matrix image.

You are given a 0-indexed integer array nums. A subarray s of length m is called alternating if:m is greater than 1.s1 = s0 + 1.The 0-indexed subarray s looks like [s0, s1, s0, s1,...,s(m-1) % 2]. In other words, s1 - s0 = 1, s2 - s1 = -1, s3 - s2 = 1, s4 - s3 = -1, and so on up to s[m - 1] - s[m - 2] = (-1)m.Return the maximum length of all alternating subarrays present in nums or -1 if no such subarray exists.A subarray is a contiguous non-empty sequence of elements within an array. Example 1:Input: nums = [2,3,4,3,4]Output: 4Explanation: The alternating subarrays are [3,4], [3,4,3], and [3,4,3,4]. The longest of these is [3,4,3,4], which is of length 4.Example 2:Input: nums = [4,5,6]Output: 2Explanation: [4,5] and [5,6] are the only two alternating subarrays. They are both of length 2.

You are given an array nums, where each number in the array appears either once or twice.Return the bitwise XOR of all the numbers that appear twice in the array, or 0 if no number appears twice. Example 1:Input: nums = [1,2,1,3]Output: 1Explanation:The only number that appears twice in nums is 1.Example 2:Input: nums = [1,2,3]Output: 0Explanation:No number appears twice in nums.Example 3:Input: nums = [1,2,2,1]Output: 3Explanation:Numbers 1 and 2 appeared twice. 1 XOR 2 == 3. Constraints:1 <= nums.length <= 501 <= nums[i] <= 50Each number in nums appears either once or twice.