human
Minimum number of swaps to make two binary string equal | Function to calculate min swaps to make binary strings equal.
Count of zero 's .
Count of one 's .
As discussed above.
Driver code"
How can the above be solved in Python?

What is a code to minimum number of swaps to make two binary string equal and the other steps required?
assistant
#Here is code to minimum number of swaps to make two binary string equal and the other steps required.
 def minSwaps ( s1 , s2 ) :
	c0 = 0 ; c1 = 0 ;
	for i in range ( len ( s1 ) ) :
		if ( s1 [ i ] == '0' and s2 [ i ] == '1' ) :
			c0 += 1 ;
		elif ( s1 [ i ] == '1' and s2 [ i ] == '0' ) :
			c1 += 1 ;
	ans = c0 // 2 + c1 // 2 ;
	if ( c0 % 2 == 0 and c1 % 2 == 0 ) :
		return ans ;
	elif ( ( c0 + c1 ) % 2 == 0 ) :
		return ans + 2 ;
	else :
		return - 1 ;
if __name__ == " _ _ main _ _ " :
	s1 = "0011" ; s2 = "1111" ;
	ans = minSwaps ( s1 , s2 ) ;
	print ( ans ) ;