Hackerrank – Java Solution – Java Substring Comparisons Solution

Hackerrank - Java Solutions Hackerrank Online Judge Solution

Hackerrank – Java Solution – Java Substring Comparisons Solution

HackerRank Problem Solution

Problem Name – Java Substring Comparisons

Problem Link –  https://www.hackerrank.com/challenges/java-string-compare/problem
Level – String

Java Code

import java.util.Scanner;

public class Solution {
public static void main(String[] args) {
/* Save input */
Scanner scan = new Scanner(System.in);
String s = scan.nextLine();
int k = scan.nextInt();
scan.close();

/* Create smallest and largest strings and initialize them */
String smallest = s.substring(0, k);
String largest = s.substring(0, k);

for (int i = 0; i <= s.length() - k; i++) {
String curr = s.substring(i, i + k);
if (smallest.compareTo(curr) > 0){
smallest = curr;
}
if (largest.compareTo(curr) < 0) {
largest = curr;
}
}

/* Print results */
System.out.println(smallest);
System.out.println(largest);
}
}

Tags: HackerRank Online Judge Solution, HackerRank OJ Solution list, HackerRank Problems Solution, HackerRank solver, HackerRank all problem solution list, HackerRank solution in java, Hackerrank Java Solution,Hackerrank – Java Solution – Java Substring Comparisons Solution, Hackerrank Online Judge Solution, Hackerrank – Java Solutions,

Leave a Reply

Your email address will not be published.