You are given 2 arrays A and B of same size N. A pair is said to be a valid if and only if i < j, A[i] == B[j] and A[j] == B[i]. You have to count total number of valid pairs.Input FormatFirst line of input contains T - number of test cases. First line of each test case contains N - size of the array. The second and third line of each test case contains N integers - elements of the array A and B.Output FormatFor each test case, print the count of number of valid pairs, separated by newline.Constraints30 points1 <= N <= 10370 points1 <= N <= 105General Constraints1 <= T <= 1000 <= A[i], B[i] <= 109ExampleInput231 2 33 2 151 3 7 9 93 1 9 7 7Output13ExplanationTest Case 1:There is only one valid pair - (0, 2). This is because A[0] == B[2] and A[2] == B[0].Test Case 2:There are 3 valid pairs - (0, 1), (2, 3), (2, 4). For example (0, 1) is valid because A[0] == B[1] and A[1] == B[0].

Given an array of integers and a number K, check if there exist a pair of indices i,j s.t. a[i] + a[j] = K and i!=j.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines, first line of each test case contains N - the size of the array and K, and the next line contains N space separated integers - the elements of the array.Output FormatFor each test case, print "True" if such a pair exists, "False" otherwise, separated by newline.Constraints30 points1 <= T <= 1002 <= N <= 100070 points1 <= T <= 3002 <= N <= 10000General Constraints-108 <= K <= 108-108 <= ar[i] <= 108ExampleInput35 -15-30 15 20 10 -102 2010 104 7-4 0 10 -7OutputTrueTrueFalse

Given 2 arrays A and B of size N and M respectively. You have to find the number of elements in the union and intersection between both the arrays.Note that both the arrays contain distinct elements.Input FormatFirst line of input contains N - size of the array A. The next line contains the N integers of array A. The next line of input contains M - size of the array B. The next line contains the M integers of array B.Output FormatPrint the count of number of elements in union and intersection separated by space.Constraints

Consider an array of integers, . Find and print the total number of pairs such that where .Input FormatThe first line contains an integer, , denoting the number of elements in the array.The second line consists of space-separated integers describing the respective values of .ConstraintsScoring for of the test cases. for of the test cases. for of the test cases.Output FormatPrint a long integer denoting the total number pairs satisfying where .Sample Input5 1 1 2 4 2Sample Output8ExplanationThere are eight pairs of indices satisfying the given criteria: , , , , , , , and . Thus, we print as our answer.Contest ends in 2 hoursSubmissions: 43Max Score: 10Difficulty: AdvancedRate This Challenge: More Python 31#!/bin/python32​3import math4import os5import random6import re7import sys8​9#10# Complete the 'solve' function below.11#12# The function is expected to return a LONG_INTEGER.13# The function accepts INTEGER_ARRAY arr as parameter.14#15​16def solve(arr):17    # Write your code here18    19if __name__ == '__main__':20    fptr = open(os.environ['OUTPUT_PATH'], 'w')21​22    arr_count = int(input().strip())23​24    arr = list(map(int, input().rstrip().split()))25​26    result = solve(arr)27​28    fptr.write(str(result) + '\n')29​30    fptr.close()31​

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 integer array and an integer K. You have to tell if there exists a pair of integers in the given array such that ar[i]-ar[j]=K and i≠j.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines, the first line contains N and K - the size of the array and the number K. The second line contains the elements of the array.Output FormatFor each test case, print "true" if the arrays contains such elements, "false" otherwise, separated by new line.Constraints40 points2 <= N <= 100060 points2 <= N <= 100000General Constraints1 <= T <= 100-105 <= ar[i], K <= 105ExampleInput25 601 20 40 100 8010 1112 45 52 65 21 645 234 14 575 112Outputtruefalse