Java Substring Comparisons | Java HackerRank

Java Substring Comparisons

We define the following terms:

• Lexicographical Order, also known as alphabetic or dictionary order, orders characters as follows:

A < B <...< Y < Z < a < b <...< y < z

For example, ball < cat, dog < dorm, Happy < happy, Zoo < ball.

• A substring of a string is a contiguous block of characters in the string. For example, the substrings of abc are a, b, c, ab, bc, and abc.

Given a string, s, and an integer, k, complete the function so that it finds the lexicographically smallest and largest substrings of length k.

Input Format

The first line contains a string denoting s.

The second line contains an integer denoting k.

Constraints

• 1 <= |s| <= 1000
• s consists of English alphabetic letters only (i.e., [a-zA-Z]).

Output Format

Return the respective lexicographically smallest and largest substrings as a single newline-separated string.

Sample Input 0

welcometojava
3

Sample Output 0

ava
wel

Explanation 0

String s = "welcometojava" has the following lexicographically-ordered substrings of length k = 3:

["ava", "com", "elc", "eto", "jav", "lco", "met", "oja", "ome", "toj", "wel"]

We then return the first (lexicographically smallest) substring and the last (lexicographically largest) substring as two newline-separated values (i.e., ava\nwel).

The stub code in the editor then prints ava as our first line of output and wel as our second line of output.

Sample Output

welcometojava
3
ava
wel


...Program finished with exit code 0
Press ENTER to exit console.

Source Code

import java.util.Scanner;

public class Main {

    public static String getSmallestAndLargest(String s, int k) {
        
        int i, j, length;

        String temp = "";
        String smallest = s.substring(0, k);
        String largest = "";
        
        for(i = 0; i <= s.length()-k; i++){

            temp = s.substring(i, (i+k));

            if(temp.compareTo(smallest) <= 0){

                smallest = temp;
            }
            if(temp.compareTo(largest) >= 0){

                largest = temp;
            }
        }
        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));
    }
}

Sample Output

welcometojava
3
ava
wel


...Program finished with exit code 0
Press ENTER to exit console.

HackerRank