input: Write a function to find the first 10 prime numbers less than a given number.
  assert find_prime_numbers(100) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
  assert find_prime_numbers(50) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
  assert find_prime_numbers(30) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
output: def find_prime_numbers(n):
      def is_prime(k):
          if k < 2:
              return False
          for i in range(2, int(k ** 0.5) + 1):
              if k % i == 0:
                  return False
          return True
  
      primes = []
      num = 2
      while len(primes) < 10 and num < n:
          if is_prime(num):
              primes.append(num)
          num += 1
  
      return primes