This is my version of implementing a string searching algorithm. It is a method that takes a string as an argument and an array of valid substrings as the second argument. It returns a hash listing each substring and how many times it was found (as keys and values respectively).
This is a project from The Odin Project.
Open your Terminal/Command Line. Navigate to the directory where your version will live. Type in the following:
$ git clone https://github.com/JonathanYiv/substrings.git
$ cd substrings
$ substrings.rb
This should be relatively easy.
It was relatively easy.