समस्या
For a word game, players enter a list of words and a letter, and the game shows only the words that use that letter. Upper and lower case count as the same letter, so K matches kite and k matches Kansas.
Implement contains_character(words, letter).
Input
words: The list of words.
letter: A single English letter.
Output
Return the words that contain the letter, in their original order and spelling. Repeated words are kept as many times as they appear. If no word matches, return an empty list.
सीमाएँ
0 ≤ length of words ≤ 1000
Each word has 1 to 30 ASCII letters
letter is one ASCII letter
उदाहरण
इनपुट:
words = ["apple", "Berry", "kiwi", "Grape"]
letter = "r"
अपेक्षित आउटपुट:
expected = ["Berry", "Grape"]
इनपुट:
std::vector<std::string> words = {"apple", "Berry", "kiwi", "Grape"};
std::string letter = "r";
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"Berry", "Grape"};
इनपुट:
string[] words = new string[] {"apple", "Berry", "kiwi", "Grape"};
string letter = "r";
अपेक्षित आउटपुट:
string[] expected = new string[] {"Berry", "Grape"};
व्याख्या
Berry and Grape contain an r; apple and kiwi do not.
इनपुट:
words = ["Ohio", "Utah", "Iowa"]
letter = "O"
अपेक्षित आउटपुट:
expected = ["Ohio", "Iowa"]
इनपुट:
std::vector<std::string> words = {"Ohio", "Utah", "Iowa"};
std::string letter = "O";
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"Ohio", "Iowa"};
इनपुट:
string[] words = new string[] {"Ohio", "Utah", "Iowa"};
string letter = "O";
अपेक्षित आउटपुट:
string[] expected = new string[] {"Ohio", "Iowa"};
व्याख्या
Case is ignored, so Ohio and Iowa both match.
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Convert both the word and the letter to the same case before comparing.
संकेत 2
Return the original word, not the converted copy.
संकेत 3
Do not remove duplicates; just test each word on its own.
अपेक्षित जटिलता
O(total letters) time, O(n) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।