{"id":17525456,"url":"https://github.com/tedlivist/sub_strings","last_synced_at":"2025-10-23T17:03:57.367Z","repository":{"id":133563680,"uuid":"315658068","full_name":"TedLivist/sub_strings","owner":"TedLivist","description":"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.","archived":false,"fork":false,"pushed_at":"2021-04-09T09:51:30.000Z","size":2,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-04T13:10:45.830Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Ruby","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/TedLivist.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-11-24T14:31:42.000Z","updated_at":"2021-04-22T10:24:48.000Z","dependencies_parsed_at":null,"dependency_job_id":"7315008a-abb0-44e6-ad0e-068a0a4e82db","html_url":"https://github.com/TedLivist/sub_strings","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TedLivist%2Fsub_strings","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TedLivist%2Fsub_strings/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TedLivist%2Fsub_strings/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TedLivist%2Fsub_strings/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TedLivist","download_url":"https://codeload.github.com/TedLivist/sub_strings/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TedLivist%2Fsub_strings/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259211836,"owners_count":22822379,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-20T14:43:20.943Z","updated_at":"2025-10-23T17:03:57.299Z","avatar_url":"https://github.com/TedLivist.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"#### This is my solution to the Sub Strings Exercise on the Ruby Track on Odin Project\n\n\u003e An initial dictionary of words is provided.\n\u003e The function takes a string and the predefined dictionary and returns the number of times each word in the string occurs in the dictionary.\n\n[The challenge can be found here](https://www.theodinproject.com/paths/full-stack-ruby-on-rails/courses/ruby-programming/lessons/sub-strings).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftedlivist%2Fsub_strings","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftedlivist%2Fsub_strings","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftedlivist%2Fsub_strings/lists"}