Question

Do in Python

Problem 2 Assume s is a string of lower case characters. Write a program that prints the number of times the string ' lol' occurs in s For example, if s= 'azclololegghakl', then your program should print S Number of times lol occu rs is: 2 Problem 3 Assume s is a string of lower case characters Write a program that prints the longest substring of s in which the letters occur in alphabetical order. For example, if s ='wqlnhahjkojlzqkhizkq', then your program should print Longest substring in alphabetical order is: ahjko In the case of ties, print the first substring. For example, ifs then your program should print abcbcd' Longest substring in alphabetical order is: abc

Answer 1

Problem2: Code in python:

#string = "azclololegghaki"
string = input("Enter a string: ")
sub = input("Enter a substring: ")
sub = "lol"
count = 0
ind = 0
for i in string:
count += string.count(sub,ind,ind+3)
ind += 1
print("the number of times substring occures in string is:",count)

#string string sub = input("Enter a substring: ") "azclololegghaki " inputC"Enter a string: ") "lol" sub count ind = 0 for i in string: string.count(sub,ind,ind+3) count ind += 1 print("the number of times substring oCcures in string is:",count)

OUTPUT:

input Enter a string: azclololegghaki Enter a substring: lol the number of times substring occures in string is: 2 ...Program finished with exit code 0 Press ENTER to exit console.

Problem2: Code in python:

#s = "wqlnhahjkojlzqkhizkq"
s = input("Enter the string: ")
maxString = ""
maxCount = 0 ;

size = len(s)
string = ""
string += s[0]
i=1;
preChar = s[0]
while(i<size):
if(s[i]>s[i-1]):
string+=s[i]
else:
tempSize = len(string)
if(tempSize>maxCount):
maxString = string
maxCount = tempSize
string = s[i]
else:
string = s[i]
i+=1
print("Longest substring in alphabatical order is: ",maxString)

"wqlnhahjkojlzqkhizka" S = input("Enter the string: ") 10 #s = 11 maxString 13 maxCount = 0 ; 12 14 15 size = len(s) 16 string 17 string 18 i=1; 19 preChar = s[0] 20 while(i<size): 11 11 += if(s[i]>s[i-1]): string+=s[i] else: 21 22 23 Len(string if(tempSize>maxCount): string maxCount = tempSize s[i] 24 tempSize maxString string else: string s[i] it=1 32 printC"Longest substring in alphabatical order is: ",maxString) 25227238N3

OUTPUT:

Enter the string: wqlnhahjkojlzqkhizką Longest substring in alphabatical order is: ahjko ... Program finished with exit code 0 Press ENTER to exit console.

input Enter the string: abcbcd Longest substring in alphabatical order is: abc |...Program finished with exit code 0 Press ENTER to exit console.