input: def find_primes(n: int) -> List[int]:
      """ Given a number n, find all prime numbers less than or equal to n.
      >>> find_primes(10)
      [2, 3, 5, 7]
      >>> find_primes(2)
      [2]
      """
      def is_prime(num: int) -> bool:
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return num > 1
      
      return [num for num in range(2, n + 1) if is_prime(num)]
output:     def is_prime(num: int) -> bool:
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return num > 1
      
      return [num for num in range(2, n + 1) if is_prime(num)]