Leetcode 2261. K Divisible Elements Subarrays

Count the number of distinct contiguous subarrays of nums that contain at most k elements divisible by p. The core challenge is to enumerate and deduplicate up to O(n^2) candidate subarrays while tracking the count of elements divisible by p.