FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2339,3  "name": "k-divisible-elements-subarrays",4  "difficulty": "Medium",5  "link": "https://leetcode.com/problems/k-divisible-elements-subarrays/",6  "date": "2022-04-24",7  "task_description": "Given an integer array `nums` and two integers `k` and `p`, return _the number of **distinct subarrays,** which have **at most**_ `k` _elements _that are _divisible by_ `p`. Two arrays `nums1` and `nums2` are said to be **distinct** if: They are of **different** lengths, or There exists **at least** one index `i` where `nums1[i] != nums2[i]`. A **subarray** is defined as a **non-empty** contiguous sequence of elements in an array. **Example 1:** ``` **Input:** nums = [**2**,3,3,**2**,**2**], k = 2, p = 2 **Output:** 11 **Explanation:** The elements at indices 0, 3, and 4 are divisible by p = 2. The 11 distinct subarrays which have at most k = 2 elements divisible by 2 are: [2], [2,3], [2,3,3], [2,3,3,2], [3], [3,3], [3,3,2], [3,3,2,2], [3,2], [3,2,2], and [2,2]. Note that the subarrays [2] and [3] occur more than once in nums, but they should each be counted only once. The subarray [2,3,3,2,2] should not be counted because it has 3 elements that are divisible by 2. ``` **Example 2:** ``` **Input:** nums = [1,2,3,4], k = 4, p = 1 **Output:** 10 **Explanation:** All element of nums are divisible by p = 1. Also, every subarray of nums will have at most 4 elements that are divisible by 1. Since all subarrays are distinct, the total number of subarrays satisfying all the constraints is 10. ``` **Constraints:** `1 <= nums.length <= 200` `1 <= nums[i], p <= 200` `1 <= k <= nums.length` **Follow up:** Can you solve this problem in O(n2) time complexity?",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [ 2 ,3,3, 2 , 2 ], k = 2, p = 2",12      "output": "11 "13    },14    {15      "label": "Example 2",16      "input": "nums = [1,2,3,4], k = 4, p = 1",17      "output": "10 "18    }19  ],20  "constraints": [21    "They are of different lengths, or",22    "There exists at least one index i where nums1[i] != nums2[i].",23    "1 <= nums.length <= 200",24    "1 <= nums[i], p <= 200",25    "1 <= k <= nums.length"26  ],27  "python_template": "class Solution(object):\n    def countDistinct(self, nums, k, p):\n        \"\"\"\n        :type nums: List[int]\n        :type k: int\n        :type p: int\n        :rtype: int\n        \"\"\"\n        ",28  "java_template": "class Solution {\n    public int countDistinct(int[] nums, int k, int p) {\n        \n    }\n}",29  "metadata": {30    "func_name": "countDistinct"31  }32}