Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
32 lines (27 loc) · 720 Bytes

File metadata and controls

32 lines (27 loc) · 720 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/**
* Hamming Distance: https://en.wikipedia.org/wiki/Hamming_distance
*
*
* Hamming distance is a metric for comparing two binary data strings.
*
* While comparing two binary strings of equal length, Hamming distance
* is the number of bit positions in which the two bits are different.
* The Hamming distance between two strings, a and b is denoted as d(a,b)
*/
/**
* @param {string} a
* @param {string} b
* @return {number}
*/
export const hammingDistance = (a, b) => {
if (a.length !== b.length) {
throw new Error('Strings must be of the same length')
}
let distance = 0
for (let i = 0; i < a.length; i += 1) {
if (a[i] !== b[i]) {
distance += 1
}
}
return distance
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.