Leetcode Practice

LC 1071. Greatest Common Divisor of Strings

Last updated
Reading time
1 min read

The problem

Solution - O(n)O(n) Time

function gcd(a: number, b: number) {
  return b == 0 ? a : gcd(b, a % b)
}

function gcdOfStrings(str1: string, str2: string): string {
  if (str1 + str2 !== str2 + str1) return ''

  const gcdLength = gcd(str1.length, str2.length)
  return str1.substring(0, gcdLength)
}