python 3 easy solution in O((N**2)*log(N)) time complexity
```class Solution:\n    def checkArithmeticSubarrays(self, nums: List[int], l: List[int], r: List[int]) -> List[bool]:\n        answer=[]\n        for i in rang
```class Solution:\n    def checkArithmeticSubarrays(self, nums: List[int], l: List[int], r: List[int]) -> List[bool]:\n        answer=[]\n        for i in range(len(l)):\n            temp=nums[l[i]:r[i]+1]\n            temp.sort()\n            x=temp[1]-temp[0]\n            flag=0\n            for j in range(2,len(temp)):\n                if temp[j]-temp[j-1]!=x:\n                    flag=1\n                    break\n            if flag==0:\n                answer.append(True)\n            else:\n                answer.append(False)\n        return answer\n                    \n
['Python', 'Python3']