Determine if Two Strings Are Close LeetCode solution in JavaScript

1
var closeStrings = function (word1, word2) {
2
if (word1.length != word2.length) return false;
3
let map1 = new Map(),
4
map2 = new Map(),
5
freq1 = new Set(),
6
freq2 = new Set();
7
for (let i = 0; i < word1.length; i++)
8
map1.set(word1[i], map1.get(word1[i]) + 1 || 1),
9
map2.set(word2[i], map2.get(word2[i]) + 1 || 1);
10
if (map1.size != map2.size) return false;
11
for (const [key, value] of map1) {
12
if (!map2.has(key)) return false;
13
freq1.add(value);
14
freq2.add(map2.get(key));
15
}
16
if (freq1.size != freq2.size) return false;
17
for (const freq of freq1) if (!freq2.has(freq)) return false;
18
return true;
19
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0