Write a Java program that prompts the user to enter a string 2. Create two methods. One method will display the maximum consecutive increasingly ordered substring with the method signature: public static String maxSortedSubstring(String s) The second method will find the maximum increasingly ordered subsequence of characters. The signature of the method is as follows: public static String maxSortedSubSeq (String s) Sample Run: Enter a string: abcabcdgabxy Maximum consecutive substring is abcdg Maximum increasingly ordered subsequence of characters is abcdgxy Enter a string: abcabcdgabmnsxy Maximum consecutive substring is abmnsxy Maximum increasingly ordered subsequence of characters is abcdgmnsxy Enter a string: Welcome Maximum consecutive substring is Wel Maximum increasingly ordered subsequence of characters is Welo Enter a string: Programming Maximum consecutive substring is Pr Maximum increasingly ordered subsequence of characters is amn

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter7: Characters, Strings, And The Stringbuilder
Section: Chapter Questions
Problem 12RQ
icon
Related questions
Question

1. Write a Java program that prompts the user to enter a string

2. Create two methods. One method will display the maximum consecutive increasingly ordered substring with the method signature:

public static String maxSortedSubstring(String s)

The second method will find the maximum increasingly ordered subsequence of characters. The signature of the method is as follows:

public static String maxSortedSubSeq (String s)

Sample Run:
Enter a string: abcabcdgabxy

Maximum consecutive substring is abcdg
Maximum increasingly ordered subsequence of characters is abcdgxy

Enter a string: abcabcdgabmnsxy
Maximum consecutive substring is abmnsxy
Maximum increasingly ordered subsequence of characters is abcdgmnsxy

Enter a string: Welcome
Maximum consecutive substring is Wel
Maximum increasingly ordered subsequence of characters is Welo

Enter a string: Programming
Maximum consecutive substring is Pr
Maximum increasingly ordered subsequence of characters is amn

3. Analyze the time complexity of both methods in comments.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Developing computer interface
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT