Question

Python3 :

Write the function longestRun(s, chars) that takes a possibly-empty string s and a second possibly-empty string of chars. We will say that a character is "good" if it is in the chars string (case insensitively, so "A" and "a" would match). The function should return the length of the longest consecutive run of good characters in the given string s. For example, consider: longestRun("abbcazBbcababb","bz"). This returns 3 (look for "zBb").

Restrictions: for loop, slicing cannot be used, if the question can be solved without using in keyword, please do not use in key word

Answer 1

def longRun(s,chars):

s=s.lower()

chars=chars.lower()

i=0
count=0
l=[]
while i <len(s):
if s[i] in chars:
count+=1
i+=1
else:
i=i+1
l.append(count)
count=0
  
print(max(l))
  
====>>>I have provided the images of the code in the below section<<<<<<<======

output:

venkat HomeworkLib.py - C:/Users/Venky/Downloads/venkat HomeworkLib.py (3.7.3) Eile Edit Format Bun Options Window Help s="abbcazBbcababb" chars"bz" s = s.lower ( chars-chars.lower () i-0 count 0 l= [] while i <len (s): if s[i] rs: i]) countt=1 it =1 else: print (s[i] i-it1 l.append (count) count-0 print (max (l) ) Ln: 21 Col: 0 19:15 ENG I:9 Col: 24 12-07-2019

Python 3.7.3 Shell Eile Edit P File Edit Shell Debug Options Window Help S="abbc Python 3.7.3 (v3.7.3:ef4ec 6ed12, Mar 25 2019, 22:22:05) [MSC v.1916 64 bit (AMD6 4) on win32 chars=" S.S.owType "help", "copyright", "credits" or "license () " for more information. chars c >>> i-0 -======== ============= RESTART: C:/Users/Venky/Downloads/venkat HomeworkLib.py count-03 l=[] while i els print (m Ln: 10 Col:8 19:18 ENG 12-07-2019 Ln: 6 ColA 24