-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchallenges-55.js
36 lines (27 loc) · 1.02 KB
/
challenges-55.js
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
33
34
35
36
// #Question 2942. Find Words Containing Character
// You are given a 0-indexed array of strings words and a character x.
// Return an array of indices representing the words that contain the character x.
// Note that the returned array may be in any order.
// Example 1:
// Input: words = ["leet","code"], x = "e"
// Output: [0,1]
// Explanation: "e" occurs in both words: "leet", and "code". Hence, we return indices 0 and 1.
// Example 2:
// Input: words = ["abc","bcd","aaaa","cbc"], x = "a"
// Output: [0,2]
// Explanation: "a" occurs in "abc", and "aaaa". Hence, we return indices 0 and 2.
// Example 3:
// Input: words = ["abc","bcd","aaaa","cbc"], x = "z"
// Output: []
// Explanation: "z" does not occur in any of the words. Hence, we return an empty array.
// #Solution
var findWordsContaining = function (words, x) {
let newArr = [];
let res = words.map((item, index) => {
if (item.includes(x.toLowerCase())) {
newArr.push(index);
}
});
return newArr;
};
findWordsContaining(["leet", "code"], "e");