Add new script test

src/main/java/com/ctci/arraysandstrings/StringCompression.java

@@ -13,7 +13,7 @@ public class StringCompression {
      * @param str input string containing only a-z characters, both cases
      * @return which ever is the shorter string
      */
-    private static String compressString(String str) {
+     static String compressString(String str) {
         StringBuilder compressedSb = new StringBuilder();
         int countConsecutive = 0;
         for (int i = 0; i < str.length(); i++) {

src/main/java/com/ctci/arraysandstrings/StringCompressionTest.java

@@ -0,0 +1,43 @@
+package com.ctci.arraysandstrings;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class StringCompressionTest {
+    @Test
+    public void testEmptyString() {
+        String str = "";
+        assertEquals(StringCompression.compressString(str), "");
+    }
+
+    @Test
+    public void testSingleCharacter() {
+        String str = "a";
+        assertEquals(StringCompression.compressString(str), "a");
+    }
+
+    @Test
+    public void testNoConsecutiveCharacter() {
+        String str = "abcdef";
+        assertEquals(StringCompression.compressString(str), "abcdef");
+    }
+
+    @Test
+    public void testCompressedNotShorterThanOriginal() {
+        String str = "aabbccddee";
+        assertEquals(StringCompression.compressString(str), "aabbccddee");
+    }
+
+    @Test
+    public void testLowercaseNexttoUppercase() {
+        String str = "aAbbBBBCCCCcccc";
+        assertEquals(StringCompression.compressString(str), "a1A1b2B3C4c4");
+    }
+
+    @Test
+    public void testRandomString() {
+        String str = "aabcccccccccccccccccccccccccaaa";
+        assertEquals(StringCompression.compressString(str), "a2b1c25a3");
+    }
+}

src/main/java/com/leetcode/strings/StrStrTest.java

@@ -0,0 +1,56 @@
+package com.leetcode.strings;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class StrStrTest {
+    @Test
+    public void testEdgeCase1() {
+        String haystack = "";
+        String needle = "";
+        assertEquals(StrStr.strStr(haystack, needle), 0);
+    }
+
+    @Test
+    public void testEdgeCase2() {
+        String haystack = "";
+        String needle = "abc";
+        assertEquals(StrStr.strStr(haystack, needle), -1);
+    }
+
+    @Test
+    public void testEdgeCase3() {
+        String haystack = "aaaa";
+        String needle = "";
+        assertEquals(StrStr.strStr(haystack, needle), 0);
+    }
+
+    @Test
+    public void testEdgeCase4() {
+        String haystack = "aaa";
+        String needle = "aaaa";
+        assertEquals(StrStr.strStr(haystack, needle), -1);
+    }
+
+    @Test
+    public void testRandomCase1NotFound() {
+        String haystack = "aaaa";
+        String needle = "bba";
+        assertEquals(StrStr.strStr(haystack, needle), -1);
+    }
+
+    @Test
+    public void testRandomCase2Found() {
+        String haystack = "mississippi";
+        String needle = "issip";
+        assertEquals(StrStr.strStr(haystack, needle), 4);
+    }
+
+    @Test
+    public void testRandomCase3Found() {
+        String haystack = "duuuuuuy";
+        String needle = "u";
+        assertEquals(StrStr.strStr(haystack, needle), 1);
+    }
+}