Find the Maximum Factor Score of Array
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def maxScore(self, nums: List[int]) -> int:\n\n        n, ctr = len(nums), Counter(nums)\n\n        mx = gcd(*nums) * lcm(*nums)\n \n        if n > 1:\n\n            for i in range(n):\n                if ctr[nums[i]] > 1: continue\n\n                arr = nums[:i] + nums[i+1:]\n                mx = max(mx, gcd(*arr) * lcm(*arr))\n        \n        return mx\n```
['Python3']