<SYSTEM_TASK:>
Given the following text description, write Python code to implement the functionality described.
<END_TASK>
<USER_TASK:>
Description:
Maximum number of set bits count in a K
Function that find Maximum number of set bit appears in a substring of size K . ; Traverse string 1 to k ; Increment count if character is set bit ; Traverse string k + 1 to length of string ; Remove the contribution of the ( i - k ) th character which is no longer in the window ; Add the contribution of the current character ; Update maxCount at for each window of size k ; Return maxCount ; Driver code

<ASSISTANT_TASK:>
Python Code:
def maxSetBitCount(s , k ) : 
	 maxCount = 0 
 n = len(s ) 
 count = 0 
 for i in range(k ) : 
	 if(s[i ] == '1' ) : 
	 count += 1 
   maxCount = count 
 for i in range(k , n ) : 
	 if(s[i - k ] == '1' ) : 
	 count -= 1 
  if(s[i ] == '1' ) : 
	 count += 1 
  maxCount = max(maxCount , count ) 
  return maxCount 
  if __name__== ' __main __' : 
	 s = "100111010"
 k = 3 
 print(maxSetBitCount(s , k ) ) 
 
<END_TASK>
