human
For each lowercase English alphabet find the count of strings having these alphabets | Function to find the countStrings for each letter [ a - z ].
Initialize result as zero.
Mark all letter as not visited.
Loop through each strings.
Increment the global counter for current character of string.
Instead of re - initialising boolean vector every time we just reset all visited letter to false.
Print count for each letter.
Driver code.
Given array of strings.
Call the countStrings function"
How can the above be solved in Python?

Can you provide a code to for each lowercase English alphabet find the count of strings having these alphabets and the other steps required?
assistant
#Here is code to for each lowercase English alphabet find the count of strings having these alphabets and the other steps required.
 def CountStrings ( s ) :
	size = len ( s )
	count = [ 0 ] * 26
	visited = [ False ] * 26
	for i in range ( size ) :
		for j in range ( len ( s [ i ] ) ) :
			if visited [ ord ( s [ i ] [ j ] ) - ord ( ' a ' ) ] == False :
				count [ ord ( s [ i ] [ j ] ) - ord ( ' a ' ) ] += 1
			visited [ ord ( s [ i ] [ j ] ) - ord ( ' a ' ) ] = True
		for j in range ( len ( s [ i ] ) ) :
			visited [ ord ( s [ i ] [ j ] ) - ord ( ' a ' ) ] = False
	for i in range ( 26 ) :
		print ( count [ i ] , end = ' ▁ ' )
if __name__ == ' _ _ main _ _ ' :
	s = [ " i " , " will " , " practice " , " everyday " ]
	CountStrings ( s )