Number of Strings That Appear as Substrings in Word LeetCode solution in JavaScript

1
/**
2
* @param {string[]} patterns
3
* @param {string} word
4
* @return {number}
5
*/
6
var numOfStrings = function (patterns, word) {
7
let result = 0;
8

9
for (let char of patterns) {
10
if (word.includes(char)) {
11
result++;
12
} else {
13
result += 0;
14
}
15
}
16

17
return result;
18
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0