We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Sets
  4. Check Subset
  5. Discussions

Check Subset

Sort by

recency

|

946 Discussions

|

  • sbk_63
     + 0 comments

    print(*[(lambda a, set_a, b, set_b : set_b.issuperset(set_a))(input(), set(map(int, input().split())), input(), set(map(int, input().split()))) for _ in range(int(input()))], sep="\n")

  • dilajevolves
     + 0 comments
    for _ in range(int(input())):
    _,A = int(input()) , set(map(int,input().split()))
    _,B = int(input()) , set(map(int,input().split()))
    print(A.issubset(B)) # Alternative : print(A&B == A)

  • neha_singh19aug
     + 0 comments
    test_cases=int(input())
sets_list=[ [int(input()),set(map(int,input().split())),int(input()),set(map(int,input().split()))] for i in range(test_cases)]
for sets in sets_list:
    print(sets[1].intersection(sets[-1])==sets[1])

  • rohitambasta_ii1
     + 0 comments
    T= int(input())
for inputs in range(T):
    no_of_elements_in_A = int(input())
    A = set(input().split())
    no_of_elements_in_B = int(input())
    B = set(input().split())
    
    if len(A.difference(B)) == 0:  # or, A.difference(B)==set()
        print("True")
    else:
        print("False")

  • guddu1129
     + 0 comments

    t=int(input())

    for _ in range(t): n=int(input()) a=set(map(int,input().split())) m=int(input()) b=set(map(int,input().split())) if a.intersection(b) == a: print(True) else: print(False)