A sequence of characters is entered (Latin alphabet). Of them are required to make as many words as possible. Tell me how to implement it. Thank you in advance.

Closed due to the fact that the essence of the question is incomprehensible to the participants jfs , Harry , Kromster , user194374, aleksandr barakin 12 Jun '16 at 11:56 .

Try to write more detailed questions. To get an answer, explain what exactly you see the problem, how to reproduce it, what you want to get as a result, etc. Give an example that clearly demonstrates the problem. If the question can be reformulated according to the rules set out in the certificate , edit it .

  • 2
    Can you give an example? And what is meant by the word, the word of the English language, or any sequence of letters? - AivanF.
  • Like "t", "a", "c" => "cat", "at"? - AivanF.

1 answer 1

For each entered symbol:

  1. run through the dictionary and select words that begin with this letter and correspond in length to the number of characters entered.

  2. run through the sample of words and check each letter in the word, starting from the second, to match one of the list of entered characters

  3. If the check has reached the end of the word, then output it.