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

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:

Given an array of integers called nums, you can perform the following operation while nums contains at least 2 elements:Choose the first two elements of nums and delete them.The score of the operation is the sum of the deleted elements.Your task is to find the maximum number of operations that can be performed, such that all operations have the same score.Return the maximum number of operations possible that satisfy the condition mentioned above.

You are given two integers n and x. You have to construct an array of positive integers nums of size n where for every 0 <= i < n - 1, nums[i + 1] is greater than nums[i], and the result of the bitwise AND operation between all elements of nums is x.Return the minimum possible value of nums[n - 1]. Example 1:Input: n = 3, x = 4Output: 6Explanation:nums can be [4,5,6] and its last element is 6.Example 2:Input: n = 2, x = 7Output: 15Explanation:nums can be [7,15] and its last element is 15. Constraints:1 <= n, x <= 108

Given an array of integers A, print true if we can partition the array into three non-empty subarrays with equal sums.Input FormatThe first line of the input contains an integer N. Second line of input contains an array of size N.Output FormatPrint true if we can partition the array, otherwise false.Constraints3 ≤ N ≤ 104-104 ≤ Ai ≤ 104ExampleInput103 3 6 5 -2 2 5 1 -9 4OutputtrueExplanation(3 + 3) = (6) = (5 - 2 + 2 + 5 + 1 - 9 + 4) = 6.

You are given an integer array nums of size n and a positive integer k.Divide the array into one or more arrays of size 3 satisfying the following conditions:Each element of nums should be in exactly one array.The difference between any two elements in one array is less than or equal to k.Return a 2D array containing all the arrays. If it is impossible to satisfy the conditions, return an empty array. And if there are multiple answers, return any of them.