We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
def beautifulTriplets(d, arr):
counter = 0
n = len(arr)
for i in range(n):
for j in range(i, n):
if arr[j]-arr[i] == d:
for k in range(j, n):
if arr[k]-arr[j] == d:
counter += 1
return counter
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Beautiful Triplets
You are viewing a single comment's thread. Return to all comments →
def beautifulTriplets(d, arr): counter = 0 n = len(arr) for i in range(n): for j in range(i, n): if arr[j]-arr[i] == d: for k in range(j, n): if arr[k]-arr[j] == d: counter += 1 return counter