def solution(s, t):
    n = len(s)
    sw = s[0] > t[0]
    c = 0
    for k in range(n):
        if s[k] != t[k]:
            if (s[k] > t[k]) == sw:
                c += 1
    return c

Microsoft ✔️

Join the Wipro discussion group

https://t.me/code_alphix2

💯 Free coding Help.....✔️✅

Wipro Elite 3 PM HELP AVAILABLE

ONLY FULL SLOT✔️

DM @Mrtrueliving_ix ✔️💻

n = int(input().strip())
print(min(int(input().strip()) for _ in range(n)))

Minimum value✔️

Those who need 💯 Test Clearance

Wipro || 6 PM slots are available

DM @MRTRUELIVING_IX ✔️