Question

You would like to set a password for an email account. However, there are two restrictions on the format of the password. It has to contain at least one uppercase character and it cannot contain any digits. You are given a string S consisting of N alphanumerical characters. You would like to find the longest substring of Sthat is a valid password. A substring is defined as a contiguous segment of a string. For example, given "a0Ba", the substrings that are valid passwords are "B" and "Ba". Note that "aBa" is not a substring and "a0B" is not a valid password. Write a function: class Solution { public int solution(String s); } that, given a non-empty string S consisting of N characters, returns the length of its longest substring that is a valid password. If there is no such substring, your function should return -1. For example, given "a0Ba", your function should return 2, as explained above. Given "aObb", your function should return -1, since there is no substring that satisfies the restrictions on the format of a valid password. Assume that: • Nis an integer within the range (1..200); • string S consists only of alphanumerical characters (a-z and/or A-Z and/or 0-9).

Please solve in Python.

Answer 1

class Solution:
def __init__(self, s, N):
self.s = s
self.N = N
  
def my_func(self,s,N):
count=0
a=[]
for i in range(len(s)):
if(s[i]>='0' and s[i]<='9'):
a.append(i)
a.append(len(s))
i=0
for k in range(len(a)):
for j in s[i:a[k]]:
if(j>='A' and j<='Z'):
if(len(s[i:a[k]])>count):
count=len(s[i:a[k]])
i=a[k]+1
if(count!=0):
return count
else:
return -1
  
s=input()
N=len(s)
s1=Solution(s,N)
print(s1.my_func(s,N))

Note: In the above program first I have taken input from the user and send it to a function in my class in that function first I have searched for indexes of numbers in string so that I can find the contiguous substrings without numbers and next I have checked whether the substrings have an upper case letter or not. if it has an uppercase letter then i have stored the length of it in count if the next substring is also having uppercase then I have allocated the max length of those substrings in the count and returned it. if the count is 0 then I returned -1

c Chegg X W3 Python Classes х - Online Python Compiler - online X G python program to find longest - + x Х i onlinegdb.com/online_python_compiler A Error ... Run Debug Stop Share A Save {} Beautify Language Python 3 OnlineGDB beta online compiler and debugger for c/c++ code. compile. run. debug. share. IDE My Projects Classroom new Learn Programming Programming Questions Sign Up Login main.py 1 class Solution: 2. def init__(self, s, N): 3 self.s S 4 self.N = N. 5 6 def my_func(self,s,N): 7 count=0 8 a=[] 9 for i in range(len(s)): 10 if(s[i]>='0' and s[i]<='9'): 11 a.append(i) 12 a.append(len(s)) 13 i=0 14 for k in range(len(a)): 15 for j in s[i:a[k]]: 16 if(j>='A' and j<='Z'): 17 if(len(s[i:a[k]]) >count): 18 count=len(s[i:a[k]]) 19 i=a[k]+1 20 if(count !=0); 21 return count 22 else: 23 return -1 24 25 26 27 28 11.9K input абва 2 ... Program finished with exit code 0 About • FAQ • Blog Terms of Use . Contact Us .GDB Press ENTER to exit console.] Tutorial - Credits . Privacy © 2016 - 2020 GDB Online Activate Windows Go to Settings to activate Windows B Type here to search TT 12:40 AM 7/11/2020