Hello Programmers/Coders, Today we are going to share solutions of Programming problems of HackerRank of Programming Language Python. At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.
In this post, you will find the solution for Check Strict Superset in Python-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.
Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.
Introduction To Python
Python is a widely-used, interpreted, object-oriented, and high-level programming language with dynamic semantics, used for general-purpose programming. It was created by Guido van Rossum, and first released on February 20, 1991.
Python is a computer programming language often used to build websites and software, automate tasks, and conduct data analysis. It is also used to create various machine learning algorithm, and helps in Artificial Intelligence. Python is a general purpose language, meaning it can be used to create a variety of different programs and isn’t specialized for any specific problems. This versatility, along with its beginner-friendliness, has made it one of the most-used programming languages today. A survey conducted by industry analyst firm RedMonk found that it was the most popular programming language among developers in 2020.
Link for the Problem – Check Strict Superset in Python – HackerRank Solution
Check Strict Superset in Python – HackerRank Solution
Problem:
You are given a set and other sets.
Your job is to find whether set is a strict superset of each of the sets.
Print True, if is a strict superset of each of the sets. Otherwise, print False.
A strict superset has at least one element that does not exist in its subset.
Example
Set is a strict superset of set.
Set is not a strict superset of set.
Set is not a strict superset of set.
Input Format
The first line contains the space separated elements of set .
The second line contains integer , the number of other sets.
The next lines contains the space separated elements of the other sets.
Constraints
Output Format
Print True if set is a strict superset of all other sets. Otherwise, print False.
Sample Input 0
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 0
False
Explanation 0
Set is the strict superset of the set but not of the set because is not in set .
Hence, the output is False.
Check Strict Superset in Python – HackerRank Solution
# 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
