Skip to content

Commit 1fe04ee

Browse files
committed
#2942: description update
1 parent 700928e commit 1fe04ee

File tree

1 file changed

+10
-10
lines changed

1 file changed

+10
-10
lines changed

c-sharp/Problems/arrays-and-hashing/FindWordsContainingCharacter.cs

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -4,30 +4,30 @@
44
**
55
* You are given a 0-indexed array of strings words and a character x.
66
* Return an array of indices representing the words that contain the character x.
7-
*
7+
*
88
* Note that the returned array may be in any order.
9-
*
9+
*
1010
* Example 1:
1111
* Input: words = ["leet","code"], x = "e"
1212
* Output: [0,1]
1313
* Explanation: "e" occurs in both words: "leet", and "code". Hence, we return indices 0 and 1.
14-
*
14+
*
1515
* Example 2:
1616
* Input: words = ["abc","bcd","aaaa","cbc"], x = "a"
1717
* Output: [0,2]
1818
* Explanation: "a" occurs in "abc", and "aaaa". Hence, we return indices 0 and 2.
19-
*
19+
*
2020
* Example 3:
2121
* Input: words = ["abc","bcd","aaaa","cbc"], x = "z"
2222
* Output: []
2323
* Explanation: "z" does not occur in any of the words. Hence, we return an empty array.
24-
*
24+
*
2525
* Constraints:
26-
* - 1 <= words.length <= 50
27-
* - 1 <= words[i].length <= 50
28-
* - x is a lowercase English letter.
29-
* - words[i] consists only of lowercase English letters.
30-
*
26+
* 1 <= words.length <= 50
27+
* 1 <= words[i].length <= 50
28+
* x is a lowercase English letter.
29+
* words[i] consists only of lowercase English letters.
30+
*
3131
* Hint 1: Use two nested loops.
3232
**
3333
* https://leetcode.com/problems/find-words-containing-character/

0 commit comments

Comments
 (0)