def shortest_subarray(colors, C):
    n = len(colors)
    color_count = [0] * (C+1)
    left, right = 0, 0
    min_length = float('inf')
    count = 0
    while right < n:
        color_count[colors[right]] += 1
        if color_count[colors[right]] == 1:
            count += 1
        while count == C:
            min_length = min(min_length, right - left + 1)
            color_count[colors[left]] -= 1
            if color_count[colors[left]] == 0:
                count -= 1
            left += 1
        right += 1
    if min_length == float('inf'):
        return -1
    else:
        return min_length



Python3

INFOSYS EXAM ANS 10AM

ALL Slots are available

Telegram:- @allcoding1
                     @allcoding1

Discussion group:- @infosys_exam_Ans


Coding Ans:- https://instagram.com/allcoding1_official?igshid=OGQ2MjdiOTE=

Share with your friends

def next_stepping_number(N):
N = str(N)
for i in range(len(N) - 1):
if abs(int(N[i]) - int(N[i+1])) != 1:
return int(N[:i+1] + str(int(N[i]) + 1 if int(N[i]) < int(N[i+1]) else int(N[i]) - 1) + '9'*(len(N)-i-1))
return int(N) + 1

print(next_stepping_number(4)) # should return 5


INFOSYS EXAM ANS 10AM

ALL Slots are available


Telegram:- @allcoding1
@allcoding1

discussion group:- @Infosys_exam_Ans

Coding Ans :- https://instagram.com/allcoding1_official?igshid=OGQ2MjdiOTE=

Share with your friends

Python

Once check it out put

INFOSYS EXAM ANS 10AM

ALL Slots are available


Telegram:- @allcoding1
                     @allcoding1

discussion group:- @Infosys_exam_Ans

Coding Ans :- https://instagram.com/allcoding1_official?igshid=OGQ2MjdiOTE=

Share with your friends

def getLargestString(s, k):
    frequency_array = [0] * 26

    for i in range(len(s)):

        frequency_array[ord(s[i]) -
                        ord('a')] += 1
    ans = ""
    i = 25
    while i >= 0:
        if (frequency_array[i] > k):
            temp = k
            st = chr( i + ord('a'))
            
            while (temp > 0):
                ans += st
                temp -= 1
          
            frequency_array[i] -= k
            j = i - 1
            
            while (frequency_array[j] <= 0 and
                   j >= 0):
                j -= 1
            if (frequency_array[j] > 0 and
                j >= 0):
                str1 = chr(j + ord( 'a'))
                ans += str1
                frequency_array[j] -= 1
            
            else:
                break
        elif (frequency_array[i] > 0):
            temp = frequency_array[i]
            frequency_array[i] -= temp
            st = chr(i + ord('a'))
            while (temp > 0):
                ans += st
                temp -= 1
        else:
            i -= 1
            
    return ans          

if name == "main":
  
    S = input()
    k = 3
    print (getLargestString(S, k))


Python
Bob code

Telegram:- @allcoding1

// Infosys
// N flowers on a Recatangular pana
int ans = 100000000;
void solve(vector<int> a, int n, int k, int index, int sum,
           int maxsum)
{
    if (k == 1)
    {
        maxsum = max(maxsum, sum);
        sum = 0;
        for (int i = index; i < n; i++)
        {
            sum += a[i];
        }
        maxsum = max(maxsum, sum);
        ans = min(ans, maxsum);
        return;
    }
    sum = 0;
    for (int i = index; i < n; i++)
    {
        sum += a[i];
        maxsum = max(maxsum, sum);
        solve(a, n, k - 1, i + 1, sum, maxsum);
    }
}
int GetMaxBeauty(int N, int K, vector<int> A)
{

    solve(A, N, K, 0, 0, 0);
    return ans;
}

C++


INFOSYS EXAM ANS 10AM

ALL Slots are available


Telegram:- @allcoding1
                     @allcoding1

discussion group:- @Infosys_exam_Ans

Coding Ans :- https://instagram.com/allcoding1_official?igshid=OGQ2MjdiOTE=

Share with your friends