Java String Compare

Given a string, find out the lexicographically smallest and largest substring of length k.

[Note: Lexicographic order is also known as alphabetic order dictionary order. So "ball" is smaller than "cat", "dog" is smaller than "dorm". Capital letter always comes before smaller letter, so "Happy" is smaller than "happy" and "Zoo" is smaller than "ball".]

Input Format

First line will consist a string containing english alphabets which has at most 1000 characters. 2nd line will consist an integer k.

Output Format

In the first line print the lexicographically minimum substring. In the second line print the lexicographically maximum substring.

Sample Input

welcometojava
3
Sample Output

ava
wel
Explanation

Here is the list of all substrings of length 3:

wel
elc
lco
com
ome
met
eto
toj
oja
jav
ava
Among them ava is the smallest and wel is the largest.




import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner sc = new Scanner(System.in);
        String str = sc.nextLine();
        int n = sc.nextInt();
        String max = str.substring(0,n);
        for(int i = 0; i<=str.length()-n;i++){
            String temp = str.substring(i,i+n);
            if(temp.compareTo(max) >= 0){
                max = temp;
            }
        }
        String min = str.substring(0,n);
        for(int i = 0; i<=str.length()-n;i++){
            String temp = str.substring(i,i+n);
            if(temp.compareTo(max) < 0){
                min = temp;
            }
        }
        System.out.println(min);
         System.out.println(max);
    }
}