K Divisible Elements Subarrays LeetCode solution in Python

1
class Solution:
2
    def countDistinct(self, nums: List[int], k: int, p: int) -> int:
3
        n = len(nums)
4
        sub_arrays = set()
5

6
        # generate all combinations of subarray
7
        for start in range(n):
8
            cnt = 0
9
            temp = ""
10
            for i in range(start, n):
11
                if nums[i] % p == 0:
12
                    cnt += 1
13
                temp += str(nums[i]) + ","  # build the sequence subarray in CSV format
14
                if cnt > k:  # check for termination
15
                    break
16
                sub_arrays.add(temp)
17

18
        return len(sub_arrays)