EasyNo. 1071

Greatest Common Divisor of Strings — LeetCode 1071 Python Solution

Topics
Math, String
On a study list
LeetCode 75
Reading time
2 min

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

PythonSolution
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

Related problems
No.ProblemDifficulty
0043Multiply StringsMedium
0168Excel Sheet Column TitleEasy
0171Excel Sheet Column NumberEasy
0273Integer to English WordsHard
0412Fizz BuzzEasy
0415Add StringsEasy

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.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.