Discussion on Java Substring Comparisons Challenge

Sort 1437 Discussions, By:

1 day ago+ 0 comments

public static String getSmallestAndLargest(String s, int k) {
    String smallest = s.substring(0, k);
    String largest = smallest;

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

    return smallest + "\n" + largest;
}

2 days ago+ 0 comments

Here are the solution of Java Substring Comparisons Hacker Rank Solution https://www.chase2learn.com/java-substring-comparisons-hacker-rank-solution/

5 days ago+ 0 comments

        String smallest = "";
        String largest = "";

        smallest=s.substring(0, k);
        largest=s.substring(0, k);
        int i=1;
        while((i+k)<=s.length()){
                if(smallest.compareTo(s.substring(i,i+k))>0){
                        smallest=s.substring(i, i+k);
                }
                else if(largest.compareTo(s.substring(i,i+k))<0){
                        largest=s.substring(i, i+k);
                }
                i++;
        }

6 days ago+ 0 comments

    public static String getSmallestAndLargest(String s, int k) 
    {
        int e,d=s.length()-k+1;
        String smallest="",largest="";
        String[] a=new String[d];
        try
        {
            for(int i=0;i<d;i++)
            {
                a[i]="";
                for(int j=i;j<(i+k);j++)
                    a[i]+=s.charAt(j);
            }
            smallest=a[0];
            largest=a[0];
            for(int i=0;i<a.length;i++)
            {
                e=largest.compareTo(a[i]);
                if(e<0)
                    largest=a[i];
                e=smallest.compareTo(a[i]);
                if(e>0)
                smallest=a[i];
            }
       }catch(Exception yti){}
        return smallest + "\n" + largest;
    }

1 week ago+ 0 comments

Java - hahahaha I did a bubble sort thinking I actually needed every substring in order...oh well, I needed the practice anyway lol

    public static String getSmallestAndLargest(String s, int k) {
        String smallest = "";
        String largest = "";
        int numSubs = s.length() - k + 1;
        String[] subs = new String[numSubs];
        
        for (int i = 0; i < numSubs; i++) {
            subs[i] = s.substring(i, i + k);
        }
        String temp = "";
            //BUBBLE SORT TIME YAYYYYYYYY
        for (int i = 0; i < numSubs - 1; i++) {
            for (int j = 0; j <  numSubs - i - 1; j++) {
                if (subs[j].compareTo(subs[j + 1]) > 0) {
                    temp = subs[j];
                    subs[j] = subs[j + 1];
                    subs[j + 1] = temp;
                }
            }
        }
        smallest = subs[0];
        largest = subs[numSubs - 1];
        
        return smallest + "\n" + largest;
    }

Load more conversations