[Hackerrank] Solution of Divisible Sum Pairs in JavaScript

[Hackerrank] Solution of Divisible Sum Pairs in JavaScript

[Hackerrank] Solution of Divisible Sum Pairs in JavaScript

	function divisibleSumPairs(n, k, ar) {
	let result = 0;
	for(let i = 0; i < n - 1; i++) {
	result += ar.slice(i + 1, n).filter((item, index) => {
	if ((item + ar[i]) % k === 0) {
	return item;
	}
	}).length;
	}
	return result;
	}

view raw hackerrank_solution_of_divisible_sum_pairs_in_javascript.js hosted with ❤ by GitHub

• Tweet
• Share
• Share
• Share
• Share