input: def generate_prime_list(n):
      """Write a function that takes a non-negative integer and returns a list of prime numbers less than n.
      for example:
      generate_prime_list(5) => [2,3]
      generate_prime_list(11) => [2,3,5,7]
      generate_prime_list(0) => []
      generate_prime_list(20) => [2,3,5,7,11,13,17,19]
      generate_prime_list(1) => []
      generate_prime_list(18) => [2,3,5,7,11,13,17]
      """
output:     if n <= 2:
          return []
      
      primes = []
      for num in range(2, n):
          is_prime = True
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  is_prime = False
                  break
          if is_prime:
              primes.append(num)
      
      return primes