Easy python sorting array
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def checkArithmeticSubarrays(self, nums: List[int], l: List[int], r: List[int]) -> List[bool]:\n        m=[]\n        for i in range(len(l)):\n            k=nums[l[i]:r[i]+1]\n            k.sort()\n            l1=[k[i+1]-k[i] for i in range(len(k)-1)] \n            if len(set(l1))==1:\n                m.append(True)\n            else:\n                m.append(False)\n        return m\n\n\n        \n```
['Python3']