classSolution: defcheckArithmeticSubarrays(self, nums: List[int], l: List[int], r: List[int]) -> List[bool]: ans = [] n = len(l) for i inrange(n): tmp = nums[l[i]:r[i]+1] tmp.sort() ok = 1 g = tmp[1] - tmp[0] for j inrange(1, len(tmp)): if tmp[j] - tmp[j-1] != g: ok = 0 break if ok: ans.append(True) else: ans.append(False) return ans