Python Solution Time -- > O(N) and Space --> O(1)
IntuitionIdea to solve this problem given by Claude
Not very Hard ApproachApproach*nums is used to unpack the list as the gcd and lcm function takes only intege
# Intuition
Idea to solve this problem given by Claude 
Not very Hard Approach 
# Approach
***nums** is used to unpack the list as the gcd and lcm function takes only integers

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
O(N) --> Linear
- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
O(1) --> Constant
# Code
```python3 []
class Solution:
    def maxScore(self, nums: List[int]) -> int:
        # This condition is for Edge Cases 
        if len(nums) == 1:
            return nums[0]**2

        # max_score should be default this 
        max_score = gcd(*nums) * lcm(*nums)
        
        # This Loop deletes single element from list very iteration 
        # New Iteration new element is Deleted
        # No Element left Behind 

        for i in range(len(nums)):
            num = nums[:i] + nums[i+1:]
            if num:
                curr_score = gcd(*num) * lcm(*num)
                max_score = max(curr_score, max_score)

        return max_score
```
['Python3']