Write the codeGiven a set of distinct positive integers, find the largest subset such that every pair of elements in the subset (i, j) satisfies either i % j = 0 or j % i = 0.For example, given the set [3, 5, 10, 20, 21], you should return [5, 10, 20]. Given [1, 3, 6, 24], return [1, 3, 6, 24]Sample Test CasesTest Case 1:Expected Output:Enter·the·elements·seperated·by·,·:1,2,3,4,8,10,16[1,·2,·4,·8,·16]Test Case 2:Expected Output:Enter·the·elements·seperated·by·,·:2,3[3]Test Case 3:Expected Output:Enter·the·elements·seperated·by·,·:3,5,10,20,21[5,·10,·20]

Given a set of distinct positive integers, find the largest subset such that every pair of elements in the subset (i, j) satisfies either i % j = 0 or j % i = 0.For example, given the set [3, 5, 10, 20, 21], you should return [5, 10, 20]. Given [1, 3, 6, 24], return [1, 3, 6, 24]Sample Test CasesTest Case 1:Expected Output:Enter·the·elements·seperated·by·,·:1,2,3,4,8,10,16[1,·2,·4,·8,·16]Test Case 2:Expected Output:Enter·the·elements·seperated·by·,·:2,3[3]Test Case 3:Expected Output:Enter·the·elements·seperated·by·,·:3,5,10,20,21[5,·10,·20]

You are given an array 𝐴A of size 𝑁N.Find the largest integer 𝐾K such that there exists a subsequence 𝑆S of length 𝐾K where 𝐾K is divisible by the number of distinct elements in 𝑆S.Input FormatThe first line contains a single integer 𝑇T, denoting the number of test cases.The first line of each test case contains a positive integer 𝑁N, the length of array 𝐴A.The second line contains 𝑁N space-separated integers, 𝐴1,𝐴2,…,𝐴𝑁A 1​ ,A 2​ ,…,A N​ −− denoting the array 𝐴A.Output FormatFor each test case, output the largest valid 𝐾K.Constraints1≤𝑇≤1041≤T≤10 4 1≤𝐴𝑖≤𝑁≤2⋅1051≤A i​ ≤N≤2⋅10 5 The sum of 𝑁N over all test cases won't exceed 2⋅1052⋅10 5 .Sample 1:

Given an array of unique integer elements, print all the subsets of the given array in lexicographical order.Input FormatThe first line of input contains T - the number of test cases. It's followed by 2T lines, the first line contains N - the size of the array and the second line contains the elements of the array.Output FormatFor each test case, print the subsets of the given array in lexicographical order, separated by new line. Print an extra newline between output of different test cases.Constraints1 <= T <= 1001 <= N <= 100 <= A[i] <= 100ExampleInput335 15 3 257 96 43 15 8 23 Output3 3 5 3 5 15 3 15 5 5 15 15 57 57 96 96 3 3 8 3 8 15 3 8 15 23 3 8 23 3 15 3 15 23 3 23 8 8 15 8 15 23 8 23 15 15 23 23

Subset SumMax Score: 150Given a set of non-negative integers, and a value S, determine if there is a subset of the given set with sum equal to S.Input FormatThe first line of the input contains T - the number of test cases. It is followed by 2T lines - the first line of each test case contains N - number of elements in given array and S - the required sum. The second line contains elements of the array.Output FormatFor each test case, print "YES" if there is a subset of the given set with sum equal to given S, otherwise "NO", separated by new line .Constraints30 points1 <= N <= 100 <= S <= 100120 points1 <= N <= 1000 <= S <= 1000General Constraints1 <= T <= 1000 <= A[i] <= 103ExampleInput25 1510 4 5 9 15 1713 11 19 20 21OutputYESNOExplanationExample 1:15 = 9 + 5 + 1Example 2:No such subset exists.

Write the codeGiven a list of elements, find the majority element, which appears more than half the times (> floor(len(lst) / 2.0)).You can assume that such an element exists.For example,given : [1, 2, 1, 1, 3, 4, 0,1],return : Nonesimple input 0 : 1,1,1,1,1,1,2,2,2,3simple output 0 : 1simple input 1 : 1,1,2,2,2,3,3simple input 1 : NoneSample Test CasesTest Case 1:Expected Output:Enter·list·of·Elements:·1,1,1,1,11Test Case 2:Expected Output:Enter·list·of·Elements:·1,1,1,1,2,2,2,3,3None