/Python/Beautiful triplets hackerrank solution in python

Beautiful triplets hackerrank solution in python

def beautifulTriplets(d, arr):
    a = set(arr)
    return len([1 for i in arr if i+d in a and i+d*2 in a])
n,d = map(int,input().split())
arr = list(map(int,input().split()))
print(beautifulTriplets(d, arr))

Source: thepoorcoder.com

Similar codes

1 vote201 views1 answer
Python seconds counter
Python
0 vote192 views1 answer
How to convert integer to hex signed 2's complement in python
Python
0 vote190 views1 answer
Scikit learn k means
Python
10 votes204 views6 answers
Django create user
Python
0 vote210 views1 answer
Max sum slice python 1 - autopilot
Python
2 votes208 views2 answers
Python program to find first n prime numbers
Python
0 vote201 views1 answer
Tkinter mouse loading cursor
Python
17 votes210 views5 answers
Remove punctuation python
Python
0 vote197 views1 answer
Arrotondamento python
Python
1 vote213 views1 answer
How to average in python with loop
Python