Todos los desafíos
Fácil 0 resueltos 0% de aceptación

Contains the Character

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

Lo que aprenderás

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

Problema

Ver traducción

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.

Restricciones

0 ≤ length of words ≤ 1000

Each word has 1 to 30 ASCII letters

letter is one ASCII letter

Ejemplos

Ejemplo 1
Entrada:
words = ["apple", "Berry", "kiwi", "Grape"]
letter = "r"

Salida esperada:
expected = ["Berry", "Grape"]
Entrada:
std::vector<std::string> words = {"apple", "Berry", "kiwi", "Grape"};
std::string letter = "r";

Salida esperada:
std::vector<std::string> expected = {"Berry", "Grape"};
Entrada:
string[] words = new string[] {"apple", "Berry", "kiwi", "Grape"};
string letter = "r";

Salida esperada:
string[] expected = new string[] {"Berry", "Grape"};

Explicación

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

Ejemplo 2
Entrada:
words = ["Ohio", "Utah", "Iowa"]
letter = "O"

Salida esperada:
expected = ["Ohio", "Iowa"]
Entrada:
std::vector<std::string> words = {"Ohio", "Utah", "Iowa"};
std::string letter = "O";

Salida esperada:
std::vector<std::string> expected = {"Ohio", "Iowa"};
Entrada:
string[] words = new string[] {"Ohio", "Utah", "Iowa"};
string letter = "O";

Salida esperada:
string[] expected = new string[] {"Ohio", "Iowa"};

Explicación

Case is ignored, so Ohio and Iowa both match.

Cómo abordarlo

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

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

Pista 2

Return the original word, not the converted copy.

Pista 3

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

Complejidad esperada

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

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

Clasificación

Clasificación completa

La mejor solución aprobada de cada programador. Las más rápidas, ligeras y mejor valoradas van primero.

Aún no hay soluciones aprobadas. Resuélvelo y quédate el primer puesto.

Aprende de otros

Soluciones de la comunidad

Aún no hay soluciones publicadas. Resuelve este reto para compartir la primera.