All challenges
Easy 0 solved 0% acceptance

Contains the Character

Keep only the words that contain a given letter, ignoring case.

What you'll learn

  • Check whether a string contains a character
  • Compare letters while ignoring case
  • Keep matching items in their original order

Problem

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.

Constraints

0 ≤ length of words ≤ 1000

Each word has 1 to 30 ASCII letters

letter is one ASCII letter

Examples

Example 1
Input:
words = ["apple", "Berry", "kiwi", "Grape"]
letter = "r"

Expected output:
expected = ["Berry", "Grape"]
Input:
std::vector<std::string> words = {"apple", "Berry", "kiwi", "Grape"};
std::string letter = "r";

Expected output:
std::vector<std::string> expected = {"Berry", "Grape"};
Input:
string[] words = new string[] {"apple", "Berry", "kiwi", "Grape"};
string letter = "r";

Expected output:
string[] expected = new string[] {"Berry", "Grape"};

Explanation

Berry and Grape contain an r; apple and kiwi do not.

Example 2
Input:
words = ["Ohio", "Utah", "Iowa"]
letter = "O"

Expected output:
expected = ["Ohio", "Iowa"]
Input:
std::vector<std::string> words = {"Ohio", "Utah", "Iowa"};
std::string letter = "O";

Expected output:
std::vector<std::string> expected = {"Ohio", "Iowa"};
Input:
string[] words = new string[] {"Ohio", "Utah", "Iowa"};
string letter = "O";

Expected output:
string[] expected = new string[] {"Ohio", "Iowa"};

Explanation

Case is ignored, so Ohio and Iowa both match.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Convert both the word and the letter to the same case before comparing.

Hint 2

Return the original word, not the converted copy.

Hint 3

Do not remove duplicates; just test each word on its own.

Expected complexity

O(total letters) time, O(n) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.