Another Candidate also Cleared round 1
😍😍✅

Contact us for Round 2 👇

@ILOVEU_143 ✅

TECH Mahindra Exam

Round 2

Help available.👨‍💻

100% Clearance GUARANTEE.✅

Check our past Results. 👇👇

https://t.me/Coding_000/5567?single
https://t.me/Coding_000/5563?single

Contact @ILOVEU_143 ✅

TECH Mahindra Exam

Round 2

Help available.👨‍💻

100% Clearance GUARANTEE.✅

Check our past Results. 👇👇

https://t.me/Coding_000/5567?single
https://t.me/Coding_000/5563?single

Contact @ILOVEU_143 ✅

Tech Mahindra Round-2 Qualified 😊✅🥳🥳

💯% Clearance Guarantee ✅

Dm @ILOVEU_143
                
For Any Exam Help 😁✌️

Accenture Exam Cleared Successfully ✅
Candidate Got interview Mail 🥳😍

Contact @ILOVEU_143👨‍💻

Share @coding_000❤️

Tech Mahindra Round-2 Qualified 😊✅🥳🥳

💯% Clearance Guarantee ✅

Dm @ILOVEU_143
                
For Any Exam Help 😁✌️

Those who wants IBM

Help Free join and share my channel
✅ Share 😍😊✅

Don't pay to anyone 😊

we will post all solutions 😊

@Coding_000❤️ @Coding_000

share ✅  share ✅ share✅ our channel 😊

CONTACT- @ILOVEU_143 ❤️

Show some love and support guys😁

IBM EXAM ON 27
PLEASE CHECK IT

Share @coding_000

Dm @ILOVEU_143✅


For Coding Help or Any Exam Help 😄


💯 Clearance ✅

TECH Mahindra Exam

Round 2

Help available.👨‍💻

100% Clearance GUARANTEE.✅

Check our past Results. 👇👇

https://t.me/Coding_000/5567?single
https://t.me/Coding_000/5563?single

Contact @ILOVEU_143 ✅

def max_zeros(L, K):

    if K == 0:

        return L

    zeros = L - K

    max_length = zeros // (K + 1)

    remaining = zeros % (K + 1)

    if remaining > 0:

        max_length += 1

    return max_length

L, K = map(int, input().split())

print(max_zeros(L, K),end="")

Zero Count ✅
Python3

Good String
def main():
    s = input()
    n = len(s)
    s1 = input()
    n1 = len(s1)
   
    ascii = [ord(char) for char in s]
    ascii1 = [ord(char) for char in s1]
   
    nearest_values = []
   
    for i in range(n1):
        min_diff = float('inf')
        nearest_value = -1
        for j in range(n):
            diff = abs(ascii1[i] - ascii[j])
            if diff < min_diff:
                min_diff = diff
                nearest_value = ascii[j]
        nearest_values.append(nearest_value)
   
    count = sum(abs(ascii1[i] - nearest_values[i]) for i in range(n1))
    print(count)

if name == "main":
    main()

Binary String


#include <iostream>
using namespace std;

int main() {
    int l, k;
    cin >> l >> k;

    int max_zeros = 0;
    int current_zeros = 0;

    for (int i = 0; i < l; i++) {
    if (B[i] == '1') {
        max_zeros = max(max_zeros, current_zeros);
        current_zeros = 0;
    } else {
        current_zeros++;
    }
    }

    max_zeros = max(max_zeros, current_zeros);

    cout << max_zeros << endl;

    return 0;
}

Binary String
C++
TCS Codevita