Question

IN JAVA

(Maximum consecutive increasingly ordered sub-string)

Write a program that prompts the user to enter a string and displays the maximum consecutive increasingly ordered sub-string.

Analyze the time complexity of your program and explain.

Here is a sample run:

Enter a string: abcabcdgabxy

output

abcdg

Time complexity is O( ). -n must be display between the parenthesis.

Answer 1

`Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

import java.util.*;

public class TEST {
   public static void main(String[] args) {
       // Create a Scanner
       Scanner input = new Scanner(System.in);
       LinkedList<Character> max = new LinkedList<>();
       LinkedList<Character> list = new LinkedList<>();

       // Prompt the user to enter a string
       System.out.print("Enter a string: ");
       String string = input.nextLine();

       // Find the maximum consecutive increasingly ordered substring
       for (int i = 0; i < string.length(); i++) {        // single loop
           if (list.size() > 1 && string.charAt(i) <= list.getLast() &&
               list.contains(string.charAt(i))) {
               list.clear(); // Simple statement
           }

           list.add(string.charAt(i)); // Simple statement

           if (list.size() > max.size()) { // Simple statement
               max.clear();
               max.addAll(list);
           }
       }

       // Display the maximum consecutive
       // increasingly ordered substring
       for (Character ch: max) { // single loop
           System.out.print(ch); // Simple statement
       }
       System.out.println();
   }
}

Time complexity is O(n) since it is traversing whole string constant times.

Kindly revert for any queries

Thanks.