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
- Set Mutations
- Discussions
Set Mutations
Set Mutations
Sort by
recency
|
843 Discussions
|
Please Login in order to post a comment
set_1 = set(map(int,input().split())) b = int(input()) for i in range(b): cmd = list(input().split()) operation = cmd[0] set_2 = set(map(int, input().split())) getattr(set_1, operation)(set_2) print(sum(set_1))
A=int(input()) L1=set(map(int,input().split())) N=int(input()) for _ in range(N): S=input().split() L2 = set(map(int, input().split())) if S[0]=="intersection_update": L1.intersection_update(L2) elif S[0]=="update": L1.update(L2) elif S[0]=="symmetric_difference_update": L1.symmetric_difference_update(L2) elif S[0]=="difference_update": L1.difference_update(L2) print(sum(L1))
Here is HackerRank Set Mutations in Python solution - https://programmingoneonone.com/hackerrank-set-mutations-problem-solution-in-python.html