Path Existence Queries in a Graph I

class Solution:
    def pathExistenceQueries(self, n: int, nums: List[int], maxDiff: int, queries: List[List[int]]) -> List[bool]:
        chk = [0 for _ in range(n)]
        for i in range(1, n):
            chk[i] = chk[i - 1] + int(nums[i] - nums[i - 1] > maxDiff)
        answer = [False for _ in range(len(queries))]
        for i, query in enumerate(queries):
            answer[i] = chk[query[0]] == chk[query[1]]
        return answer