Check Strict Superset in Python - HackerRank Solution

Check Strict Superset in Python - HackerRank Solution
Check Strict Superset in Python - HackerRank Solution


Problem :


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 contains the space separated elements of the other sets.

Constraints :

  • 0 < len(set(A)) < 501
  • 0 < N < 21
  • 0 < len(other set) < 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 :


 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
# Check Strict Superset in Python - Hacker Rank Solution
# Python 3
# Enter your code here. Read input from STDIN. Print output to STDOUT
# Check Strict Superset in Python - Hacker Rank Solution START

storage = set(input().split())
N = int(input())
output = True

for i in range(N):
    storage2 = set(input().split())
    if not storage2.issubset(storage):
        output = False
    if len(storage2) >= len(storage):
        output = False

print(output)
# Check Strict Superset in Python - Hacker Rank Solution END





Disclaimer :-
the above hole problem statement is given by hackerrank.com but the solution is generated by the codeworld19 authority if any of the query regarding this post or website fill the following contact form thank you.

Next Post Previous Post
1 Comments
  • Anonymous
    Anonymous Tuesday, September 20, 2022

    A = set(map(int,input().split()))
    n_b = int(input())
    boo = set()
    for i in range(n_b):
    B = set(map(int,input().split()))
    if A.intersection(B) == B:
    boo.add("True")
    else:
    boo.add("False")
    out_put = "False"
    if out_put in boo:
    print(out_put)
    else:
    print('True')

Add Comment
comment url