Intermedio 0 resueltos 0% de aceptación

Spell Checker

List the words in a text that are missing from a dictionary, ignoring case and punctuation.

Lo que aprenderás

  • Load words into a set for fast lookups
  • Split text into words with a character rule
  • Report results in first-seen order without duplicates

Problema

Ver traducción

A word processor underlines words it does not know. Load the dictionary into a set (a hash table) so each lookup is fast, then scan the text.

A word is a maximal run of English letters (A-Z, a-z) and apostrophes; every other character (spaces, digits, punctuation) separates words. Words are compared without regard to case, so The matches the dictionary entry the.

Implement spell_checker(dictionary, text).

Input

dictionary: The known words. They may be in any case.

text: The text to check.

Output

Return the misspelled words in lowercase, in the order they first appear in the text, each listed only once. Return an empty list when every word is known.

Restricciones

0 ≤ dictionary size ≤ 2,000

0 ≤ length of text ≤ 10,000

Ejemplos

Ejemplo 1
Entrada:
dictionary = ["the", "cat", "sat", "on", "mat"]
text = "The cat sat on teh mat, the cta!"

Salida esperada:
expected = ["teh", "cta"]
Entrada:
std::vector<std::string> dictionary = {"the", "cat", "sat", "on", "mat"};
std::string text = "The cat sat on teh mat, the cta!";

Salida esperada:
std::vector<std::string> expected = {"teh", "cta"};
Entrada:
string[] dictionary = new string[] {"the", "cat", "sat", "on", "mat"};
string text = "The cat sat on teh mat, the cta!";

Salida esperada:
string[] expected = new string[] {"teh", "cta"};

Explicación

teh and cta are not in the dictionary. Case and the comma do not matter for the other words: ["teh", "cta"].

Ejemplo 2
Entrada:
dictionary = ["Don't", "stop"]
text = "don't STOP, dont stop dont"

Salida esperada:
expected = ["dont"]
Entrada:
std::vector<std::string> dictionary = {"Don't", "stop"};
std::string text = "don't STOP, dont stop dont";

Salida esperada:
std::vector<std::string> expected = {"dont"};
Entrada:
string[] dictionary = new string[] {"Don't", "stop"};
string text = "don't STOP, dont stop dont";

Salida esperada:
string[] expected = new string[] {"dont"};

Explicación

don't keeps its apostrophe and matches; dont is unknown and is listed once: ["dont"].

Cómo abordarlo

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

Pista 1

Lowercase the dictionary words once when you build the set.

Pista 2

Build the current word character by character and finish it when you meet a non-letter that is not an apostrophe.

Pista 3

Keep a second set of words already reported.

Complejidad esperada

O(D + T) time, O(D + T) 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.