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.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Beautiful Triplets
  5. Discussions

Beautiful Triplets

  • aksaini2282003
     + 0 comments

    This is the simple approach in the python language 

    		l=len(arr)
    count=0 
    for i in range(l-2):
        if arr[i]+d in arr and arr[i]+(2*d) in arr:
            count+=1 
    return count

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in