daubattu/hackerrank_solution_of_beautiful_triplets_in_javascript.js

## hackerrank_solution_of_beautiful_triplets_in_javascript.js
function beautifulTriplets(d, arr) {
    let result = 0;
    for (let i = 0; i < arr.length; i++) {
        const numb1 = arr[i] - d;
        const numb2 = numb1 - d;
        if (arr.includes(numb1) && arr.includes(numb2)) {
            result += 1;
        }
    }
    return result;
}
	function beautifulTriplets(d, arr) {
	let result = 0;
	for (let i = 0; i < arr.length; i++) {
	const numb1 = arr[i] - d;
	const numb2 = numb1 - d;
	if (arr.includes(numb1) && arr.includes(numb2)) {
	result += 1;
	}
	}
	return result;
	}