input: def find_primes(n: int) -> List[int]:
      """ Find all prime numbers up to n and return them in a list.
      >>> find_primes(10)
      [2, 3, 5, 7]
      >>> find_primes(20)
      [2, 3, 5, 7, 11, 13, 17, 19]
      """
      
      def is_prime(num: int) -> bool:
          # Check if the number is prime
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      # List to store prime numbers
      primes = []
      
      # Iterate from 2 to n
      for i in range(2, n + 1):
          if is_prime(i):
              primes.append(i)
      
      return primes
output:     def is_prime(num: int) -> bool:
          # Check if the number is prime
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      # List to store prime numbers
      primes = []
      
      # Iterate from 2 to n
      for i in range(2, n + 1):
          if is_prime(i):
              primes.append(i)
      
      return primes