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.
- Prepare
- Python
- Sets
- Check Subset
- Discussions
Check Subset
Check Subset
Sort by
recency
|
942 Discussions
|
Please Login in order to post a comment
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)
T = int(input())
for i in range(T):
Here is HackerRank Check Subset in Python solution - https://programmingoneonone.com/hackerrank-check-subset-problem-solution-in-python.html
t = int(input()) for i in range(t): a = int(input()) a_set = set(map(int, input().split())) b = int(input()) b_set = set(map(int, input().split())) if a_set&b_set == a_set: print(True) else: print(False)
T = int(input())
for _ in range(T): m = int(input()) A = set(map(int, input().split()))