We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Between Two Sets
  5. Discussions

Between Two Sets

  • tunde3
     + 0 comments

    This solution is best using the brute-force approach — it's shorter, faster, and cleaner vs LCM and GCD traditional.

    def getTotalX(a, b):
    # Write your code here
    count = 0
    for x in range(max(a), min(b) + 1):
        # Check if x is divisible by all elements in a
        if all(x % ai == 0 for ai in a):
            # Check if x divides all elements in b
            if all(bi % x == 0 for bi in b):
                count += 1
    return count