HackerRank Check Subset problem solution in Python

HackerRank Check Subset problem solution in Python – In this Check Subset problem, you are given two sets, A and b. Your job is to find whether set A is a subset of set B. If set A is a subset of set B, print True. If set A is not a subset of set B, print False.

Input Format

The first line will contain the number of test cases T.
The first line of each test case contains the number of elements in set A.
The second line of each test case contains the space-separated elements of set A.
The third line of each test case contains the number of elements in set B.
The fourth line of each test case contains the space-separated elements of set B.

HackerRank Check Subset Problem solution in Python 2.

for i in range(int(raw_input())): #More than 4 lines will result in 0 score. Do not leave a blank line also. 
    a = int(raw_input()); A = set(raw_input().split())
    b = int(raw_input()); B = set(raw_input().split())
    print "True" if A.issubset(B) else "False"

Check Subset solution in Python 3.

# Enter your code here. Read input from STDIN. Print output to STDOUT
for _ in range(int(input())):
    x, a, z, b = input(), set(input().split()), input(), set(input().split())
    print(a.issubset(b))

Problem solution in pypy programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT
for case in range(int(raw_input())):
    element_count1, set1 = int(raw_input()), set(raw_input().split())
    element_count2, set2 = int(raw_input()), set(raw_input().split())
    print(len(set1.difference(set2))==0)

Problem solution in pypy3 programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT
for i in range(int(input())): 
    a = int(input()); A = set(input().split()) 
    b = int(input()); B = set(input().split())
    if(len(A.difference(B))==0):
        print("True")
    else:
        print("False")