Solve Hackerrank problem

anitsh · anitsh · commit 5a380388ef45 · 2022-09-26T21:24:31.000+04:00
Problem - https://www.hackerrank.com/challenges Implement ParameterizedTest
diff --git a/src/main/java/hackerrank/Java/CompareSubstrings.java b/src/main/java/hackerrank/Java/CompareSubstrings.java
@@ -0,0 +1,68 @@
+package hackerrank.Java;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Scanner;
+
+public class CompareSubstrings {
+    /**
+     * Given String s, find the lexicographically
+     * smallest and largest substrings of length k.
+     *
+     * Parameters:
+     *     string s: a string
+     *     int k: the length of the substrings to find
+     *
+     * Returns
+     *     string: the string ' + "\n" + ' where and are the two substrings
+     */
+
+    public String getSmallestAndLargest(String s, int k) {
+        String smallest = "";
+        String largest = "";
+
+        ArrayList sortedSubString = getSortedSubString(s, k);
+        smallest = sortedSubString.get(0).toString();
+        largest = sortedSubString.get(
+                sortedSubString.size() - 1).toString();
+
+        return smallest+ " " + largest;
+    }
+
+    private ArrayList getSortedSubString(String s, int k) {
+        String smallest = "", largest = "";
+
+        int i, j;
+        int stringLength = s.length();
+        ArrayList<String> subStringList
+                = new ArrayList<String>();
+
+        for (i = 0; i < s.length()-k+1  ; i++) {
+            subStringList.add(s.substring(i, k+i));
+        }
+
+        Collections.sort(subStringList);
+        return subStringList;
+    }
+
+    public static void main(String[] args) {
+        Scanner scan = new Scanner(System.in);
+        String s = scan.next();
+        int k = scan.nextInt();
+        scan.close();
+
+        CompareSubstrings compareSubstrings =
+                new CompareSubstrings();
+
+
+        System.out.println(
+                compareSubstrings.getSmallestAndLargest(
+                        s, k));
+    }
+}
+
+
+/**
+ * Problem
+ * https://www.hackerrank.com/challenges/java-string-compare
+ */
diff --git a/src/test/java/hackerranktest/java/CompareSubstringsTest.java b/src/test/java/hackerranktest/java/CompareSubstringsTest.java
@@ -0,0 +1,22 @@
+package hackerranktest.java;
+
+import hackerrank.Java.CompareSubstrings;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.CsvSource;
+
+public class CompareSubstringsTest {
+    @ParameterizedTest
+    @CsvSource({
+            "welcometojava, 3, ava wel",
+            "ASDFHDSFHsdlfhsdlfLDFHSDLFHsdlfhsdlhkfsdlfLHDFLSDKFHsdfhsdlkfhsdlfhsLFDLSFHSDLFHsdkfhsdkfhsdkfhsdfhsdfjeaDFHSDLFHDFlajfsdlfhsdlfhDSLFHSDLFHdlfhs, 30, ASDFHDSFHsdlfhsdlfLDFHSDLFHsdl sdlkfhsdlfhsLFDLSFHSDLFHsdkfhs"
+    })
+    void toUpperCase_ShouldGenerateTheExpectedUppercaseValue(
+            String s, int k, String expected) {
+
+        CompareSubstrings compareSubstrings = new CompareSubstrings();
+        String actual = compareSubstrings.getSmallestAndLargest(s, k);
+        Assertions.assertEquals(expected, actual);
+    }
+}
diff --git a/src/test/java/whiteboardtest/WhiteboardTest.java b/src/test/java/whiteboardtest/WhiteboardTest.java
@@ -21,52 +21,9 @@ public void shouldReturnTrueForOddNumbers(int number) {
         Assertions.assertTrue(isOdd(number));
     }
 
-    /**
-     * Given String s, find the lexicographically
-     * smallest and largest substrings of length k.
-     *
-     * Parameters:
-     *     string s: a string
-     *     int k: the length of the substrings to find
-     *
-     * Returns
-     *     string: the string ' + "\n" + ' where and are the two substrings
-     */
-    public String[] getSmallestAndLargestArray(String s, int k) {
-        String smallest = "", largest = "";
-
-//        Make a substring of lenght k.
-//        Sort the String array
-//        smallest = array[0]
-//        largest = array[len-1]
-
-        int i, j;
-        int stringLength = s.length();
-        ArrayList<String> subStringList
-                = new ArrayList<String>();
-
-        for (i = 0; i < s.length()-2  ; i++) {
-            subStringList.add(s.substring(i, k+i));
-        }
-
-        Collections.sort(subStringList);
-        smallest = subStringList.get(0);
-        largest = subStringList.get(subStringList.size()-1);
 
-        return new String[]{smallest, largest};
-    }
 
-    @Test
-    public void shouldReturnSmallestAndLargestSubstring() {
-        String s  =  "welcometojava";
 
-        int k =  3;
-        String[] actual = getSmallestAndLargestArray(s, k);
-        String [] expected = new String[]{"ava", "wel"};
-
-        Assertions.assertArrayEquals(expected, actual);
-
-    }
 
     @Test
     public void main() {
