solves repeated substring pattern

Author: anishLearnsToCode

Diff for: README.md

@@ -120,7 +120,7 @@
 | 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/FindAllNumbersDisappearedInAnArray.java) |
 | 453 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MinimumMovesToEqualArrayElements.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/minimum_moves_to_equal_array_element.py) |
 | 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/AssignCookies.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/assign_cookies.py)|
-| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | Easy | |
+| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/RepeatedSubstringPattern.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/repeated_substring_pattern.py) |
 | 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance) | Easy | |
 | 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter) | Easy | |
 | 475 | [Heaters](https://leetcode.com/problems/heaters) | Easy | |

Diff for: python/repeated_substring_pattern.py

@@ -0,0 +1,19 @@
+class Solution:
+    def repeatedSubstringPattern(self, pattern: str) -> bool:
+        for length in range(1, len(pattern) // 2 + 1):
+            if len(pattern) % length == 0:
+                substring = pattern[:length]
+                if self.patternComposedOf(pattern, substring):
+                    return True
+        return False
+
+    def patternComposedOf(self, pattern: str, substring: str) -> bool:
+        for i in range(len(pattern) // len(substring)):
+            for j in range(len(substring)):
+                if substring[j] != pattern[i * len(substring) + j]:
+                    return False
+        return True
+
+
+sol = Solution()
+print(sol.repeatedSubstringPattern('a'))

Diff for: src/IntersectionOfTwoArrays.java

@@ -3,7 +3,6 @@
 import java.util.List;
 import java.util.Set;
 
-IntersectionOfTwoArrays
 public class IntersectionOfTwoArrays {
     public static int[] intersection(int[] array1, int[] array2) {
         Set<Integer> numbers1 = setFrom(array1);

Diff for: src/RepeatedSubstringPattern.java

@@ -0,0 +1,24 @@
+public class RepeatedSubstringPattern {
+    public static boolean repeatedSubstringPattern(String pattern) {
+        for (int len = 1 ; len <= pattern.length() / 2 ; len++) {
+            if (pattern.length() % len == 0) {
+                String substring = pattern.substring(0, len);
+                if (patternComposedOf(pattern, substring)) {
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+
+    private static boolean patternComposedOf(String pattern, String subString) {
+        for (int i = 0 ; i < pattern.length() / subString.length() ; i++) {
+            for (int j = 0 ; j < subString.length() ; j++) {
+                if (subString.charAt(j) != pattern.charAt(i * subString.length() + j)) {
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+}

Diff for: src/ReverseVowelsOfString.java

@@ -24,7 +24,7 @@ public static String reverseVowels(String string) {
         StringBuilder result = new StringBuilder();
         for (int index = 0, j = vowels.size() - 1 ; index < string.length() ; index++) {
             char character = string.charAt(index);
-            result.append(isVowel(character) ? vowels.get(j--) : character);
+            result.append((char) (isVowel(character) ? vowels.get(j--) : character));
         }
         return result.toString();
     }