https://github.com/tedlivist/sub_strings

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.
https://github.com/tedlivist/sub_strings

Last synced: 8 months ago
JSON representation

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.

• Host: GitHub
• URL: https://github.com/tedlivist/sub_strings
• Owner: TedLivist
• Created: 2020-11-24T14:31:42.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2021-04-09T09:51:30.000Z (about 5 years ago)
• Last Synced: 2025-06-04T13:10:45.830Z (about 1 year ago)
• Language: Ruby
• Homepage:
• Size: 1.95 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
#### This is my solution to the Sub Strings Exercise on the Ruby Track on Odin Project

> 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.

[The challenge can be found here](https://www.theodinproject.com/paths/full-stack-ruby-on-rails/courses/ruby-programming/lessons/sub-strings).