Check Subset in python - HackerRank Solution
Problem :
Your job is to find whether set A is a subset of set B.
If set A is subset of set B, print True.
If set A is not a subset of set B, print False.
Input Format :
The first line of each test case contains the number of elements in set A.
The second line of each test case contains the space separated elements of set A.
The third line of each test case contains the number of elements in set B.
The fourth line of each test case contains the space separated elements of set
B.
Constraints :
- 0 < T < 21
- 0 < Number of element in each set < 1001
Output Format :
Output True or False for each test case on
separate lines.
Sample Input :
3 5 1 2 3 5 6 9 9 8 5 6 3 2 1 4 7 1 2 5 3 6 5 4 1 7 1 2 3 5 6 8 9 3 9 8 2
Sample Output :
True False False
Explanation :
Set A = {1 2 3 5 6}
Set B = {9 8 5 6 3 2 1 4 7}
All the elements of set A are elements of set B.
Hence, set A is a subset of set B.
Solution :
1 2 3 4 5 6 7 8 9 10 11 12 13 14 | # Check Subset in python - Hacker Rank Solution # Python 3 # Enter your code here. Read input from STDIN. Print output to STDOUT # Check Subset in python - Hacker Rank Solution START T = int(input()) for _ in range(T): a = input() A = set(input().split()) b = int(input()) B = set(input().split()) print(A.issubset(B)) # Check Subset 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.
CodeWorld19
Hey, I am Parthe Omkar