Goofy ahh solution
stupid as for me but correct solution of the problem\ncode explanation:\n# Code\npython3 []\ndef area(d, n):\n     return d[n][0] * d[n][1] #optimisating calcul
stupid as for me but correct solution of the problem\ncode explanation:\n# Code\n```python3 []\ndef area(d, n):\n     return d[n][0] * d[n][1] #optimisating calculations using function\nclass Solution:\n    \n    def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n        maxd = 0 #longest diagonal\n        n = 0 # integer for list with rectangle with longest diagonal\n        for i in range(0, len(dimensions)): #cycle to parse list\n            a = area(dimensions, n) #defining area of the rectangle with tle longest diagonal\n            t = sqrt((dimensions[i][0] ** 2) + (dimensions[i][1] ** 2)) #defining diagonal of the current rectangle\n            if (t > maxd) or (t >= maxd and area(dimensions, i)>=a): #if current diagonal longer than longest diagonal or if diagonal of current rectangle equal or greater than longest diagonal and area of current rectangle greater than area of the rectangle with longest diagonal then do...\n                n = i\n                maxd = t\n        return area(dimensions, n)\n```
['Python3']