304 North Cardinal St.
Dorchester Center, MA 02124

# Set .intersection() operation Hacker Rank Solution – Queslers

### Problem : Set .intersection() operation Hacker Rank Solution

``````>>> s = set("Hacker")
>>> print s.intersection("Rank")
set(['a', 'k'])

>>> print s.intersection(set(['R', 'a', 'n', 'k']))
set(['a', 'k'])

>>> print s.intersection(['R', 'a', 'n', 'k'])
set(['a', 'k'])

>>> print s.intersection(enumerate(['R', 'a', 'n', 'k']))
set([])

>>> print s.intersection({"Rank":1})
set([])

>>> s & set("Rank")
set(['a', 'k'])
``````

The students of District College have subscriptions to English and French newspapers. Some students have subscribed only to English, some have subscribed only to French, and some have subscribed to both newspapers.
You are given two sets of student roll numbers. One set has subscribed to the English newspaper, one set has subscribed to the French newspaper. Your task is to find the total number of students who have subscribed to both newspapers.

#### Input Format :

The first line contains n, the number of students who have subscribed to the English newspaper.
The second line contains n space separated roll numbers of those students.
The third line contains b, the number of students who have subscribed to the French newspaper.
The fourth line contains b space separated roll numbers of those students.

#### Constraints :

• 0 < total number of student in college < 1000

#### Output Format :

Output the total number of students who have subscriptions to both English and French newspapers.

#### Sample Input :

``````9
1 2 3 4 5 6 7 8 9
9
10 1 2 3 11 21 55 6 8
``````

#### Sample Output :

``````5
``````

#### Explanation :

The roll numbers of students who have both subscriptions:
1, 2, 3, 6 and 8.
Hence, the total is 8 students.

### Set .intersection() operation Hacker Rank Solution in Python 2

``````eng = set()
fre = set()
n = raw_input()
for i in raw_input().split(' '):
m = raw_input()
for i in raw_input().split(' '):
sol = eng.intersection(fre)
print len(sol)``````

### Set .intersection() operation Hacker Rank Solution in Python 3

``````# Enter your code here. Read input from STDIN. Print output to STDOUT
num1, st1, num2, st2 = (set(input().split()) for i in range(4))
print(len(st1.intersection(st2)))``````

### Set .intersection() operation Hacker Rank Solution in Pypy

``````encount = int(raw_input())
enst = set(map(int,raw_input().split(' ')))
frcount = int(raw_input())
frst = set(map(int,raw_input().split(' ')))

studs = enst & frst
print len(studs)``````

### Set .intersection() operation Hacker Rank Solution in Pypy3

``````# Enter your code here. Read input from STDIN. Print output to STDOUT
n1=input()
li1 = input().split()
s1 = set(li1)
n2=input()
li2 = input().split()
s2 = set(li2)
s1s2 = s1.intersection(s2)
print(len(s1s2))
``````
##### Set .intersection() operation Hacker Rank Solution Review:

In our experience, we suggest you solve this Set .intersection() operation Hacker Rank Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

Set .intersection() operation is available on Hacker Rank for Free, if you are stuck anywhere between compilation, just visit Queslers to get all Hacker Rank Solution

##### Set .intersection() operation Hacker Rank Solution Conclusion:

I hope this Set .intersection() operation Hacker Rank Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Hacker Rank, Leetcode, Codechef, Codeforce Solution.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Hacker Rank Problem & Solutions >>

Mini-Max Sum Hacker Rank Solution

String Validators Hacker Rank Solution

Text Alignment Hacker Rank solution

String validators Hacker Rank Solution