DCC-12.js

// Prompt:

// In information theory, the hamming distance refers to the count of the differences between two strings of equal length.  It is used in computer science for such things as implementing "fuzzy search"  capability.

// - Write a function named hammingDistance that accepts two arguments which are both strings of equal length.
// - The function should return the count of the symbols (characters, numbers, etc.) at the same position within each string that are different.
// - If the strings are not of the same length, the function should return NaN.

// Examples:

// hammingDistance('abc', 'abc'); //=> 0
// hammingDistance('a1c', 'a2c'); //=> 1
// hammingDistance('!!!!', '****'); //=> 4
// hammingDistance('abc', 'ab'); //=> NaN

const hammingDistance = (str1, str2) => {
	if (str1.length !== str2.length) {
		return NaN;
	}
	let diffCount = 0;
	for (let i = 0; i < str1.length; i++) {
		if (str1[i] !== str2[i]) {
			diffCount++;
		}
	}
	return diffCount;
};