Skip to content

Updated Solution #37

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
codepool20 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Updated Solution #37

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Updated Solution 
The question has got an update and hence the solution needs to be updated as well.
  • Loading branch information
@codepool20
codepool20 authored Oct 26, 2020
commit cf6bfdc80a68e4d9f71e216ff47f5c6aae5af066
52 changes: 26 additions & 26 deletions ...ava/com/javaaid/hackerrank/solutions/languages/java/strings/JavaSubstringComparisons.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,29 +1,29 @@
/**
*
*/
package com.javaaid.hackerrank.solutions.languages.java.strings;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

/**
* @author Kanahaiya Gupta
*
*/
public class JavaSubstringComparisons {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
ArrayList<String> list = new ArrayList<String>();
String s = sc.next();
int k = sc.nextInt();
for (int i = 0; i <= s.length() - k; i++) {
String tmp = s.substring(i, k + i);
list.add(tmp);
}
Collections.sort(list);
System.out.println(list.get(0));
System.out.println(list.get(list.size() - 1));
sc.close();
}
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 = 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;
}
}
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));
}
}