{"id":27876770,"url":"https://github.com/ayubamini/findsmallestpositiveinterger","last_synced_at":"2025-10-09T01:32:06.589Z","repository":{"id":193746001,"uuid":"380656167","full_name":"ayubamini/FindSmallestPositiveInterger","owner":"ayubamini","description":"A function to find the smallest positive integer (greater than 0) that does not occur in A","archived":false,"fork":false,"pushed_at":"2021-06-27T17:29:08.000Z","size":96,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-07-31T10:59:51.534Z","etag":null,"topics":["array","codility","coding-challenge","csharp","netcore5"],"latest_commit_sha":null,"homepage":"","language":"C#","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/ayubamini.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}},"created_at":"2021-06-27T05:11:58.000Z","updated_at":"2022-07-20T16:36:16.000Z","dependencies_parsed_at":"2023-09-09T19:43:10.484Z","dependency_job_id":null,"html_url":"https://github.com/ayubamini/FindSmallestPositiveInterger","commit_stats":null,"previous_names":["ayubamini/findsmallestpositiveinterger"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ayubamini/FindSmallestPositiveInterger","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FFindSmallestPositiveInterger","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FFindSmallestPositiveInterger/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FFindSmallestPositiveInterger/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FFindSmallestPositiveInterger/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ayubamini","download_url":"https://codeload.github.com/ayubamini/FindSmallestPositiveInterger/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FFindSmallestPositiveInterger/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279000725,"owners_count":26082895,"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","status":"online","status_checked_at":"2025-10-08T02:00:06.501Z","response_time":56,"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","codility","coding-challenge","csharp","netcore5"],"created_at":"2025-05-05T02:52:13.633Z","updated_at":"2025-10-09T01:32:06.560Z","avatar_url":"https://github.com/ayubamini.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# FindSmallestPositiveInterger\n\nThis is a demo task.\n\nWrite a function:\n\n    class Solution { public int solution(int[] A); }\n\nthat, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.\n\nFor example, \n    \n    Given A = [1, 3, 6, 4, 1, 2], the function should return 5.\n\n    Given A = [1, 2, 3], the function should return 4.\n\n    Given A = [−1, −3], the function should return 1.\n\nWrite an efficient algorithm for the following assumptions:\n\n    N is an integer within the range [1..100,000];\n    each element of array A is an integer within the range [−1,000,000..1,000,000].\n    \n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayubamini%2Ffindsmallestpositiveinterger","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fayubamini%2Ffindsmallestpositiveinterger","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayubamini%2Ffindsmallestpositiveinterger/lists"}