Buddy Strings LeetCode solution in JavaScript

1
var buddyStrings = function (A, B) {
2
if (A.length != B.length) return false;
3
const diff = [];
4

5
for (let i = 0; i < A.length; i++) {
6
if (A[i] != B[i]) diff.push(i);
7
if (diff.length > 2) return false;
8
}
9
if (!diff.length) return A.length != [...new Set(A)].length;
10
const [i, j] = diff;
11
return A[i] == B[j] && B[i] == A[j];
12
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0