Question: 
Write a python function to count minimum number of swaps required to convert one binary string to another.


Model's Code:
def min_Swaps(s1, s2):
    if s1.count('1') != s2.count('1') or s1.count('0') != s2.count('0'):
        return "Not Possible"
    
    mismatch_1_to_0 = 0
    mismatch_0_to_1 = 0
    
    for a, b in zip(s1, s2):
        if a == '1' and b == '0':
            mismatch_1_to_0 += 1
        elif a == '0' and b == '1':
            mismatch_0_to_1 += 1
            
    return (mismatch_1_to_0 + mismatch_0_to_1) // 2



Sample Correct Code:
def min_Swaps(str1,str2) : 
    count = 0
    for i in range(len(str1)) :  
        if str1[i] != str2[i] : 
            count += 1
    if count % 2 == 0 : 
        return (count // 2) 
    else : 
        return ("Not Possible") 


Asserts:
assert min_Swaps("1101","1110") == 1
assert min_Swaps("111","000") == "Not Possible"
assert min_Swaps("111","110") == "Not Possible"


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 595 of 974: 442/595 (74.28571428571429%): success