




"""simple docstring"""






from __future__ import annotations







def      _snake_case			(				lowercase__							,    lowercase__							,    lowercase__							,    ):
				if (electron_conc, hole_conc, intrinsic_conc).count(0		) != 1:
								raise ValueError('You cannot supply more or less than 2 values'		)
				elif electron_conc < 0:
								raise ValueError('Electron concentration cannot be negative in a semiconductor'		)
				elif hole_conc < 0:
								raise ValueError('Hole concentration cannot be negative in a semiconductor'		)
				elif intrinsic_conc < 0:
								raise ValueError(
								    'Intrinsic concentration cannot be negative in a semiconductor'		)
				elif electron_conc == 0:
								return (
								    "electron_conc",
								    intrinsic_conc**2 / hole_conc,
								)
				elif hole_conc == 0:
								return (
								    "hole_conc",
								    intrinsic_conc**2 / electron_conc,
								)
				elif intrinsic_conc == 0:
								return (
								    "intrinsic_conc",
								    (electron_conc * hole_conc) ** 0.5,
								)
				else:
								return (-1, -1)


if __name__ == "__main__":
			import doctest

			doctest.testmod()





"""simple docstring"""






import functools
from typing import Any







def      _snake_case			(				lowercase__							,    lowercase__		):

				# Validation
				if not isinstance(lowercase__							,    lowercase__		) or len(lowercase__		) == 0:
								raise ValueError('the string should be not empty string'		)

				if not isinstance(lowercase__							,    lowercase__		) or not all(
				    isinstance(lowercase__							,    lowercase__		) and len(lowercase__		) > 0 for item in words		):
								raise ValueError('the words should be a list of non-empty strings'		)

				# Build trie
				_lowerCamelCase     :			dict[str, Any]    =    {}
				_lowerCamelCase     :			List[Any]    =    'WORD_KEEPER'

				for word in words:
								_lowerCamelCase     :			Dict    =    trie
								for c in word:
												if c not in trie_node:
																_lowerCamelCase     :			Any    =    {}

												_lowerCamelCase     :			str    =    trie_node[c]

								_lowerCamelCase     :			Optional[Any]    =    True

				_lowerCamelCase     :			Dict    =    len(lowercase__		)

				# Dynamic programming method
				@functools.cache
				def is_breakable(lowercase__		) -> bool:
								if index == len_string:
												return True

								_lowerCamelCase     :			List[Any]    =    trie
								for i in range(lowercase__							,    lowercase__		):
												_lowerCamelCase     :			Any    =    trie_node.get(string[i]							,    lowercase__		)

												if trie_node is None:
																return False

												if trie_node.get(lowercase__							,    lowercase__		) and is_breakable(i + 1		):
																return True

								return False

				return is_breakable(0		)


if __name__ == "__main__":
			import doctest

			doctest.testmod()