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 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 sorted in non-decreasing order.Build and return an integer array result with the same length as nums such that result[i] is equal to the summation of absolute differences between nums[i] and all the other elements in the array.In other words, result[i] is equal to sum(|nums[i]-nums[j]|) where 0 <= j < nums.length and j != i (0-indexed). Example 1:Input: nums = [2,3,5]Output: [4,3,5]Explanation: Assuming the arrays are 0-indexed, thenresult[0] = |2-2| + |2-3| + |2-5| = 0 + 1 + 3 = 4,result[1] = |3-2| + |3-3| + |3-5| = 1 + 0 + 2 = 3,result[2] = |5-2| + |5-3| + |5-5| = 3 + 2 + 0 = 5.Example 2:Input: nums = [1,4,6,8,10]Output: [24,15,13,15,21]

You are given a 0-indexed integer array nums having length n, an integer indexDifference, and an integer valueDifference.Your task is to find two indices i and j, both in the range [0, n - 1], that satisfy the following conditions:abs(i - j) >= indexDifference, andabs(nums[i] - nums[j]) >= valueDifferenceReturn an integer array answer, where answer = [i, j] if there are two such indices, and answer = [-1, -1] otherwise. If there are multiple choices for the two indices, return any of them.Note: i and j may be equal. Example 1:Input: nums = [5,1,4,1], indexDifference = 2, valueDifference = 4Output: [0,3]Explanation: In this example, i = 0 and j = 3 can be selected.abs(0 - 3) >= 2 and abs(nums[0] - nums[3]) >= 4.Hence, a valid answer is [0,3].[3,0] is also a valid answer.Example 2:Input: nums = [2,1], indexDifference = 0, valueDifference = 0Output: [0,0]Explanation: In this example, i = 0 and j = 0 can be selected.abs(0 - 0) >= 0 and abs(nums[0] - nums[0]) >= 0.Hence, a valid answer is [0,0].Other valid answers are [0,1], [1,0], and [1,1].Example 3:Input: nums = [1,2,3], indexDifference = 2, valueDifference = 4Output: [-1,-1]Explanation: In this example, it can be shown that it is impossible to find two indices that satisfy both conditions.Hence, [-1,-1] is returned. Constraints:1 <= n == nums.length <= 1050 <= nums[i] <= 1090 <= indexDifference <= 1050 <= valueDifference <= 109

Sample Input 1:26 31 2 3 4 5 65 210 9 8 7 6Sample Output 1:1 2 3 4 6 510 9 8 6 7Explanation 1:For the first test case, Considering 0-based indexing we have M = 3 so the subarray[M+1 … N-1] has to be reversed.Therefore the required output will be {1, 2, 3, 4, 6, 5}.For the second test case, Considering 0-based indexing we have M = 2 so the subarray[M+1 … N-1] has to be reversed.Therefore the required output will be {10, 9, 8, 6, 7}.Sample Input 2:27 31 4 5 6 6 7 7 9 310 4 5 2 3 6 1 3 6Sample Output 2: 1 4 5 6 7 7 6 10 4 5 2 6 3 1 6 3

Little R is a magician who likes non-decreasing arrays. She has an array of length n𝑛, initially as a1,…,an𝑎1,…,𝑎𝑛, in which each element is an integer between [1,m][1,𝑚]. She wants it to be non-decreasing, i.e., a1≤a2≤…≤an𝑎1≤𝑎2≤…≤𝑎𝑛.To do this, she can perform several magic tricks. Little R has a fixed array b1…bm𝑏1…𝑏𝑚 of length m𝑚. Formally, let's define a trick as a procedure that does the following things in order:Choose a set S⊆{1,2,…,n}𝑆⊆{1,2,…,𝑛}.For each u∈S𝑢∈𝑆, assign au𝑎𝑢 with bau𝑏𝑎𝑢.Little R wonders how many tricks are needed at least to make the initial array non-decreasing. If it is not possible with any amount of tricks, print −1−1 instead.InputEach test contains multiple test cases. The first line contains the number of test cases t𝑡 (1≤t≤1041≤𝑡≤104). The description of the test cases follows.The first line of each test case contains two integers n𝑛 and m𝑚 (1≤n≤1061≤𝑛≤106, 1≤m≤1061≤𝑚≤106) — the length of the initial array and the range of the elements in the array.The second line of each test case contains n𝑛 integers a1,…,an𝑎1,…,𝑎𝑛 (1≤ai≤m1≤𝑎𝑖≤𝑚) — the initial array.The third line of each test case contains m𝑚 integers b1,…,bm𝑏1,…,𝑏𝑚 (1≤bi≤m1≤𝑏𝑖≤𝑚) — the fixed magic array.It is guaranteed that the sum of n𝑛 over all test cases does not exceed 106106 and the sum of m𝑚 over all test cases does not exceed 106106.OutputFor each test case, output a single integer: the minimum number of tricks needed, or −1−1 if it is impossible to make a1,…,an𝑎1,…,𝑎𝑛 non-decreasing.ExampleinputCopy35 81 6 3 7 12 3 5 8 7 1 5 63 31 3 22 1 310 102 8 5 4 8 4 1 5 10 106 7 2 6 3 4 1 1 3 5outputCopy3-13