No Idea in python HackerRank Solution

Hello coders, In this post, you will learn how to solve No Idea in python HackerRank Solution. This problem is a part of the Python Hacker Rank series.

No Idea in python - HackerRank Solution
No Idea in python HackerRank Solution

No Idea in python HackerRank Solution


There is an array of n integers. There are also 2 disjoint sets, A and B, each containing m integers. You like all the integers in set A and dislike all the integers in set B. Your initial happiness is 0. For each i integer in the array, if i (- A , you add 1 to your happiness. If i (- B, you add -1 to your happiness. Otherwise, your happiness does not change. Output your final happiness at the end.

Note: Since A and B are sets, they have no repeated elements. However, the array might contain duplicate elements.

Constraints :

  • 1 <= n <= 10^5
  • 1 <= m <= 10^5
  • 1 <= any integer in the input <= 10^9

Input Format :

The first line contains integers n and m separated by a space.
The second line contains n integers, the elements of the array.
The third and fourth lines contain m integers, A and B, respectively.

Output Format :

Output a single integer, your total happiness.

Sample Input :

3 2
1 5 3
3 1
5 7

Sample Output :


Explanation :

You gain 1 unit of happiness for elements 3 and 1 in set A. You lose 1 unit for 5 in set B. The element 7 in set B does not exist in the array so it is not included in the calculation.
Hence, the total happiness is 2 – 1 = 1.

No Idea in python HackerRank Solution

# No Idea in python - Hacker Rank Solution START
io = input().split()
m = int(io[0])
n = int(io[1])
storage = list()
count = 0
storage = list(map(int, input().strip().split()))
A = set(map(int, input().strip().split()))
B = set(map(int, input().strip().split()))
for i in storage:
    if i in A:
        count = count+1
    if i in B:
        count = count-1
# No Idea in python - Hacker Rank Solution END

Disclaimer: The above Problem (No Idea in python) is generated by Hackerrank but the Solution is Provided by Chase2Learn. This tutorial is only for Educational and Learning purposes. Authority if any of the queries regarding this post or website fill the following contact form thank you.

Sharing Is Caring

Leave a Comment