Added Solution for 900-1000q/1064 900-1000q/1065 1000-1100q/1064 1000-1100q/1065 1000-1100q/1071

Author: Garvit244

900-1000q/1064.py renamed to 1000-1100q/1064.py

@@ -0,0 +1,53 @@
+'''
+For strings S and T, we say "T divides S" if and only if S = T + ... + T  (T concatenated with itself 1 or more times)
+
+Return the largest string X such that X divides str1 and X divides str2.
+
+ 
+
+Example 1:
+
+Input: str1 = "ABCABC", str2 = "ABC"
+Output: "ABC"
+Example 2:
+
+Input: str1 = "ABABAB", str2 = "ABAB"
+Output: "AB"
+Example 3:
+
+Input: str1 = "LEET", str2 = "CODE"
+Output: ""
+ 
+
+Note:
+
+1 <= str1.length <= 1000
+1 <= str2.length <= 1000
+str1[i] and str2[i] are English uppercase letters.
+
+'''
+class Solution(object):
+    def gcdOfStrings(self, str1, str2):
+        """
+        :type str1: str
+        :type str2: str
+        :rtype: str
+        """
+        if len(str1)  > len(str2):
+            str1, str2 = str2, str1
+            
+        l_str1 = len(str1)
+        for index in range(1, len(str1)+1):
+            if l_str1%index != 0:
+                continue
+                
+            size_to_take = int(l_str1/index)
+            substr1 = str1[:size_to_take]
+            substr2 = str2
+            
+            while substr1 == substr2[:size_to_take]:
+                substr2 = substr2[size_to_take:]
+                
+            if substr2 == "":
+                return substr1
+        return ""

900-1000q/1065.py renamed to 1000-1100q/1065.py

@@ -15,6 +15,7 @@ Python solution of problems from [LeetCode](https://leetcode.com/).
 ##### [Problems 1000-1100](./1000-1100q/)
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
+|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings)|[Python](./1000-1100q/1071.py)|Easy|
 |1065|[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string)|[Python](./1000-1100q/1065.py)|Easy|
 |1064|[Fixed Point](https://leetcode.com/problems/fixed-point)|[Python](./1000-1100q/1064.py)|Easy|
 |1054|[Distant Barcodes](https://leetcode.com/problems/distant-barcodes)|[Python](./1000-1100q/1054.py)|Medium|