{"id":23272401,"url":"https://github.com/letsdeepchat/equality-in-array","last_synced_at":"2026-01-19T07:32:56.229Z","repository":{"id":153852811,"uuid":"426862382","full_name":"letsdeepchat/Equality-in-Array","owner":"letsdeepchat","description":"Given an array of integers, determine the minimum number of elements to delete to leave only elements of equal value.  Example arr= [1,2,2,3]  Delete the 2 elements 1 and 3 leaving arr as [2,2]. If both twos plus either the 1 or the 3 are deleted, it takes 3 deletions to leave either [3] or [1]. The minimum number of deletions is . 2  Input Format The first line contains an integer n, the number of elements in arr. The next line contains n space-separated integers arr[i].  Constraints 0\u003cn\u003c=100 1\u003c=arr[i]\u003c=100 Sample Input 5 3 3 2 1 3","archived":false,"fork":false,"pushed_at":"2021-12-08T04:07:22.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-02-12T15:41:46.369Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"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/letsdeepchat.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":"2021-11-11T03:49:23.000Z","updated_at":"2021-12-08T04:07:25.000Z","dependencies_parsed_at":null,"dependency_job_id":"96c5f7f0-fd04-482c-9f0d-0def7a68d8e2","html_url":"https://github.com/letsdeepchat/Equality-in-Array","commit_stats":null,"previous_names":["letsdeepchat/equality-in-array"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsdeepchat%2FEquality-in-Array","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsdeepchat%2FEquality-in-Array/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsdeepchat%2FEquality-in-Array/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsdeepchat%2FEquality-in-Array/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/letsdeepchat","download_url":"https://codeload.github.com/letsdeepchat/Equality-in-Array/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247463933,"owners_count":20942950,"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-12-19T19:15:20.960Z","updated_at":"2026-01-19T07:32:56.215Z","avatar_url":"https://github.com/letsdeepchat.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Equality-in-Array\nGiven an array of integers, determine the minimum number of elements to delete to leave only elements of equal value.  Example arr= [1,2,2,3]  Delete the 2 elements 1 and 3 leaving arr as [2,2]. If both twos plus either the 1 or the 3 are deleted, it takes 3 deletions to leave either [3] or [1]. The minimum number of deletions is . 2  Input Format The first line contains an integer n, the number of elements in arr. The next line contains n space-separated integers arr[i].  Constraints 0\u0026lt;n\u0026lt;=100 1\u0026lt;=arr[i]\u0026lt;=100 Sample Input 5 3 3 2 1 3\n# Equality-in-Array\nGiven an array of integers, determine the minimum number of elements to delete to leave only elements of equal value.  Example arr= [1,2,2,3]  Delete the 2 elements 1 and 3 leaving arr as [2,2]. If both twos plus either the 1 or the 3 are deleted, it takes 3 deletions to leave either [3] or [1]. The minimum number of deletions is . 2  Input Format The first line contains an integer n, the number of elements in arr. The next line contains n space-separated integers arr[i].  Constraints 0\u0026lt;n\u0026lt;=100 1\u0026lt;=arr[i]\u0026lt;=100 Sample Input 5 3 3 2 1 3\nEquality in Array\nGiven an array of integers, determine the minimum number of elements to delete to leave only elements of equal value.\n\nExample\narr= [1,2,2,3]\n\nDelete the 2 elements 1 and 3 leaving arr as [2,2]. If both twos plus either the 1 or the 3 are deleted, it takes 3 deletions to leave either [3] or [1]. The minimum number of deletions is . 2\n\nInput Format\nThe first line contains an integer n, the number of elements in arr. The next line contains n space-separated integers arr[i].\n\nConstraints\n0\u003cn\u003c=100\n1\u003c=arr[i]\u003c=100\nSample Input\n5\n3 3 2 1 3\nSample Output\n2\n\nExplanation\nDelete 2 and 1 to leave [3,3,3]. This is minimal. The only other options are to delete 4 elements to get an array of either [1] or [2].\n\n\nInput\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fletsdeepchat%2Fequality-in-array","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fletsdeepchat%2Fequality-in-array","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fletsdeepchat%2Fequality-in-array/lists"}