-->
Home

Set Mutations Hackerrank Solution Python 3

0 Comment
Set Mutations Hackerrank Solution Python 3



Set Mutations Hackerrank Solution Python 3


Hello Friends 

आज हम आपको Hacker Rank पर Set Mutations का कंप्लीट सॉल्यूशन बताएंगे वह भी आसान भाषा में। तो दोस्तों चलिए जानते हैं सॉल्यूशन ।


Problem : Set Mutations Hackerrank Solution



Task

You are given a set A and N number of other sets. These N number of sets have to perform some specific mutation operations on set A.

Your task is to execute those operations and print the sum of elements from set A.



Input Format


The first line contains the number of elements in set A.

The second line contains the space separated list of elements in set A.

The third line contains integer N, the number of other sets.

The next 2*N lines are divided into N parts containing two lines each.

The first line of each part contains the space separated entries of the operation name and the length of the other set.

The second line of each part contains space separated list of elements in the other set.

0 < len(set(A))< 1000

0 < len(otherSets) < 100

0 < N < 100



Output Format


Output the sum of elements in set A.



Sample Input


16
1 2 3 4 5 6 7 8 9 10 11 12 13 14 24 52
4
intersection_update 10
2 3 5 6 8 9 1 4 7 11
update 2
55 66
symmetric_difference_update 5
22 7 35 62 58
difference_update 7
11 22 35 55 58 62 66



Sample Output


38



Explanation


After the first operation, (intersection_update operation), we get:

Set A = set([1,2,3,4,5,6,7,8,9,11])


After the second operation, (update operation), we get:

Set A = set([1,2,3,4,5,6,7,8,9,11,55,66]) 


After the third operation, (symmetric_difference_update operation), we get:

Set A = set([1,2,3,4,5,6,7,8,9,11,22,35,55,58,62,66])  


After the fourth operation, ( difference_update operation), we get:

Set A = set([1,2,3,4,5,6,8,9])  


The sum of elements in set A after these operations is 38.




Solution

a=int(input())
s=set(map(int,input().split()))
n=int(input())
for i in range(n):
    x,y=input().split()
    if x=='intersection_update':
       s.intersection_update(set(map(int,input().split())))
    
    elif x=='update':
        s.update(set(map(int,input().split())))    
    
    elif x=='symmetric_difference_update':
        s.symmetric_difference_update(set(map(int,input().split())))
    
    elif x=='difference_update':
        s.difference_update(set(map(int,input().split())))

print(sum(s))



Other Articles 


DISCLAIMER

The above hole problem statement is given by hackerrank.com but the solution is generated by the Apna Hindi Tech authority if any of the query regarding this post or website fill the following contact form.

......Thank You......

यह भी पढ़ें

Post a Comment

Post a Comment