{"id":27876769,"url":"https://github.com/ayubamini/oddoccurrencesinarray","last_synced_at":"2026-04-25T21:33:06.403Z","repository":{"id":193746017,"uuid":"380522800","full_name":"ayubamini/OddOccurrencesInArray","owner":"ayubamini","description":"Find value that occurs in odd number of elements.","archived":false,"fork":false,"pushed_at":"2021-06-26T16:55:37.000Z","size":35,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-05T02:54:16.578Z","etag":null,"topics":["array","iterative","javascript","nodejs","odds"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","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":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2021-06-26T14:34:19.000Z","updated_at":"2021-06-26T22:01:16.000Z","dependencies_parsed_at":"2023-09-09T19:43:10.387Z","dependency_job_id":null,"html_url":"https://github.com/ayubamini/OddOccurrencesInArray","commit_stats":null,"previous_names":["ayubamini/oddoccurrencesinarray"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ayubamini/OddOccurrencesInArray","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FOddOccurrencesInArray","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FOddOccurrencesInArray/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FOddOccurrencesInArray/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FOddOccurrencesInArray/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ayubamini","download_url":"https://codeload.github.com/ayubamini/OddOccurrencesInArray/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FOddOccurrencesInArray/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32278249,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-25T18:29:39.964Z","status":"ssl_error","status_checked_at":"2026-04-25T18:29:32.149Z","response_time":59,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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","iterative","javascript","nodejs","odds"],"created_at":"2025-05-05T02:52:13.568Z","updated_at":"2026-04-25T21:33:06.386Z","avatar_url":"https://github.com/ayubamini.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# OddOccurrencesInArray\nFind value that occurs in odd number of elements.\n\nA non-empty array A consisting of N integers is given. The array contains an odd number of elements, and each element of the array can be paired with another element that has the same value, except for one element that is left unpaired.\n\nFor example, in array A such that:\n\n    A[0] = 9  A[1] = 3  A[2] = 9\n    A[3] = 3  A[4] = 9  A[5] = 7\n    A[6] = 9\n    \nthe elements at indexes 0 and 2 have value 9,\nthe elements at indexes 1 and 3 have value 3,\nthe elements at indexes 4 and 6 have value 9,\nthe element at index 5 has value 7 and is unpaired.\n\n# Write a function:\nfunction solution(A);\n\nthat, given an array A consisting of N integers fulfilling the above conditions, returns the value of the unpaired element.\n\nFor example, given array A such that:\n\n    A[0] = 9  A[1] = 3  A[2] = 9\n    A[3] = 3  A[4] = 9  A[5] = 7\n    A[6] = 9\n    \nthe function should return 7, as explained in the example above.\n\nWrite an efficient algorithm for the following assumptions:\n\n    N is an odd integer within the range [1..1,000,000];\n    each element of array A is an integer within the range [1..1,000,000,000];\n    all but one of the values in A occur an even number of times.\n    \n    \n# Codility Result\n![alt text](https://github.com/ayubamini/OddOccurrencesInArray/blob/main/codility-score.PNG) \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayubamini%2Foddoccurrencesinarray","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fayubamini%2Foddoccurrencesinarray","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayubamini%2Foddoccurrencesinarray/lists"}