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

  • SarathKumar19
     + 7 comments

    My Solution in Java

    import java.io.*;
import java.util.*;

public class Solution {
    
    public static int beautifulTripletsCount( ArrayList<Integer> e, int n, int d ) {
        int count = 0;
        for( Integer v : e ) {
            if( e.contains( (v + d) ) && e.contains( (v + 2*d) ) )
                count++;
        }
        return count;
    }

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), d = in.nextInt();
        ArrayList<Integer> elements = new ArrayList<>();
        for( int i = 0; i < n; i++ ) {
            elements.add( in.nextInt() );
        }
        System.out.println( beautifulTripletsCount(elements, n, d) );
    }
}