human
Count of subarrays of size K having at least one pair with absolute difference divisible by K | Function to return the required number of subarrays.
Return number of possible subarrays of length K.
Driver Code"
How can the above be solved in Python?

Write me a code to count of subarrays of size K having at least one pair with absolute difference divisible by K and the other steps required?
assistant
#Here is code to count of subarrays of size K having at least one pair with absolute difference divisible by K and the other steps required.
 def findSubarrays ( arr , N , K ) :
	return N - K + 1 ;
if __name__ == ' _ _ main _ _ ' :
	arr = [ 1 , 5 , 3 , 2 , 17 , 18 ] ;
	K = 4 ;
	N = len ( arr ) ;
	print ( findSubarrays ( arr , N , K ) ) ;