Closed threeal closed 1 month ago
This issue suggests solving the problem 1071. Greatest Common Divisor of Strings. To achieve this, one can simply check all possibilities from the largest size of the common divisor to the smallest size (empty string).
This issue suggests solving the problem 1071. Greatest Common Divisor of Strings. To achieve this, one can simply check all possibilities from the largest size of the common divisor to the smallest size (empty string).