complete sets in python

Author: chandraprakash-dev

LANGUAGE PROFICIENCY/Python/Sets/CheckStrictSuperset.py

@@ -0,0 +1,8 @@
+A = set(map(int, input().split()))
+r = True
+for _ in range(int(input())):
+    B = set(map(int, input().split()))
+    if A.issuperset(B) == False:
+        r = False
+
+print(r)

LANGUAGE PROFICIENCY/Python/Sets/CheckSubset.py

@@ -0,0 +1,4 @@
+for _ in range(int(input())):
+    _, A = input(), set(map(int, input().split())) 
+    _, B = input(), set(map(int, input().split()))
+    print(A.issubset(B))

LANGUAGE PROFICIENCY/Python/Sets/SetDifference.py

@@ -0,0 +1,6 @@
+e = int(input())
+E = set(map(int, input().split()))
+f = int(input())
+F = set(map(int, input().split()))
+S = E.difference(F)
+print(len(S))

LANGUAGE PROFICIENCY/Python/Sets/SetIntersection.py

@@ -0,0 +1,7 @@
+e = int(input())
+E = set(map(int, input().split()))
+f = int(input())
+F = set(map(int, input().split()))
+S = E.intersection(F)
+print(len(S))
+

LANGUAGE PROFICIENCY/Python/Sets/SetMutations.py

@@ -0,0 +1,7 @@
+_ , A = int(input()), set(map(int, input().split()))
+q = int(input())
+for _ in range(q):
+    command, B = input().split()[0], set(map(int, input().split()))
+    getattr(A, command)(B)
+
+print(sum(A))

LANGUAGE PROFICIENCY/Python/Sets/SetSymmetricDifference.py

@@ -0,0 +1,6 @@
+e = int(input())
+E = set(map(int, input().split()))
+f = int(input())
+F = set(map(int, input().split()))
+S = E.symmetric_difference(F)
+print(len(S))

LANGUAGE PROFICIENCY/Python/Sets/SetUnion.py

@@ -0,0 +1,7 @@
+e = int(input())
+E = set(map(int, input().split()))
+f = int(input())
+F = set(map(int, input().split()))
+S = E.union(F) 
+print(len(S))
+

LANGUAGE PROFICIENCY/Python/Sets/TheCaptiansRoom.py

@@ -0,0 +1,9 @@
+from collections import Counter
+_, l = input(), list(map(int, input().split()))
+rooms = set(l)
+
+c = Counter(l)
+for r in rooms:
+    if c[r] == 1:
+        print(r)
+        break

README.md

@@ -139,6 +139,14 @@ Solutions to some problems on Hackerrank.
 | Sets | Medium | [No Idea!](https://www.hackerrank.com/challenges/no-idea/problem) | [NoIdea.py](LANGUAGE%20PROFICIENCY/Python/Sets/NoIdea.py)
 | Sets | Easy | [Symmetric Difference](https://www.hackerrank.com/challenges/symmetric-difference/problem) | [SymmetricDifference.py](LANGUAGE%20PROFICIENCY/Python/Sets/SymmetricDifference.py)
 | Sets | Easy | [Set .discard(), .remove() & .pop()](https://www.hackerrank.com/challenges/py-set-discard-remove-pop/problem) | [SetDiscardRemovePop.py](LANGUAGE%20PROFICIENCY/Python/Sets/SetDiscardRemovePop.py)
+| Sets | Easy | [Set .union() Operation](https://www.hackerrank.com/challenges/py-set-union/problem) | [SetUnion.py](LANGUAGE%20PROFICIENCY/Python/Sets/SetUnion.py)
+| Sets | Easy | [Set .intersection() Operation](https://www.hackerrank.com/challenges/py-set-intersection-operation/problem) | [SetIntersection.py](LANGUAGE%20PROFICIENCY/Python/Sets/SetIntersection.py)
+| Sets | Easy | [Set .difference() Operation](https://www.hackerrank.com/challenges/py-set-difference-operation/problem) | [SetDifference.py](LANGUAGE%20PROFICIENCY/Python/Sets/SetDifference.py)
+| Sets | Easy | [Set .symmetric_difference() Operation](https://www.hackerrank.com/challenges/py-set-symmetric-difference-operation/problem) | [SetSymmetricDifference.py](LANGUAGE%20PROFICIENCY/Python/Sets/SetSymmetricDifference.py)
+| Sets | Easy | [Set Mutations](https://www.hackerrank.com/challenges/py-set-mutations/problem) | [SetMutations.py](LANGUAGE%20PROFICIENCY/Python/Sets/SetMutations.py)
+| Sets | Easy | [The Captain's Room](https://www.hackerrank.com/challenges/py-the-captains-room/problem) | [TheCaptiansRoom.py](LANGUAGE%20PROFICIENCY/Python/Sets/TheCaptiansRoom.py)
+| Sets | Easy | [Check Subset](https://www.hackerrank.com/challenges/py-check-subset/problem) | [CheckSubset.py](LANGUAGE%20PROFICIENCY/Python/Sets/CheckSubset.py)
+| Sets | Easy | [Check Strict Superset](https://www.hackerrank.com/challenges/py-check-strict-superset/problem) | [CheckStrictSuperset.py](LANGUAGE%20PROFICIENCY/Python/Sets/CheckStrictSuperset.py)
 
 # Shell