[Hackerrank] Solution of Minimum Distances in JavaScript

[Hackerrank] Solution of Minimum Distances in JavaScript

[Hackerrank] Solution of Minimum Distances in JavaScript

	function minimumDistances(a) {
	let min;
	const findOtherIndex = index => {
	for (let i = index + 1; i < a.length; i++) {
	if (a[i] === a[index]) {
	return i;
	}
	}
	return null;
	}
	for(let i = 0; i < a.length; i++) {
	if (findOtherIndex(i)) {
	if (!min) {
	min = Math.abs(i - findOtherIndex(i))
	} else {
	if (Math.abs(i - findOtherIndex(i)) < min) {
	min = Math.abs(i - findOtherIndex(i))
	}
	}
	}
	}
	return min || -1;
	}

view raw hackerrank_solution_of_minimum_distances_in_javascript.js hosted with ❤ by GitHub

• Tweet
• Share
• Share
• Share
• Share