Question

Please answer in Python 3! 16.2** (Maximum increasingly ordered subsequence) Write a program that prompts the user to enter a string and displays the maximum increasingly ordered subsequence of characters. Analyze the time complexity of your program. Here is a sample run: Enter a string: Welcome Maximum consecutive substring is ['W', 'e', 'l', 'o']

Answer 1

If You Have Any Doubt Please Comment Below

Code:-

def Maximumconsecutivesubstring(str):
  
l = len(str)
count = 0
  
# Find the maximum repeating
# character starting from str[i]
res = str[0]
for i in range(l):
  
cur_count = 1
for j in range(i + 1, l):
  
if (str[i] != str[j]):
break
cur_count += 1
  
# Update result if required
if cur_count > count :
count = cur_count
res = str[i]
return res
  
# Driver code
if __name__ == "__main__":
  
str = "Hi this is HomeworkLib qqquestiom"
print("Maximum consecutive substring is ")
print(Maximumconsecutivesubstring(str))

Output:-