16. Java Substring Comparisons - String | Java | Hackerrank

we will solve our next hackerrank string java challenge - Java Substring Comparisons.

[santoshmakane]

This is working code but you have to use Java 15 or java 16.
.
.
import java.util.Scanner;

public class Solution {

public static String getSmallestAndLargest(String s, int k) {
String smallest = "";
String largest = "";

java.util.SortedSet<String> x1=new java.util.TreeSet<String>();
for(int i=0;i<=s.length()-k;i++)
{
x1.add((s.substring(i, i+k)));

}
smallest=x1.first();
largest=x1.last();

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));
}
}

[shauryaverma_c_]

we cannot import any class then how will we solve this challenge

[AmritAgarwal]

how we will get to know which collection class we have to use

[chhabilalmoi]

this code is not working showing Symbol not found on SortedSet..

[kusumam]

How to perform permutation of a string in java

[MrJohnnyLongHorn]

I think, this way is not works. Because in 2019 we can't add "java.util.*" (in java.util.* TreeAs cmd).

[sachinsrivastava]

import java.util.Scanner;

public class Solution {

public static String getSmallestAndLargest(String s, int k) {
String smallest = "";
String largest = "";



java.util.SortedSet<String> x1=new java.util.TreeSet<String>();
for(int i=0;i<=s.length()-k;i++)
{
x1.add((s.substring(i, i+k)));

}
smallest=x1.first();
largest=x1.last();

return smallest + "\n" + largest;
}




ye hi asli working code