{"id":19287674,"url":"https://github.com/hasannadeem/digsite-coding-challenge","last_synced_at":"2026-06-12T22:31:36.547Z","repository":{"id":168243817,"uuid":"221064794","full_name":"hasannadeem/digsite-coding-challenge","owner":"hasannadeem","description":"3 Ruby programming exercises(in PDF format) are added in the Repo. I had to provide solutions to those exercises in Ruby.","archived":false,"fork":false,"pushed_at":"2020-09-27T20:15:50.000Z","size":124,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-23T23:25:49.281Z","etag":null,"topics":["array-manipulations","coding-exercises","hash","minitest","ruby"],"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/hasannadeem.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":"2019-11-11T20:31:33.000Z","updated_at":"2021-11-08T09:06:33.000Z","dependencies_parsed_at":"2023-06-08T10:03:50.335Z","dependency_job_id":null,"html_url":"https://github.com/hasannadeem/digsite-coding-challenge","commit_stats":null,"previous_names":["hasannadeem/digsite-coding-challenge"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hasannadeem/digsite-coding-challenge","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasannadeem%2Fdigsite-coding-challenge","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasannadeem%2Fdigsite-coding-challenge/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasannadeem%2Fdigsite-coding-challenge/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasannadeem%2Fdigsite-coding-challenge/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hasannadeem","download_url":"https://codeload.github.com/hasannadeem/digsite-coding-challenge/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasannadeem%2Fdigsite-coding-challenge/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34265491,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-12T02:00:06.859Z","response_time":109,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["array-manipulations","coding-exercises","hash","minitest","ruby"],"created_at":"2024-11-09T22:06:47.476Z","updated_at":"2026-06-12T22:31:36.525Z","avatar_url":"https://github.com/hasannadeem.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Digsite - Coding Exercises\r\n\r\nImplemented coding exercises in ruby alongwith testcases using minitest.\r\n\r\n## Coding Exercise 1 (Bonus)\r\n\r\nProvided two solutions. First one with using array manipulations. Second one with using hash. Results from benchmark-ips shows that the solution with hash was more time efficient, but it involves the usage of hash(extra space). On the other side, array manipulations solution involves the shortlisting of positive elements + sorting + uniq and it involves more time consumption.\r\n\r\n## Built With\r\n\r\n- Ruby v-2.6.0\r\n- Minitest\r\n- Benchmark-ips\r\n\r\n## How to Run Test Suite\r\n\r\nTest cases are written using `minitest`\r\nAnyone who want to run it locally can use following process:\r\n\r\n1. Extract the zip file.\r\n2. Go to the `tests` directory i.e `cd DigsiteChallenge/tests`\r\n3. To run all the test cases use this:\r\n   - `bash driver.sh`\r\n4. For running individual test cases for coding exercises, use this:\r\n   - `ruby code1_test.rb`\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhasannadeem%2Fdigsite-coding-challenge","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhasannadeem%2Fdigsite-coding-challenge","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhasannadeem%2Fdigsite-coding-challenge/lists"}