-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2942_Find_Words_Containing_Character.swift
More file actions
46 lines (36 loc) · 1.22 KB
/
2942_Find_Words_Containing_Character.swift
File metadata and controls
46 lines (36 loc) · 1.22 KB
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
37
38
39
40
41
42
43
44
45
46
/*
Done 25.05.2025. Revisited: N/A
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.
Constraints:
1 <= words.length <= 50
1 <= words[i].length <= 50
x is a lowercase English letter.
words[i] consists only of lowercase English letters.
*/
import Foundation
class P2942 {
// MARK: - Option 1. Time: O(?). Memory: O(?)
func findWordsContaining(_ words: [String], _ x: Character) -> [Int] {
var res: [Int] = []
for (index, word) in words.enumerated() {
if word.contains(x) {
res.append(index)
}
}
return res
}
}