Simple Python solution || 100% faster
Code\npython3 []\nimport math\n\nclass Solution:\n    def maxScore(self, nums: List[int]) -> int:\n        if len(nums) == 1:\n            return nums[0]**2\n  
# Code\n```python3 []\nimport math\n\nclass Solution:\n    def maxScore(self, nums: List[int]) -> int:\n        if len(nums) == 1:\n            return nums[0]**2\n        max_score = 0\n\n        for i in range(-1,len(nums)):\n            if i == 0:\n                start = 1\n                gcd_value = nums[1]\n                lcm_value = nums[1]\n            else:\n                start = 0\n                gcd_value = nums[0]\n                lcm_value = nums[0]\n\n            for j in range(start, len(nums)):\n                if j == i:\n                    continue\n                gcd_value = math.gcd(gcd_value, nums[j])\n                lcm_value = (lcm_value * nums[j]) // math.gcd(lcm_value, nums[j])\n\n            max_score = max(max_score, gcd_value * lcm_value)\n\n        return max_score\n\n                \n```
['Python3']