Added test

Author: javadev

src/main/java/g3301_3400/s3361_shift_distance_between_two_strings/Solution.java

@@ -9,9 +9,6 @@ public long shiftDistance(String s, String t, int[] nextCost, int[] previousCost
         for (int i = 0; i < n; i++) {
             int ch1 = s.charAt(i) - 'a';
             int ch2 = t.charAt(i) - 'a';
-            if (ch1 == ch2) {
-                continue;
-            }
             int forwardDiff = (ch2 - ch1 + 26) % 26;
             long forwardCost = 0;
             for (int j = 0; j < forwardDiff; j++) {

src/test/java/g3301_3400/s3360_stone_removal_game/SolutionTest.java

@@ -15,4 +15,9 @@ void canAliceWin() {
     void canAliceWin2() {
         assertThat(new Solution().canAliceWin(1), equalTo(false));
     }
+
+    @Test
+    void canAliceWin3() {
+        assertThat(new Solution().canAliceWin(19), equalTo(false));
+    }
 }