Given an array A of size N, find the minimum cost to convert it to a ternary array B. A ternary array can only have 0 or 1 or 2. After conversion, ensure that A[i] != B[i]. The cost of converting A[i] to B[i] is | A[i] - B[i] |.Input FormatThe first line of input contains a single integer N - the size of the array and the second line contains array elements.Output FormatPrint the minimum cost to convert array A to B.Constraints1 <= N <= 10000-100000 <= A[i] <= 100000ExampleInput51 -1 2 0 5Output7ExplanationGiven A = {1, -1, 2, 0, 5} can be converted to B = {2, 0, 1, 1, 2}, with a cost of |1-2| + |-1-0| + |2-1| + |0-1| + |5-2| = 1 + 1 + 1 + 1 + 3 = 7.

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

Given a sorted array A of size N, along with an integer target K, implement Binary Search to find the target K in the given array.Input FormatThe first line of input contains an integer N - the size of an array and target K. The second line contains the elements of the array.Output FormatFor each iteration of Binary Search, print the values of low, high, and mid. At the end, if the target K is found in the array, print "True" otherwise, print "False".Constraints1 <= N <= 201 <= A[i] <= 103ExampleInput 19 121 4 6 7 10 11 12 20 23Output 10 8 45 8 6TrueInput 210 213 5 8 11 15 17 19 23 26 30Output 20 9 45 9 75 6 56 6 6False

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.

You are given an array of 0's and 1's. Sort the array in ascending order and print it.Note: Solve using two-pointer technique.Input FormatFirst line of input contains T - the number of test cases. Its followed by 2T lines, the first line contains N - the size of the array.The second line contains the elements of the array.Constraints1 <= T <= 10001 <= N <= 10000 <= A[i] <= 1Output FormatFor each test case, sort the array in ascending order and print it on a new line.Sample Input 0250 1 1 0 161 1 1 1 1 0Sample Output 00 0 1 1 10 1 1 1 1 1Explanation 0

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