




def       lowerCAmelCase_      (	lowerCamelCase:							list    )       ->      bool:


      '''simple docstring'''




      if not isinstance(lowerCamelCase  ,					lowerCamelCase    ):
            raise ValueError('Input series is not valid, valid series - [1, 2/3, 2]'    )
      if len(lowerCamelCase    ) == 0:
            raise ValueError('Input list must be a non empty list'    )
      if len(lowerCamelCase    ) == 1 and series[0] != 0:
            return True
      lowerCamelCase__   	=					[]
      lowerCamelCase__   	=					len(lowerCamelCase    )
      for i in range(0  ,					lowerCamelCase    ):
            if series[i] == 0:
                  raise ValueError('Input series cannot have 0 as an element'    )
            rec_series.append(1 / series[i]    )
      lowerCamelCase__   	=					rec_series[1] - rec_series[0]
      for index in range(2  ,					lowerCamelCase    ):
            if rec_series[index] - rec_series[index - 1] != common_diff:
                  return False
      return True

def       lowerCAmelCase_      (	lowerCamelCase:							list    )       ->      float:


      '''simple docstring'''




      if not isinstance(lowerCamelCase  ,					lowerCamelCase    ):
            raise ValueError('Input series is not valid, valid series - [2, 4, 6]'    )
      if len(lowerCamelCase    ) == 0:
            raise ValueError('Input list must be a non empty list'    )
      lowerCamelCase__   	=					0
      for val in series:
            answer += 1 / val
      return len(lowerCamelCase    ) / answer


if __name__ == "__main__":
      import doctest

      doctest.testmod()





from string import ascii_uppercase

def       lowerCAmelCase_      (	lowerCamelCase:							str  ,					lowerCamelCase:							str  ,					lowerCamelCase:							bool = False  ,					lowerCamelCase:							str = ascii_uppercase    )       ->      str:


      '''simple docstring'''




      lowerCamelCase__   	=					keyword.upper()
      lowerCamelCase__   	=					plaintext.upper()
      lowerCamelCase__   	=					set(lowerCamelCase    )

      # create a list of unique characters in the keyword - their order matters
      # it determines how we will map plaintext characters to the ciphertext
      lowerCamelCase__   	=					[]
      for char in keyword:
            if char in alphabet_set and char not in unique_chars:
                  unique_chars.append(lowerCamelCase    )
    # the number of those unique characters will determine the number of rows
      lowerCamelCase__   	=					len(lowerCamelCase    )

      # create a shifted version of the alphabet
      lowerCamelCase__   	=					unique_chars + [
          char for char in alphabet if char not in unique_chars
      ]

      # create a modified alphabet by splitting the shifted alphabet into rows
      lowerCamelCase__   	=					[
          shifted_alphabet[k : k + num_unique_chars_in_keyword]
          for k in range(0  ,					26  ,					lowerCamelCase    )
      ]

      # map the alphabet characters to the modified alphabet characters
      # going 'vertically' through the modified alphabet - consider columns first
      lowerCamelCase__   	=					{}
      lowerCamelCase__   	=					0
      for column in range(lowerCamelCase    ):
            for row in modified_alphabet:
                  # if current row (the last one) is too short, break out of loop
                  if len(lowerCamelCase    ) <= column:
                        break

                  # map current letter to letter in modified alphabet
                  lowerCamelCase__   	=					row[column]
                  letter_index += 1

      if verbose:
            print(lowerCamelCase    )
      # create the encrypted text by mapping the plaintext to the modified alphabet
      return "".join(mapping[char] if char in mapping else char for char in plaintext    )


if __name__ == "__main__":
      # example use
      print(mixed_keyword("""college""", """UNIVERSITY"""))