Check if All the Integers in a Range Are Covered LeetCode solution in Python

1
class Solution:
2
    def isCovered(self, ranges: List[List[int]], left: int, right: int) -> bool:
3

4
        t = [0] * (60)
5

6
        for i in ranges:
7

8
            t[i[0]] += 1
9
            t[i[1] + 1] -= 1
10

11
        for i in range(1, len(t)):
12
            t[i] += t[i - 1]
13

14
        return min(t[left : right + 1]) >= 1