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 a 0-indexed array of distinct integers nums.There is an element in nums that has the lowest value and an element that has the highest value. We call them the minimum and maximum respectively. Your goal is to remove both these elements from the array.A deletion is defined as either removing an element from the front of the array or removing an element from the back of the array.Return the minimum number of deletions it would take to remove both the minimum and maximum element from the array.

You are given a 0-indexed integer array nums and an integer k. You have a starting score of 0.In one operation:choose an index i such that 0 <= i < nums.length,increase your score by nums[i], andreplace nums[i] with ceil(nums[i] / 3).Return the maximum possible score you can attain after applying exactly k operations.

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 an array A of size NLet M be the minimum value present in the array initiallyIn one operation, you can choose an element Ai ( 1 ≤ i ≤ N ) and an integer X ( 1 ≤ X ≤ 100 ), and set Ai = X.Determine the minimum number of operations required to make M the maximum value in the array A.

class Solution { public: int minOperations(vector<int>& nums, int k) { } }; complete the function using folloiwing statement User 100231. Minimum Operations to Exceed Threshold Value I User Accepted:1 User Tried:3 Total Accepted:1 Total Submissions:3 Difficulty:Easy You are given a 0-indexed integer array nums, and an integer k. In one operation, you can remove one occurrence of the smallest element of nums. Return the minimum number of operations needed so that all elements of the array are greater than or equal to k. Example 1: Input: nums = [2,11,10,1,3], k = 10 Output: 3 Explanation: After one operation, nums becomes equal to [2, 11, 10, 3]. After two operations, nums becomes equal to [11, 10, 3]. After three operations, nums becomes equal to [11, 10]. At this stage, all the elements of nums are greater than or equal to 10 so we can stop. It can be shown that 3 is the minimum number of operations needed so that all elements of the array are greater than or equal to 10. Example 2: Input: nums = [1,1,2,4,9], k = 1 Output: 0 Explanation: All elements of the array are greater than or equal to 1 so we do not need to apply any operations on nums. Example 3: Input: nums = [1,1,2,4,9], k = 9 Output: 4 Explanation: only a single element of nums is greater than or equal to 9 so we need to apply the operations 4 times on nums. Constraints: 1 <= nums.length <= 50 1 <= nums[i] <= 109 1 <= k <= 109 The input is generated such that there is at least one index i such that nums[i] >= k.