Leetcode 1630. Arithmetic Subarrays

class Solution:
    def checkArithmeticSubarrays(self, nums: List[int], l: List[int], r: List[int]) -> List[bool]:
        m = len(l)
        result = []
        for i in range(m):
            left = l[i]
            right = r[i]
            temp = nums[left:right+1]
            temp.sort()
            flag = True
            for j in range(2, len(temp)):
                if temp[j] - temp[j-1] != temp[j-1] - temp[j-2]:
                    flag = False
                    break
            result.append(flag)
        return result