Easy solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
import math
from functools import *
class Solution:
    def maxScore(self, nums: List[int]) -> int:
        def gcdd(*nums):
            return reduce(math.gcd,nums)
        def lcmm(*nums):
            return reduce(math.lcm,nums)
        n=len(nums)
        k=gcdd(*nums)
        k1=lcmm(*nums)
        max_score = k * k1
        for i in range(n):
            f = nums[:i] + nums[i+1:] 
            if f:
                max_score = max(max_score, gcdd(*f) * lcmm(*f))
        
        return max_score
```
['Python3']