Set .add() HackerRank Solution In Python

Problem

If we want to add a single element to an existing set, we can use the .add() operation.

It adds the element to the set and returns ‘None‘.

Example

>>> s = set('HackerRank')>>> s.add('H')>>> print sset(['a', 'c', 'e', 'H', 'k', 'n', 'r', 'R'])>>> print s.add('HackerRank')None>>> print sset(['a', 'c', 'e', 'HackerRank', 'H', 'k', 'n', 'r', 'R'])

Task

Apply your knowledge of the .add() operation to help your friend Rupal.

Rupal has a huge collection of country stamps. She decided to count the total number of distinct country stamps in her collection. She asked for your help. You pick the stamps one by one from a stack of N country stamps.

Find the total number of distinct country stamps.

Input Format

• Zeros and Ones HackerRank Solution In Python
• Eye and Identity HackerRank Solution In Python
• Array Mathematics HackerRank Solution In Python
• Floor, Ceil and Rint HackerRank Solution In Python
• Sum and Prod HackerRank Solution In Python

The first line contains an integer N, the total number of country stamps.
The next N lines contains the name of the country where the stamp is from.

Constraints

0 < N < 100

Output Format

Output the total number of distinct country stamps on a single line.

Sample Input

7UKChinaUSAFranceNew ZealandUKFrance

Sample Output

5

Explanation

UK and France repeat twice. Hence, the total number of distinct country stamps is 5 (five).

Solution – Set .add() HackerRank Solution In Python3

a = set()for _ in range(int(input())):    a.add(input())    print(len(a))