def solution(S, K):
    n = len(S)
    res = float('inf')
    for i in range(n - K + 1):
        t = S[:i] + S[i + K:]
        compressed = ''
        count = 1
        for j in range(1, len(t)):
            if t[j] == t[j - 1]:
                count += 1
            else:
                compressed += t[j - 1] + (str(count) if count > 1 else '')
                count = 1
        if t:
            compressed += t[-1] + (str(count) if count > 1 else '')
        res = min(res, len(compressed))
    return res

Microsoft ✔️

Proof ✔️✅

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 ✔️