Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2261. K Divisible Elements Subarrays
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source