HackerRank Python Solution - Sets - Check Strict Superset

• You are given a set A and n other sets.
• Your job is to find whether set A is a strict superset of each of the N sets.
• Print True, if A is a strict superset of each of the N sets. Otherwise, print False.
• A strict superset has at least one element that does not exist in its subset.

Example:

• Set([1, 3, 4]) is a strict superset of set([1, 3]).
• Set([1, 3, 4]) is not a strict superset of set([1, 3, 4]).
• Set([1, 3, 4]) is not a strict superset of set([1, 3, 5]).

Input Format:

• The first line contains the space-separated elements of set A.
• The second line contains integer n, the number of other sets.
• The next n lines contain the space-separated elements of the other sets.

Constraints:

• 0 < len(set(A)) < 501
• 0 < N < 21
• 0 < len(otherSets) < 101

Output Format:

• Print True if set A is a strict superset of all other N sets. Otherwise, print False.

Sample Input:

1 2 3 4 5 6 7 8 9 10 11 12 23 45 84 78
2
1 2 3 4 5
100 11 12

Sample Output:

False

Explanation:

• Set A is the strict superset of the set([1, 2, 3, 4, 5]) but not of the set([100, 11, 12]) because 100 is not in set A.
• Hence, the output is False.

Solution:

A = set(map(int,input().split()))
check = 0
for _ in range(int(input())):
    
    B = set(map(int,input().split()))
    
    if len(B.difference(A))!=0:
        check = 1
    else:
        if len(B)==len(A):
            check = 1
if check==0:
    print(True)
else:
    print(False)

Disclaimer: The problem statement is given by hackerrank.com but the solution is generated by the Geek4Tutorial admin. If there is any concern regarding this post or website, please contact us using the contact form. Thank you!