Hello coders, today we are going to solve Set.add() HackerRank Solution in Python.
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 ‘
>>> s = set('HackerRank') >>> s.add('H') >>> print s set(['a', 'c', 'e', 'H', 'k', 'n', 'r', 'R']) >>> print s.add('HackerRank') None >>> print s set(['a', 'c', 'e', 'HackerRank', 'H', 'k', 'n', 'r', 'R'])
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.
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.
- 0 < N < 1000
Output the total number of distinct country stamps on a single line.
7 UK China USA France New Zealand UK France
UK and France repeat twice. Hence, the total number of distinct country stamps is 5 (five).
Solution – Set.add() in Python
# Enter your code here. Read input from STDIN. Print output to STDOUT n = int(input()) NAMES = set() for i in range(n): NAMES.add(input()) print(len(NAMES))
Disclaimer: The above Problem (Set.add()) is generated by Hacker Rank but the Solution is Provided by CodingBroz. This tutorial is only for Educational and Learning Purpose.