Java's Substring Comparisons help find the lexicographically smallest and largest substrings of a given length. It efficiently sorts and compares substrings using string manipulation techniques. Ekbet12

My solution:

public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        String s = sc.nextLine();
        int k = sc.nextInt();
        String smallest = "";
        String largest = "";
        
        sc.close();
        
        ArrayList<String> arrayList = new ArrayList<>();

        for (int i = 0; i < s.length(); i++) {

            if ((i + k) <= s.length()) {
                arrayList.add(s.substring(i, i + k));
            }
        }

        smallest = Collections.min(arrayList);
        largest = Collections.max(arrayList);

        System.out.println(smallest + "\n" + largest);
    }

import java.util.Scanner;

public class Solution {

public static String getSmallestAndLargest(String s, int k) {

    String smallest = s.substring(0,k);
    String largest = s.substring(0,k);

    for (int i = 1 ; i + k <= s.length() ; i++) {

        String myWord = s.substring(i,i+k);

        if (smallest.compareTo(myWord) > 0) {

            smallest =  myWord ;

        } 

        if (largest.compareTo(myWord) < 0) {

            largest = myWord ;

        }
    }


    return smallest + "\n" + largest;
}


public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    String s = scan.next();
    int k = scan.nextInt();
    scan.close();

    System.out.println(getSmallestAndLargest(s, k));
}

}

import java.io.; import java.util.;

public class Solution {

public static void main(String[] args) {
    Scanner scanner=new Scanner(System.in);
    String s=scanner.next();
    int k=scanner.nextInt();
    ArrayList<String> sub=new ArrayList<>();
    for(int i=0;i<s.length();i++){
        if(i < s.length()-(k-1)){
           String subVals=s.substring(i,i+k); 
           sub.add(subVals);

        }
    }
    Collections.sort(sub);
    String first=sub.get(0);
    String last=sub.get(sub.size()-1);
    System.out.print(first + "\n" + last);
}

}

my solution -

public static String getSmallestAndLargest(String s, int k) {
        String smallest = "";
        String largest = "";
        java.util.ArrayList<String> array = new java.util.ArrayList<String>();
                
        for (int i=0; i <= (s.length() - k); i++) {
            array.add(s.substring(i, i+k));
        }
        
        java.util.Collections.sort(array); 

        smallest = array.get(0);
        largest = array.get(array.size() - 1);
     
        
        return smallest + "\n" + largest;
    }