Count Unhappy Friends LeetCode solution in JavaScript

1
var unhappyFriends = function (n, preferences, pairs) {
2
let happyMap = new Array(n);
3
for (let [i, j] of pairs) {
4
happyMap[i] = preferences[i].indexOf(j);
5
happyMap[j] = preferences[j].indexOf(i);
6
}
7

8
let unhappy = 0;
9
for (let i = 0; i < n; i++) {
10
for (let j = 0; j < happyMap[i]; j++) {
11
let partner = preferences[i][j];
12
if (preferences[partner].indexOf(i) < happyMap[partner]) {
13
unhappy++;
14
break;
15
}
16
}
17
}
18

19
return unhappy;
20
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0