You are given a 0-indexed integer array nums. A pair of integers x and y is called a strong pair if it satisfies the condition:|x - y| <= min(x, y)You need to select two integers from nums such that they form a strong pair and their bitwise XOR is the maximum among all strong pairs in the array.Return the maximum XOR value out of all possible strong pairs in the array nums.Note that you can pick the same integer twice to form a pair

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};

You are given an array 𝐴A of size 𝑁N.You can rearrange the elements of 𝐴A as you want. After that, construct an array 𝐵B of size 𝑁N as:𝐵1=𝐴1B 1​ =A 1​ ;𝐵𝑖=𝐵𝑖−1B i​ =B i−1​ && 𝐴𝑖A i​ for all 2≤𝑖≤𝑁2≤i≤N, where && denotes the bitwise AND operator.Find the lexicographically largest possible array 𝐵B.For two arrays 𝑋X and 𝑌Y, both of size 𝑁N, the array 𝑋X is said to be lexicographically larger than array 𝑌Y, if, in the first position where 𝑋X and 𝑌Y differ, 𝑋𝑖>𝑌𝑖X i​ >Y i​ .Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of multiple lines of input.The first line of each test case contains 𝑁N, the size of the array 𝐴A.The second line of each test case contains 𝑁N space-separated integers 𝐴1,𝐴2,…,𝐴𝑁A 1​ ,A 2​ ,…,A N​ .Output FormatFor each test case, output on a new line, 𝑁N space separated integers denoting the lexicographically largest array 𝐵B that can be formed by any rearrangement of 𝐴A.Constraints1≤𝑇≤2⋅1041≤T≤2⋅10 4 1≤𝑁≤2⋅1051≤N≤2⋅10 5 1≤𝐴𝑖≤1091≤A i​ ≤10 9 The sum of 𝑁N over all test cases does not exceed 2⋅1052⋅10 5 .

You are given two integers n and x. You have to construct an array of positive integers nums of size n where for every 0 <= i < n - 1, nums[i + 1] is greater than nums[i], and the result of the bitwise AND operation between all elements of nums is x.Return the minimum possible value of nums[n - 1]. Example 1:Input: n = 3, x = 4Output: 6Explanation:nums can be [4,5,6] and its last element is 6.Example 2:Input: n = 2, x = 7Output: 15Explanation:nums can be [7,15] and its last element is 15. Constraints:1 <= n, x <= 108

Given two arrays (arr1[], arr2[]) of integers, display the largest number in arr1, where that element should not be present in arr2. If the constraint is not satisfied return 0.Variable Constraints:Size of the array <= 5;Array data type = integer.Input:Size of array 1Elements of array 1Size of array 2Elements of array 2Output:Largest element in array 1

You are given a list of binary numbers [110011, 111010, 11011, 1110, 11000, 101010, 11110].You can freely choose any 2 numbers from this list. You have to choose them so that the AND of those 2 numbers is maximized. What is the max AND value possible?