Number of Arithmetic Triplets

You are given a 0-indexed, strictly increasing integer array nums and a positive integer diff. A triplet (i, j, k) is an arithmetic triplet if the following conditions are met:

• i < j < k,

• nums[j] - nums[i] == diff, and

• nums[k] - nums[j] == diff.

Return the number of unique arithmetic triplets*.*

LeetCode Problem - 2367

class Solution {
    // Method to find arithmetic triplets in an array
    public int arithmeticTriplets(int[] nums, int diff) {

        // Initialize a variable to count the number of arithmetic triplets found
        int count = 0;

        // Loop through the array elements
        for(int i=0; i<nums.length; i++){
            // For each element, compare with all subsequent elements
            for(int j=i+1; j<nums.length; j++){
                // Check if the difference between the current and next element is equal to the specified difference
                if(nums[j] - nums[i] ==  diff){
                    // If difference matches, look for the third element in the sequence
                    for(int k=j+1; k<nums.length; k++){
                        // Check if the difference between the next element and the current element
                        // in the sequence is equal to the specified difference
                        if(nums[k]-nums[j] == diff){
                            // If the third element satisfies the condition, increment the count
                            count++;
                            // Break out of the loop since we found a valid triplet
                            break;
                        }
                    }
                }
            }
        }
        // Return the count of arithmetic triplets found
        return count;
    }
}