You are given an integer array nums and two integers cost1 and cost2. You are allowed to perform either of the following operations any number of times:Choose an index i from nums and increase nums[i] by 1 for a cost of cost1.Choose two different indices i, j, from nums and increase nums[i] and nums[j] by 1 for a cost of cost2.Return the minimum cost required to make all elements in the array equal.Since the answer may be very large, return it modulo 109 + 7. Example 1:Input: nums = [4,1], cost1 = 5, cost2 = 2Output: 15Explanation:The following operations can be performed to make the values equal:Increase nums[1] by 1 for a cost of 5. nums becomes [4,2].Increase nums[1] by 1 for a cost of 5. nums becomes [4,3].Increase nums[1] by 1 for a cost of 5. nums becomes [4,4].The total cost is 15.Example 2:Input: nums = [2,3,3,3,5], cost1 = 2, cost2 = 1Output: 6Explanation:The following operations can be performed to make the values equal:Increase nums[0] and nums[1] by 1 for a cost of 1. nums becomes [3,4,3,3,5].Increase nums[0] and nums[2] by 1 for a cost of 1. nums becomes [4,4,4,3,5].Increase nums[0] and nums[3] by 1 for a cost of 1. nums becomes [5,4,4,4,5].Increase nums[1] and nums[2] by 1 for a cost of 1. nums becomes [5,5,5,4,5].Increase nums[3] by 1 for a cost of 2. nums becomes [5,5,5,5,5].The total cost is 6.Example 3:Input: nums = [3,5,3], cost1 = 1, cost2 = 3Output: 4Explanation:The following operations can be performed to make the values equal:Increase nums[0] by 1 for a cost of 1. nums becomes [4,5,3].Increase nums[0] by 1 for a cost of 1. nums becomes [5,5,3].Increase nums[2] by 1 for a cost of 1. nums becomes [5,5,4].Increase nums[2] by 1 for a cost of 1. nums becomes [5,5,5].The total cost is 4. Constraints:1 <= nums.length <= 1051 <= nums[i] <= 1061 <= cost1 <= 1061 <= cost2 <= 106

You are given an array of integers nums of length n.The cost of an array is the value of its first element. For example, the cost of [1,2,3] is 1 while the cost of [3,4,1] is 3.You need to divide nums into 3 disjoint contiguous subarrays.Return the minimum possible sum of the cost of these subarrays.

Redundant ArrayChef has an array 𝐴A containing 𝑁N positive integers.He can perform the following operation on the array as many times as he likes:Choose integers 𝐿L and 𝑅R such that 1≤𝐿≤𝑅≤𝑁1≤L≤R≤N;Choose a positive integer 𝑥x;For every index 𝑖i from 𝐿L to 𝑅R (inclusive of both), set 𝐴𝑖=𝑥A i​ =x.The cost of such an operation is (𝑅−𝐿+1)⋅𝑥(R−L+1)⋅x.Find the minimum cost required to make all the elements of 𝐴A equal.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists two lines of input.The first line of each test case contains a single integer 𝑁N — the size of the array.The second line contains 𝑁N space-separated integers 𝐴1,𝐴2,…,𝐴𝑁A 1​ ,A 2​ ,…,A N​ .Output FormatFor each test case, output on a new line the minimum cost needed to make all the elements of 𝐴A equal.Constraints1≤𝑇≤2×1051≤T≤2×10 5 1≤𝑁≤2×1051≤N≤2×10 5 1≤𝐴𝑖≤𝑁1≤A i​ ≤NThe sum of 𝑁N over all test cases does not exceed 2×1052×10 5 Sample 1:InputOutput352 4 3 2 233 3 371 3 7 5 1 4 3405

Given an integer array A of length N. Where Ai is the cost of stepping on the ith stair.From ith stair, you can go to i+1th or i+2th numbered stair.Initially, you are at 1st stair find the minimum cost to reach Nth stair.Problem Constraints2 <= N <= 1051 <= Ai <= 104Input FormatThe first and only argument is an integer array A.Output FormatReturn an integer.Example InputInput 1:A = [1, 2, 1, 3]Input 2:A = [1, 2, 3, 4]Example OutputOutput 1:5Output 2:7Example ExplanationExplanation 1:1 -> 3 -> 4Explanation 2:1 -> 2 -> 4

Geek and Geekina, the top students in their class, were vying for the leadership role. To determine the leader, their teacher assigned them arrays, arr1[] to Geek and arr2[] to Geekina of size n. The task was simple: calculate the cost of each array. The cost of the array is defined as the summing of VAL(a[i]) for each i in [0,n-1].VAL(x)=minimum number of operations to convert x to 0 or 1.In each operation, you can take any prime factor of the remaining value and subtract it from x.For example,  if we have 6, and if we subtract 3 from it, then our remaining value will become 3 and then we can not subtract 2 from it because 2 is not the prime factor of the current value of 3.Due to their busy schedules, Geek and Geekina have sought assistance in calculating the cost of their arrays. So your task is to return  1 if the cost of arr1 is less than or equal to the cost of arr2.  otherwise, it should return 0. Example 1:Input:n=3arr1={1,1,2}arr2={1,1,1}Output:0Explanation:VAL(1) is 0 and VAL(2) is 1 (2->0).Now Cost of arr1 is 1 and Cost of arr2 is 0.So 0 is the answer Cost(arr1)>Cost(arr2).

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