



'''simple docstring'''



_lowercase       :						Optional[int]						={
    "+": lambda x, y: x + y,
    "-": lambda x, y: x - y,
    "*": lambda x, y: x * y,
    "/": lambda x, y: x / y,
}


def 							__UpperCAmelCase				(				UpperCamelCase__				:List[str]			)		->						Dict:
				return c.isdigit()


def 							__UpperCAmelCase				(				UpperCamelCase__				:Union[str, Any]			)		->						Dict:
				snake_case__      :   Union[str, Any]      =    []

				# iterate over the string in reverse order
				for c in expression.split()[::-1]:
								# push operand to stack
								if is_operand(UpperCamelCase__			):
												stack.append(int(UpperCamelCase__			)			)

								else:
												# pop values from stack can calculate the result
												# push the result onto the stack again
												snake_case__      :   List[Any]      =    stack.pop()
												snake_case__      :   List[str]      =    stack.pop()
												stack.append(calc[c](UpperCamelCase__   ,				UpperCamelCase__			)			)

				return stack.pop()


# Driver code
if __name__ == "__main__":
				_lowercase       :						int						="+ 9 * 2 6"
				print(evaluate(test_expression))

				_lowercase       :						int						="/ * 10 2 + 4 1 "
				print(evaluate(test_expression))









'''simple docstring'''



def 							__UpperCAmelCase				(				UpperCamelCase__				:int   ,				UpperCamelCase__				:list			)		->						list:
				snake_case__      :   List[str]      =    sorted(UpperCamelCase__   ,				key=lambda UpperCamelCase__			: value[2]   ,				reverse=UpperCamelCase__			)

				# Create a list of size equal to the maximum deadline
				# and initialize it with -1
				snake_case__      :   Any      =    max(UpperCamelCase__   ,				key=lambda UpperCamelCase__			: value[1]			)[1]
				snake_case__      :   str      =    [-1] * max_deadline

				# Finding the maximum profit and the count of jobs
				snake_case__      :   List[str]      =    0
				snake_case__      :   Optional[Any]      =    0
				for job in jobs:
								# Find a free time slot for this job
								# (Note that we start from the last possible slot)
								for i in range(job[1] - 1   ,				-1   ,				-1			):
												if time_slots[i] == -1:
																snake_case__      :   Optional[Any]      =    job[0]
																count += 1
																max_profit += job[2]
																break
				return [count, max_profit]


if __name__ == "__main__":
				import doctest

				doctest.testmod()




