check strict superset hackerrank solution

Solutions on MaxInterview for check strict superset hackerrank solution by the best coders in the world

showing results for - "check strict superset hackerrank solution"
Jonah
14 Nov 2020
1super_set=set(map(int,input().split()))
2count=True
3n=int(input())
4for i in range(n):
5    normal_set=set(map(int,input().split()))
6    if len(super_set)>len(normal_set):
7        if  not super_set.issuperset(normal_set):
8            count=False
9print(count)