{"id":27876767,"url":"https://github.com/ayubamini/maxproductofthree","last_synced_at":"2025-05-05T02:52:13.232Z","repository":{"id":193746014,"uuid":"380639640","full_name":"ayubamini/MaxProductOfThree","owner":"ayubamini","description":"Maximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).","archived":false,"fork":false,"pushed_at":"2021-06-27T03:16:11.000Z","size":294,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2023-09-09T19:32:55.403Z","etag":null,"topics":["codility","csharp","netcore","vscode"],"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-27T03:07:42.000Z","updated_at":"2023-09-09T19:32:58.659Z","dependencies_parsed_at":"2023-09-09T19:43:10.360Z","dependency_job_id":null,"html_url":"https://github.com/ayubamini/MaxProductOfThree","commit_stats":null,"previous_names":["ayubamini/maxproductofthree"],"tags_count":null,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FMaxProductOfThree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FMaxProductOfThree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FMaxProductOfThree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ayubamini%2FMaxProductOfThree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ayubamini","download_url":"https://codeload.github.com/ayubamini/MaxProductOfThree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252429948,"owners_count":21746571,"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":["codility","csharp","netcore","vscode"],"created_at":"2025-05-05T02:52:12.768Z","updated_at":"2025-05-05T02:52:13.223Z","avatar_url":"https://github.com/ayubamini.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# MaxProductOfThree\nMaximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).\n\n# Task description\nA non-empty array A consisting of N integers is given. The product of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ≤ P \u003c Q \u003c R \u003c N).\n\nFor example, array A such that:\n\n    A[0] = -3\n    A[1] = 1\n    A[2] = 2\n    A[3] = -2\n    A[4] = 5\n    A[5] = 6    \ncontains the following example triplets:\n\n    (0, 1, 2), product is −3 * 1 * 2 = −6\n    (1, 2, 4), product is 1 * 2 * 5 = 10\n    (2, 4, 5), product is 2 * 5 * 6 = 60\nYour goal is to find the maximal product of any triplet.\n\nWrite a function:\n\n    class Solution { public int solution(int[] A); }\n\nthat, given a non-empty array A, returns the value of the maximal product of any triplet.\n\nFor example, given array A such that:\n\n      A[0] = -3\n      A[1] = 1\n      A[2] = 2\n      A[3] = -2\n      A[4] = 5\n      A[5] = 6\nthe function should return 60, as the product of triplet (2, 4, 5) is maximal.\n\nWrite an efficient algorithm for the following assumptions:\n\n    N is an integer within the range [3..100,000];\n    each element of array A is an integer within the range [−1,000..1,000].\n \n # Codility Analyse\n ![alt text](https://github.com/ayubamini/MaxProductOfThree/blob/master/codility-result.PNG) \n # Codility Analyse\n ![alt text](https://github.com/ayubamini/MaxProductOfThree/blob/master/codility-analyes.PNG) \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayubamini%2Fmaxproductofthree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fayubamini%2Fmaxproductofthree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayubamini%2Fmaxproductofthree/lists"}