Skip to content

[Feature] Hamming distance forEach #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

[Feature] Hamming distance forEach #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 21 additions & 1 deletion Beginner/hammingDistance/index-SOLUTION.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,4 +13,24 @@ function hammingDistance(stringA, stringB) {
} else {
throw new Error('Strings do not have equal length')
}
}
}

// USING FOREACH LOOP
function hammingDistanceForEach(stringA, stringB) {
if (stringA.length !== stringB.length) {
console.error('The two strings should have the same length.')
return
}

let diffCounter = 0
const arrStringA = [...stringA.toLowerCase()]
const arrStringB = [...stringB.toLowerCase()]

arrStringA.forEach((value, index) => {
if (arrStringA[index] !== arrStringB[index]) {
diffCounter++
}
})

return diffCounter
}