add 1933

Author: fishercoder1534

README.md

@@ -51,6 +51,7 @@ _If you like this project, please leave me a star._ ★
 |1941|[Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1941.java) ||Easy||
 |1936|[Add Minimum Number of Rungs](https://leetcode.com/problems/add-minimum-number-of-rungs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1936.java) ||Medium||
 |1935|[Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1935.java) ||Easy|String|
+|1933|[Check if String Is Decomposable Into Value-Equal Substrings](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1933.java) ||Easy|String|
 |1929|[Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1929.java) ||Easy||
 |1926|[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1926.java) ||Medium|DP, DFS, BFS|
 |1925|[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java) ||Easy|Array, Greedy|

src/main/java/com/fishercoder/solutions/_1933.java

@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+public class _1933 {
+    public static class Solution1 {
+        public boolean isDecomposable(String s) {
+            int lengthTwoCount = 0;
+            for (int i = 0; i < s.length(); i++) {
+                int start = i;
+                char prev = s.charAt(start);
+                while (i < s.length() && s.charAt(i) == prev) {
+                    i++;
+                }
+                if (i >= s.length()) {
+                    i--;
+                }
+                if (s.charAt(i) != prev) {
+                    i--;
+                }
+                if ((i - start + 1) % 3 == 2) {
+                    lengthTwoCount++;
+                } else if ((i - start + 1) % 3 == 0) {
+                    continue;
+                } else {
+                    return false;
+                }
+            }
+            return lengthTwoCount == 1;
+        }
+    }
+}

src/test/java/com/fishercoder/_1933Test.java

@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1933;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1933Test {
+    private static _1933.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1933.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(false, solution1.isDecomposable("000111000"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(true, solution1.isDecomposable("00011111222"));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(false, solution1.isDecomposable("011100022233"));
+    }
+
+}