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

Sort by

recency

|

1075 Discussions

|

  • abhijeetmaharan2
     + 0 comments
    def beautifulTriplets(d, arr):
    # Write your code here
    
    count = 0
    lookup = set(arr)
    
    for i in arr:
        num2 = i + d
        num3 = num2 + d
        
        if num2 in lookup and num3 in lookup:
            count += 1
            
    return count

  • yashdeliwala10
     + 0 comments

    Very Simple method with Include in Javascript

    function beautifulTriplets(d, arr) { let count =0 for(let i = 0;i

    }

  • afzal_saiyed931
     + 0 comments
    def beautifulTriplets(d, arr):
    # Write your code here
    n = len(arr)
    c = 0
    lookup = set(arr)
    for i in range(n - 2):
        first = arr[i]
        second = first + d
        third = second + d
        if second in lookup and third in lookup:
            c += 1
    return c

  • spriyamalar
     + 0 comments
    public static int beautifulTriplets(int d, List<Integer> arr) {
    int tripletcount = 0;
    for(int i = 0; i < arr.size(); i++) {
        for(int j=i+1; j< arr.size(); j++) {
            if(arr.get(j) - arr.get(i) == d && findThirdNumber(arr, j, d, arr.get(j))) {
                tripletcount++;
                break;
            }
        }
    }
    return tripletcount;
}

private static boolean findThirdNumber(List<Integer> arr, int j, int d, int jval) {
    for(int k = j+1; k < arr.size(); k++) {
        if(arr.get(k) - jval == d) return true;
    }
    return false;
}

  • yashdeora98294
     + 0 comments

    Here is problem solution in Python, Java, C++, C and Javascript - https://programmingoneonone.com/hackerrank-beautiful-triplets-problem-solution.html