An initial dictionary of words is provided. The function takes a string and the predefined dictionary and returns the number of times each word in the string occurs in the dictionary.
-
Notifications
You must be signed in to change notification settings - Fork 0
This is a Ruby challenge that solves the Sub Strings Challenge as described on the Odin Project. The function takes a string and a defined dictionary and returns a hash containing the number of times each word in the string occurs in dictionary.
TedLivist/sub_strings
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This is a Ruby challenge that solves the Sub Strings Challenge as described on the Odin Project. The function takes a string and a defined dictionary and returns a hash containing the number of times each word in the string occurs in dictionary.