Search
⌘K

Leetcode 3334. Find the Maximum Factor Score of Array

Given an array of small positive integers (n ≤ 100, nums[i] ≤ 30), remove at most one element to maximize the product of the GCD and LCM of the remaining elements (empty array score = 0). The task is to compute and return that maximum factor score.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.