Minimum Sum of Mountain Triplets IIMy SubmissionsBack to ContestUser Accepted:8130User Tried:10428Total Accepted:8348Total Submissions:17555Difficulty:MediumYou are given a 0-indexed array nums of integers.A triplet of indices (i, j, k) is a mountain if:i < j < knums[i] < nums[j] and nums[k] < nums[j]Return the minimum possible sum of a mountain triplet of nums. If no such triplet exists, return -1. Example 1:Input: nums = [8,6,1,5,3]Output: 9Explanation: Triplet (2, 3, 4) is a mountain triplet of sum 9 since: - 2 < 3 < 4- nums[2] < nums[3] and nums[4] < nums[3]And the sum of this triplet is nums[2] + nums[3] + nums[4] = 9. It can be shown that there are no mountain triplets with a sum of less than 9.Example 2:Input: nums = [5,4,8,7,10,2]Output: 13Explanation: Triplet (1, 3, 5) is a mountain triplet of sum 13 since: - 1 < 3 < 5- nums[1] < nums[3] and nums[5] < nums[3]And the sum of this triplet is nums[1] + nums[3] + nums[5] = 13. It can be shown that there are no mountain triplets with a sum of less than 13.Example 3:Input: nums = [6,5,4,3,4,5]Output: -1Explanation: It can be shown that there are no mountain triplets in nums. Constraints:3 <= nums.length <= 1051 <= nums[i] <= 108

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.Notice that the solution set must not contain duplicate triplets. Example 1:Input: nums = [-1,0,1,2,-1,-4]Output: [[-1,-1,2],[-1,0,1]]Explanation: nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0.nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0.nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0.The distinct triplets are [-1,0,1] and [-1,-1,2].Notice that the order of the output and the order of the triplets does not matter.Example 2:Input: nums = [0,1,1]Output: []Explanation: The only possible triplet does not sum up to 0.Example 3:Input: nums = [0,0,0]Output: [[0,0,0]]Explanation: The only possible triplet sums up to 0. Constraints:3 <= nums.length <= 3000-105 <= nums[i] <= 105

100232. Minimum Operations to Exceed Threshold Value II User Accepted:4338 User Tried:7626 Total Accepted:4413 Total Submissions:13969 Difficulty:Medium You are given a 0-indexed integer array nums, and an integer k. In one operation, you will: Take the two smallest integers x and y in nums. Remove x and y from nums. Add min(x, y) * 2 + max(x, y) anywhere in the array. Note that you can only apply the described operation if nums contains at least two elements. 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: 2 Explanation: In the first operation, we remove elements 1 and 2, then add 1 * 2 + 2 to nums. nums becomes equal to [4, 11, 10, 3]. In the second operation, we remove elements 3 and 4, then add 3 * 2 + 4 to nums. nums becomes equal to [10, 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 2 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 = 20 Output: 4 Explanation: After one operation, nums becomes equal to [2, 4, 9, 3]. After two operations, nums becomes equal to [7, 4, 9]. After three operations, nums becomes equal to [15, 9]. After four operations, nums becomes equal to [33]. At this stage, all the elements of nums are greater than 20 so we can stop. It can be shown that 4 is the minimum number of operations needed so that all elements of the array are greater than or equal to 20. Constraints: 2 <= nums.length <= 2 * 105 1 <= nums[i] <= 109 1 <= k <= 109 The input is generated such that an answer always exists. That is, there exists some sequence of operations after which all elements of the array are greater than or equal to k. complete the function class Solution { public: int minOperations(vector<int>& nums, int k) { } };

Problem StatementWrite a program that accepts sets of three numbers, and prints the second-maximum number among the three.InputFirst line contains the number of triples, N.The next N lines which follow each have three space separated integers.OutputFor each of the N triples, output one new line which contains the second-maximum integer among the three.Constraints1 ≤ N ≤ 61 ≤ every integer ≤ 10000The three integers in a single triplet are all distinct. That is, no two of them are equal.Sample 1:InputOutput31 2 310 15 5100 999 500210500

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.

You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).Return the total number of good pairs. Example 1:Input: nums1 = [1,3,4], nums2 = [1,3,4], k = 1Output: 5Explanation:The 5 good pairs are (0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).Example 2:Input: nums1 = [1,2,4,12], nums2 = [2,4], k = 3Output: 2Explanation:The 2 good pairs are (3, 0) and (3, 1). Constraints:1 <= n, m <= 1051 <= nums1[i], nums2[j] <= 1061 <= k <= 103C++ 1class Solution {2public:3    long long numberOfPairs(vector<int>& nums1, vector<int>& nums2, int k) {4        5   }6};