Maximum Length - 0s or 1s

Maximum Length - 0s or 1s - CTS GenCNext 

Problem:

The program must accept a string S containing 0s and 1s as the input. The program must print the length of the longest substring in S consists of the maximum number of either 0s or 1s that appear consecutively. (However, the substring cannot occur at the beginning or end of the string). If there is no such substring, the program must print -1 as the output. 

Boundary Condition(s): 

1 <= Length of S <= 100 

Input Format: 

The first line contains S. 

Output Format: 

The first line contains the length of the longest substring in S or -1 as per the given conditions. 

Example Input/Output 1: 

Input: 10101000 

Output: 

1

Explanation: 

Here the given string is 10101000. The length of the longest substring with consecutive 0s or 1s (expect the substring at the beginning and end of the string S) is 1. Hence the output is 1. 

Example Input/Output 2: 

Input: 

010000001 

Output: 

6 

Example Input/Output 3: 

Input: 

111100000 

Output: 

-1

Program:

s = input().strip()

a = s[0]

m = []

for i in range(1,len(s)):

    if a[-1] == s[i]:

        a += s[i] 

    else: 

        m.append(len(a))

        a = s[i] 

if a != "":

    m.append(len(a))

try:    

    print(max(m[1:-1]))    

except:

    print(-1)

Comments

Post a Comment

Popular posts from this blog

Pronic Integers in N - InfyTQ question

Pronic Integers in N - InfyTQ question Problem:  The program must accept an integer N as the input. The program must print all the pronic integers formed by a series of continuously occurring digits (in the same order) in N as the output. The pronic integers can be represented as n*(n+1). Input:  93042861 Output: 930 30 0 42 2 6 Program: import math  s = input().strip() def check_pronic(num):      sq = math.floor(math.sqrt(num))      return (sq*(sq+1)) == num  l = []   for i in range(len(s)):      for j in range(i,len(s)):          substr = int(s[i:j+1])          if s[i:j+1] == "0":             l.append(substr)         elif s[i:j+1][0]!='0' and check_pronic(substr):             l.append(substr)  print(*l)             Expl...
Read more

Count Strong Points - Accenture

 Count Strong Points - Accenture Problem: The program must accept an integer matrix of size RxC as the input. The program must print the number of strong points in the given matrix as the output. The strong points are located at the element(s) whose all the surrounding elements are smaller than the given element. Input:  3 3  56 92 45  19 41 51  55 31 80 Output: 3  Program: n,m = map(int,input().split()) l = []  for i in range(n):      l.append(list(map(int,input().split()))) count = 0      for i in range(n):      for j in range(m):         c = 0         if i-1 >= 0 and l[i-1][j] >= l[i][j]:             c = 1          if i+1 < n and l[i+1][j] >= l[i][j]:              c = 1          if j-1 >= 0 and l[i][j-1] >= l[i][j]:     ...
Read more

Letters at position of multiples of a number

Letters at position of multiples of a number   Problem: A string of length L consists of characters is passed as input to the program. A given number N is also passed as the input to the program. The program must print the characters at the positions which are multiples of the given number.  Input Format:  The first line will contain the string of length L.  The second line will contain the number N.  Boundary Conditions:  3 <= L <= 50  1 <= N <= 30  Output Format:  The characters at the positions which are multiples of the given number.  Example Input/Output 1:  Input:  abcdef  3  Output:  cf  Explanation:  Multiples of 3 are like 3,6,9,... So the characters at positions 3,6 namely c and f are printed as output.  Example Input/Output 2:  Input:  environment  2  Output:  niomn  Explanation:  As it must be multiples of 2, the characters at even pos...
Read more