Tutte le sfide
Media 0 risolte 0% di accettazione

Spell Checker

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

Cosa imparerai

  • 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

Mostra traduzione

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.

Vincoli

0 ≤ dictionary size ≤ 2,000

0 ≤ length of text ≤ 10,000

Esempi

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

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

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

Output atteso:
string[] expected = new string[] {"teh", "cta"};

Spiegazione

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

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

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

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

Output atteso:
string[] expected = new string[] {"dont"};

Spiegazione

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

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

Lowercase the dictionary words once when you build the set.

Suggerimento 2

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

Suggerimento 3

Keep a second set of words already reported.

Complessità attesa

O(D + T) time, O(D + T) extra space

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.