EasyNo. 1071
Greatest Common Divisor of Strings — LeetCode 1071 Python Solution
- Pattern
- Math and Number Theory
- Topics
- Math, String
- On a study list
- LeetCode 75
- Reading time
- 2 min
- Source
- leetcode.com
The problem
For two strings s and t, we say "t divides s" if and only if s = t + t + t + ... + t + t (i.e., t is concatenated with itself one or more times).
Python solution
class Solution:
def gcdOfStrings(self, str1: str, str2: str) -> str:
def check(a, b):
c = ""
while len(c) < len(b):
c += a
return c == b
for i in range(min(len(str1), len(str2)), 0, -1):
t = str1[:i]
if check(t, str1) and check(t, str2):
return t
return ''Complexity
- Time
- O(n) or O(1)
- Space · auxiliary
- O(1)
Pattern: Math and Number Theory
Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 1071. Greatest Common Divisor of Strings is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.
The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0043 | Multiply Strings | Medium |
| 0168 | Excel Sheet Column Title | Easy |
| 0171 | Excel Sheet Column Number | Easy |
| 0273 | Integer to English Words | Hard |
| 0412 | Fizz Buzz | Easy |
| 0415 | Add Strings | Easy |
Frequently asked questions
- How hard is LeetCode 1071. Greatest Common Divisor of Strings?
LeetCode 1071. Greatest Common Divisor of Strings is rated Easy on LeetCode.
- What topics does LeetCode 1071. Greatest Common Divisor of Strings cover?
LeetCode 1071. Greatest Common Divisor of Strings is tagged Math and String on LeetCode.